【bzoj1798】【AHOI2009】维护序列

练一下线段树模板，区间乘法。

#include<bits/stdc++.h>
#define lson (o<<1)
#define rson (o<<1|1)
const int N=;
using namespace std;
typedef long long ll;
ll n,m,yql;
ll a[N];
struct Segment_Tree{
    ll sumv[N<<],addv[N<<],mulv[N<<];
    inline void pushup(int o){sumv[o]=(sumv[lson]+sumv[rson])%yql;}
    inline void pushdown(int o,int l,int r){
        if(mulv[o]==&&addv[o]==)return;
        int mid=(l+r)>>;
        mulv[lson]=mulv[lson]*mulv[o]%yql;
        mulv[rson]=mulv[rson]*mulv[o]%yql;
        addv[lson]=(addv[lson]*mulv[o]%yql+addv[o])%yql;
        addv[rson]=(addv[rson]*mulv[o]%yql+addv[o])%yql;
        sumv[lson]=((sumv[lson]*mulv[o])%yql+addv[o]*1LL*(mid-l+)%yql)%yql;
        sumv[rson]=((sumv[rson]*mulv[o])%yql+addv[o]*1LL*(r-mid)%yql)%yql;
        mulv[o]=;addv[o]=;
    }
    inline void build(int o,int l,int r){
        mulv[o]=;addv[o]=;sumv[o]=;
        if(l==r){sumv[o]=a[l];return;}
        int mid=(l+r)>>;
        build(lson,l,mid);build(rson,mid+,r);
        pushup(o);
    }
    inline void mul(int o,int l,int r,int ql,int qr,int v){
        if(ql<=l&&r<=qr){
            mulv[o]=mulv[o]*1LL*v%yql;
            addv[o]=addv[o]*1LL*v%yql;
            sumv[o]=sumv[o]*1LL*v%yql;
            return;
        }
        pushdown(o,l,r);
        int mid=(l+r)>>;
        if(ql<=mid)mul(lson,l,mid,ql,qr,v);
        if(qr>mid)mul(rson,mid+,r,ql,qr,v);
        pushup(o);
    }
    inline void add(int o,int l,int r,int ql,int qr,int v){
        if(ql<=l&&r<=qr){
            addv[o]=(addv[o]+1LL*v)%yql;
            sumv[o]=(sumv[o]+1LL*(r-l+)*v%yql)%yql;
            return;
        }
        pushdown(o,l,r);
        int mid=(l+r)>>;
        if(ql<=mid)add(lson,l,mid,ql,qr,v);
        if(qr>mid)add(rson,mid+,r,ql,qr,v);
        pushup(o);
    }
    inline ll querysum(int o,int l,int r,int ql,int qr){
        if(ql<=l&&r<=qr)return sumv[o];
        int mid=(l+r)>>;ll ans=;
        pushdown(o,l,r);
        if(ql<=mid)ans+=querysum(lson,l,mid,ql,qr),ans%=yql;
        if(qr>mid)ans+=querysum(rson,mid+,r,ql,qr),ans%=yql;
        return ans;
    }
}T;
inline ll read(){
    ll f=,x=;char ch;
    do{ch=getchar();if(ch=='-')f=-;}while(ch<''||ch>'');
    do{x=x*+ch-'';ch=getchar();}while(ch>=''&&ch<='');
    return f*x;
}
int main(){
    n=read();yql=read();
    for(int i=;i<=n;i++)a[i]=read();
    T.build(,,n);
    m=read();
    while(m--){
        ll opt=read();
        if(opt==){int l=read(),r=read(),x=read();T.mul(,,n,l,r,x);}
        if(opt==){int l=read(),r=read(),x=read();T.add(,,n,l,r,x);}
        if(opt==){int l=read(),r=read();printf("%lld\n",T.querysum(,,n,l,r));}
    }
}