bzoj1798: [Ahoi2009]Seq 维护序列seq

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define rep(i,s,t) for(int i=s;i<=t;i++)
#define dwn(i,s,t) for(int i=s;i>=t;i--)
#define clr(x,c) memset(x,c,sizeof(x))
#define ll long long
#define lson l,mid,x<<1
#define rson mid+1,r,x<<1|1
int read(){
    int x=0;char c=getchar();
    while(!isdigit(c)) c=getchar();
    while(isdigit(c)) x=x*10+c-‘0‘,c=getchar();
    return x;
}
const int nmax=100010;
int n,mod;
ll sum[nmax<<2],col[nmax<<2],tag[nmax<<2];
void build(int l,int r,int x){
    col[x]=0;tag[x]=1;
    if(l==r){
        sum[x]=read()%mod;return ;
    }
    int mid=(l+r)>>1;build(lson);build(rson);
    sum[x]=(sum[x<<1]+sum[x<<1|1])%mod;
}
void pushdown(int x,int cnt){
    if(!col[x]&&tag[x]==1) return ;
    int lc=x<<1,rc=x<<1|1;
    tag[lc]=(tag[lc]*tag[x])%mod;
    tag[rc]=(tag[rc]*tag[x])%mod;
    col[lc]=(col[lc]*tag[x]+col[x])%mod;
    col[rc]=(col[rc]*tag[x]+col[x])%mod;
    sum[lc]=(sum[lc]*tag[x]+col[x]*(cnt-(cnt>>1)))%mod;
    sum[rc]=(sum[rc]*tag[x]+col[x]*(cnt>>1))%mod;
    col[x]=0;tag[x]=1;
}
void update(int tl,int tr,int p,int l,int r,int x){
    if(tl<=l&&tr>=r){
        tag[x]=(tag[x]*p)%mod;
        col[x]=(col[x]*p)%mod;
        sum[x]=(sum[x]*p)%mod;
        return ;
    }
    pushdown(x,r-l+1);
    int mid=(l+r)>>1;
    if(tl<=mid) update(tl,tr,p,lson);
    if(tr>mid) update(tl,tr,p,rson);
    sum[x]=(sum[x<<1]+sum[x<<1|1])%mod;
}
void modify(int tl,int tr,int p,int l,int r,int x){
    if(tl<=l&&tr>=r){
        col[x]=(col[x]+p)%mod;
        sum[x]=(sum[x]+(ll)p*(r-l+1))%mod;
        return ;
    }
    pushdown(x,r-l+1);
    int mid=(l+r)>>1;
    if(tl<=mid) modify(tl,tr,p,lson);
    if(tr>mid) modify(tl,tr,p,rson);
    sum[x]=(sum[x<<1]+sum[x<<1|1])%mod;
}
ll query(int tl,int tr,int l,int r,int x){
    if(tl<=l&&tr>=r) return sum[x];
    pushdown(x,r-l+1);
    int mid=(l+r)>>1;ll ans=0;
    if(tl<=mid) ans+=query(tl,tr,lson);
    if(tr>mid) ans+=query(tl,tr,rson);
    return ans%mod;
}
int main(){
    n=read(),mod=read();
    build(1,n,1);
    int m=read(),u,v,d,tmp;
    rep(i,1,m){
        u=read(),v=read(),d=read();
        if(u==1) tmp=read(),update(v,d,tmp,1,n,1);
        else if(u==2) tmp=read(),modify(v,d,tmp,1,n,1);
        else printf("%lld\n",query(v,d,1,n,1));
    }
    return 0;
}