HDU 5828 Rikka with Sequence

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<iostream>
using namespace std;
typedef long long LL;
const double pi=acos(-1.0),eps=1e-8;
void File()
{
    freopen("D:\\in.txt","r",stdin);
    freopen("D:\\out.txt","w",stdout);
}
inline int read()
{
    char c = getchar(); while(!isdigit(c)) c = getchar(); int x = 0;
    while(isdigit(c)) { x = x * 10 + c - ‘0‘; c = getchar();  }
    return x;
}

const int maxn=100000+10;
struct Seg { LL sum,f,MAX,MIN; }s[4*maxn];
int T,n,m;

void pushUp(int rt)
{
    s[rt].sum=s[2*rt].sum+s[2*rt+1].sum;
    s[rt].MAX=max(s[2*rt].MAX,s[2*rt+1].MAX);
    s[rt].MIN=min(s[2*rt].MIN,s[2*rt+1].MIN);
}

void pushDown(int l,int r,int rt)
{
    if(s[rt].MIN==s[rt].MAX)
    {
        s[2*rt].MIN=s[2*rt+1].MIN=s[rt].MIN;
        s[2*rt].MAX=s[2*rt+1].MAX=s[rt].MAX;

        int fz=(l+r)/2-l+1;
        s[2*rt].sum=(LL)fz*s[rt].MIN;
        s[2*rt+1].sum=s[rt].sum-s[2*rt].sum;
        s[rt].f=s[2*rt].f=s[2*rt+1].f=0;
        return;
    }

    if(s[rt].f==0) return;

    s[2*rt].f=s[2*rt].f+s[rt].f;
    s[2*rt+1].f=s[2*rt+1].f+s[rt].f;

    s[2*rt].MAX=s[2*rt].MAX+s[rt].f;
    s[2*rt+1].MAX=s[2*rt+1].MAX+s[rt].f;

    s[2*rt].MIN=s[2*rt].MIN+s[rt].f;
    s[2*rt+1].MIN=s[2*rt+1].MIN+s[rt].f;

    int m=(l+r)/2;
    s[2*rt].sum=s[2*rt].sum+(LL)(m-l+1)*s[rt].f;
    s[2*rt+1].sum=s[2*rt+1].sum+(LL)(r-m)*s[rt].f;

    s[rt].f=0;
}

void build(int l,int r,int rt)
{
    s[rt].f=0; s[rt].MAX=0; s[rt].MIN=0; s[rt].sum=0;
    if(l==r)
    {
        scanf("%lld",&s[rt].sum);
        s[rt].f=0; s[rt].MAX=s[rt].sum; s[rt].MIN=s[rt].sum;
        return;
    }
    int m=(l+r)/2;
    build(l,m,2*rt);
    build(m+1,r,2*rt+1);
    pushUp(rt);
}

void add(int L,int R,int x,int l,int r,int rt)
{
    if(L<=l&&r<=R)
    {
        s[rt].f=s[rt].f+x; s[rt].MAX=s[rt].MAX+x;
        s[rt].MIN=s[rt].MIN+x; s[rt].sum=s[rt].sum+(r-l+1)*(LL)x;
        return;
    }
    pushDown(l,r,rt);
    int m=(l+r)/2;
    if(L<=m) add(L,R,x,l,m,2*rt);
    if(R>m)  add(L,R,x,m+1,r,2*rt+1);
    pushUp(rt);
}

LL quary(int L,int R,int l,int r,int rt)
{
    if(L<=l&&r<=R) return s[rt].sum;
    pushDown(l,r,rt);
    int m=(l+r)/2; LL x1=0,x2=0;
    if(L<=m) x1=quary(L,R,l,m,2*rt);
    if(R>m)  x2=quary(L,R,m+1,r,2*rt+1);
    pushUp(rt);
    return x1+x2;
}

void force(int l,int r,int rt)
{
    if(l==r)
    {
        s[rt].sum=(LL)sqrt(1.0*s[rt].sum);
        s[rt].MIN=s[rt].MAX=s[rt].sum;
        return;
    }
    if(s[rt].MIN==s[rt].MAX)
    {
        s[rt].MAX=s[rt].MIN=(LL)sqrt(1.0*s[rt].MIN);
        s[rt].sum=(LL)(r-l+1)*s[rt].MIN;
        return;
    }
    pushDown(l,r,rt);
    int m=(l+r)/2;
    if(s[2*rt].MAX!=1) force(l,m,2*rt);
    if(s[2*rt+1].MAX!=1) force(m+1,r,2*rt+1);
    pushUp(rt);
}

void update(int L,int R,int l,int r,int rt)
{
    if(L<=l&&r<=R) { if(s[rt].MAX==1) return; force(l,r,rt); return; }
    pushDown(l,r,rt);
    int m=(l+r)/2;
    if(L<=m&&s[2*rt].MAX!=1) update(L,R,l,m,2*rt);
    if(R>m&&s[2*rt+1].MAX!=1) update(L,R,m+1,r,2*rt+1);
    pushUp(rt);
}

int main()
{
    scanf("%d",&T); while(T--)
    {
        scanf("%d%d",&n,&m); build(1,n,1);
        for(int i=1;i<=m;i++)
        {
            int op,L,R,x; scanf("%d%d%d",&op,&L,&R);
            if(op==1) { scanf("%d",&x); add(L,R,x,1,n,1); }
            else if(op==2) update(L,R,1,n,1);
            else if(op==3) printf("%lld\n",quary(L,R,1,n,1));
        }
    }
    return 0;
}