CH模拟赛 还教室

/*
区间操作，可以推一推式子，方差为平方的平均数-平均数的平方，维护区间和与区间平方和，平方和的维护方法类似，式子推一推就行了，注意约分
*/
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#define ll long long
#define fo(i,l,r) for(int i = l;i <= r;i++)
#define fd(i,l,r) for(int i = r;i >= l;i--)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
using namespace std;
const int N = ;
ll read(){
    ll x=,f=;
    char ch=getchar();
    while(!(ch>=''&&ch<='')){if(ch=='-')f=-;ch=getchar();};
    while(ch>=''&&ch<=''){x=x*+(ch-'');ch=getchar();};
    return x*f;
}
ll gcd(ll a,ll b){return b==?a:gcd(b,a%b);}
struct fs{
    ll son;
    ll mo;
    void yf(){
        if(son ==  || mo == ){
            if(son == ) mo = ;
            return;
        }
        ll d = gcd(son,mo);
        son /= d;
        mo /= d;
    }
    void clear(ll a,ll b){
        son = a;
        mo = b;
        yf();
    }
    fs operator + (fs b){
        fs a=*this;
        ll d = gcd(a.mo,b.mo);
        ll lcm = a.mo / d * b.mo;
        a.son *= lcm / a.mo;
        b.son *= lcm / b.mo;
        a.son += b.son;
        a.mo = lcm;
        a.yf();
        return a;
    }
    fs operator - (fs b){
        fs a=*this;
        ll d = gcd(a.mo,b.mo);
        ll lcm = a.mo / d * b.mo;
        a.son *= lcm / a.mo;
        b.son *= lcm / b.mo;
        a.son -= b.son;
        a.mo = lcm;
        if(!a.son) a.mo = ;
        else a.yf();
        return a;
    }
    fs operator * (fs b){
        fs a=*this;
        a.son *= b.son;
        a.mo *= b.mo;
        a.yf();
        return a;
    }
    fs operator / (ll b){
        fs a =*this;
        a.mo *= b;
        a.yf();
        return a;
    }
    bool operator < (fs b){
        return son*b.mo < mo*b.son;
    }
    fs operator - (ll k){
        fs b,a=*this;
        b.clear(k,);
        if(a<b) swap(a,b);
        return a-b;
    }
    void print(){
        printf("%I64d/%I64d\n",son,mo);
    }
}ans,fd;
int n,m;ll val[N];
ll sumv[N<<],addv[N<<],powv[N<<];
ll cmd,op,ql,qr,qv,ans1,ans2;
void maintain(int rt){
    sumv[rt] = sumv[rt<<] + sumv[rt<<|];
    powv[rt] = powv[rt<<] + powv[rt<<|];
}
void pushdown(int l,int r,int rt){
    int m = (l + r) >> ;
    if(!addv[rt]) return;
    addv[rt<<] += addv[rt];
    addv[rt<<|] += addv[rt];
    powv[rt<<] += *addv[rt]*sumv[rt<<] + (m-l+)*addv[rt]*addv[rt];
    powv[rt<<|] += *addv[rt]*sumv[rt<<|] + (r-m)*addv[rt]*addv[rt];
    sumv[rt<<] += addv[rt] * (m-l+);
    sumv[rt<<|] += addv[rt] * (r-m);
    addv[rt] = ;
}
void build(int l,int r,int rt){
    addv[rt] = ;
    if(l==r){
        powv[rt] = val[l]*val[l];
        sumv[rt] = val[l];
        return;
    }
    int m = (l + r) >> ;
    build(lson);
    build(rson);
    maintain(rt);
}
void change(ll l,ll r,int rt){
    if(ql <= l && qr >= r){
        addv[rt] += qv;
        powv[rt] += *qv*sumv[rt] + qv*qv*(r-l+);
        sumv[rt] += qv*(r-l+);
        return;
    }
    pushdown(l,r,rt);
    int m = (l + r) >> ;
    if(ql <= m) change(lson);
    if(qr > m) change(rson);
    maintain(rt);
}
ll query(int l,int r,int rt){
    if(ql <= l && qr >= r){
        if(op == ) return sumv[rt];
        else return powv[rt];
    }
    pushdown(l,r,rt);
    int m = (l + r) >> ;
    ll ret = ;
    if(ql <= m) ret += query(lson);
    if(qr > m) ret += query(rson);
    return ret;
}
int main(){
    freopen("classroom.in","r",stdin);
    freopen("classroom.out","w",stdout);
    n =read();m=read();
    fo(i,,n) val[i]=read();
    build(,n,);
    fo(i,,m){
        cmd=read();ql=read();qr=read();
        if(cmd==){
            qv=read();
            change(,n,);
        }else if(cmd == ){
            op = ;
            ans1=query(,n,);
            ans2=(qr-ql+);
            ans.clear(ans1,ans2);
            ans.print();
        }else if(cmd == ){
            op = ;
            ans1=query(,n,);
            ans2=(qr-ql+);
            ans.clear(ans1,ans2);
            ans1=ans2=;
            op = ;
            ans1=query(,n,);
            ans2=(qr-ql+);
            fd.clear(ans1,ans2);
            fd = fd*fd;
            ans = ans-fd;
            ans.print();
        }
    }
    return ;
}