线段树--双标签

来源：互联网发布：嵌入式linux项目实战编辑：程序博客网时间：2024/06/05 19:06
#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#define maxn  100010typedef long long LL;using namespace std;LL a[maxn],n,p;struct node{    int l,r;LL sum,alltag,multag;}tr[maxn*4];void build(int id,int l,int r);void change(int id,int ql,int qr,LL a,LL m);LL query(int id,int ql,int qr);void pushdown(int id);int main(){//freopen("in.txt","r",stdin);    int i,m;scanf("%lld %lld",&n,&p);for(i=1;i<=n;i++)scanf("%lld",&a[i]);cin>>m;build(1,1,n);while(m--){LL o,a,b,c;scanf("%lld",&o);if(o==1){scanf("%lld %lld %lld",&a,&b,&c);change(1,a,b,0,c);}if(o==2){scanf("%lld %lld %lld",&a,&b,&c);change(1,a,b,c,1);}if(o==3){scanf("%lld %lld",&a,&b);printf("%lld\n",query(1,a,b));}}}void build(int id,int l,int r){tr[id].l=l; tr[id].r=r;    tr[id].alltag=0;tr[id].multag=1;if(l==r){tr[id].sum=a[l]%p;return;}int mid=(l+r)/2;build(id<<1,l,mid);build(id<<1|1,mid+1,r);tr[id].sum=(tr[id<<1].sum+tr[id<<1|1].sum)%p;}void change(int id,int ql,int qr,LL a,LL m){int l=tr[id].l,r=tr[id].r;if(ql<=l&&qr>=r){tr[id].sum=(tr[id].sum*m%p+a*(r-l+1)%p)%p;tr[id].multag=tr[id].multag*m%p;tr[id].alltag=(tr[id].alltag*m%p+a)%p;return;}pushdown(id);int mid=(l+r)/2;    if(ql<=mid)    change(id<<1,ql,qr,a,m);if(qr>mid)    change(id<<1|1,ql,qr,a,m);tr[id].sum=(tr[id<<1].sum+tr[id<<1|1].sum)%p;}void pushdown(int id){LL m=tr[id].multag,a=tr[id].alltag;int l=tr[id].l,r=tr[id].r;int mid=(l+r)/2;tr[id<<1].sum=(tr[id<<1].sum*m%p+a*(mid-l+1)%p)%p;tr[id<<1|1].sum=(tr[id<<1|1].sum*m%p+a*(r-mid)%p)%p;tr[id<<1].multag=tr[id<<1].multag*m%p;tr[id<<1|1].multag=tr[id<<1|1].multag*m%p;tr[id<<1].alltag=(tr[id<<1].alltag*m%p+a)%p;tr[id<<1|1].alltag=(tr[id<<1|1].alltag*m%p+a)%p;tr[id].multag=1;tr[id].alltag=0;}LL query(int id,int ql,int qr){int l=tr[id].l,r=tr[id].r;if(ql<=l&&qr>=r){return tr[id].sum;}pushdown(id);LL p1=0,p2=0;int mid=(l+r)/2;if(ql<=mid)    p1=query(id<<1,ql,qr);if(qr>mid)    p2=query(id<<1|1,ql,qr);tr[id].sum=(tr[id<<1].sum+tr[id<<1|1].sum)%p;return (p1+p2)%p;}
阅读全文
0 0