1798: [Ahoi2009]Seq 维护序列seq

来源：互联网发布：淘宝内部小二编辑：程序博客网时间：2024/06/03 09:31

题目链接

题目大意：给出数列，有三种操作：(1)区间乘(2)区间加(3)区间求和

题解：打打标记就好了，要先下放乘法标记

我的收获：多标记线段树get

#include <cstdio>#include <iostream>using namespace std;#define M 100005#define ls x<<1#define rs x<<1|1#define lson l,m,x<<1#define rson m+1,r,x<<1|1#define root 1,n,1typedef long long ll;int n,m,P,opt,x,y,z,a[M];ll sum[M<<2],add[M<<2],mul[M<<2]; inline void pushup(int x){sum[x]=(sum[ls]+sum[rs])%P;}void pushdown(int x,long long m){    if(add[x]==0&&mul[x]==1) return ;    mul[ls]=(mul[ls]*mul[x])%P;    mul[rs]=(mul[rs]*mul[x])%P;    add[ls]=(add[ls]*mul[x]%P+add[x])%P;    add[rs]=(add[rs]*mul[x]%P+add[x])%P;    sum[ls]=(sum[ls]*mul[x]%P+add[x]*(m-(m>>1))%P)%P;    sum[rs]=(sum[rs]*mul[x]%P+add[x]*(m>>1)%P)%P;    mul[x]=1,add[x]=0;}void build(int l,int r,int x){    add[x]=0;mul[x]=1;    if(l==r){sum[x]=a[l];return ;}    int m=(l+r)>>1;    build(lson);build(rson);    pushup(x);}void updata_add(int L,int R,int v,int l,int r,int x){    if(L<=l&&r<=R){add[x]=(add[x]+v)%P;sum[x]=(sum[x]+ll(v)*(r-l+1))%P;return ;}    pushdown(x,r-l+1);    int m=(l+r)>>1;    if(L<=m) updata_add(L,R,v,lson);    if(R>m) updata_add(L,R,v,rson);    pushup(x);}void updata_mul(int L,int R,int v,int l,int r,int x){    if(L<=l&&r<=R){mul[x]=(mul[x]*v)%P;add[x]=(add[x]*v)%P;sum[x]=(sum[x]*v)%P;return ;}    pushdown(x,r-l+1);    int m=(l+r)>>1;    if(L<=m) updata_mul(L,R,v,lson);    if(R>m) updata_mul(L,R,v,rson);    pushup(x);}long long query(int L,int R,int l,int r,int x) {    if(L<=l&&r<=R) return sum[x];    pushdown(x,r-l+1);    int m=(l+r)>>1;    ll ans=0;    if(L<=m) ans=(ans+query(L,R,lson))%P;    if(R>m) ans=(ans+query(L,R,rson))%P;    return ans;}void work(){    while(m--)    {        scanf("%d%d%d",&opt,&x,&y);        if(opt==1) scanf("%d",&z),updata_mul(x,y,z,root);        if(opt==2) scanf("%d",&z),updata_add(x,y,z,root);        if(opt==3) printf("%lld\n",query(x,y,root));    }}void init(){    cin>>n>>P;    for(int i=1;i<=n;i++)        scanf("%d",&a[i]);    cin>>m;    build(root);}int main(){    init();    work();    return 0;}

0 0