解:维护add、mul两个懒标记表示该区间要加的数和要乘的数,为了保证数据的正确,在下传标记时我们要优先更新mul再更新add。
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i = a;i<n;i++)
#define per(i,a,n) for(int i = n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define yes cout<<"YES"<<'\n';
#define no cout<<"NO"<<'\n';
#define endl '\n';
#define R register
typedef vector<int> VI;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll MOD=1000000007;
int rnd(int x) {return mrand() % x;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;};
ll lcm(int a,int b){return a*b/gcd(a,b);};
const int N=100010;
int n,m,p;
int a[N];
struct node{
int l,r;
ll sum,add,mul;
}tr[N*4];
void pushup(int u){
tr[u].sum=(tr[u<<1].sum+tr[u<<1|1].sum)%p;
}
void calc(node &t,ll add,ll mul){
t.sum=(t.sum*mul+1LL*add*(t.r-t.l+1))%p;
t.mul=t.mul*mul%p;
t.add=(t.add*mul+add)%p;
}
void pushdown(int u){
calc(tr[u<<1],tr[u].add,tr[u].mul);
calc(tr[u<<1|1],tr[u].add,tr[u].mul);
tr[u].add=0;
tr[u].mul=1;
}
void build(int u,int l,int r){
tr[u]={l,r,0,0,1};
if(l==r){
tr[u].sum=a[l];
return;
}
int m=(l+r)>>1;
build(u<<1,l,m);
build(u<<1|1,m+1,r);
pushup(u);
}
void modify(int u,int l,int r,ll add,ll mul){
if(tr[u].l>=l&&tr[u].r<=r){
calc(tr[u],add,mul);
return;
}
pushdown(u);
int m=(tr[u].l+tr[u].r)>>1;
if(l<=m) modify(u<<1,l,r,add,mul);
if(r>m) modify(u<<1|1,l,r,add,mul);
pushup(u);
}
ll query(int u,int l,int r){
if(tr[u].l>=l&&tr[u].r<=r){
return tr[u].sum;
}
pushdown(u);
int m=(tr[u].l+tr[u].r)>>1;
ll res=0;
if(l<=m) res+=query(u<<1,l,r)%p;
if(r>m) res=(res+query(u<<1|1,l,r))%p;
return res;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>p;
rep(i,1,n+1) cin>>a[i];
cin>>m;
build(1,1,n);
while(m--){
int op,l,r;
ll k;
cin>>op>>l>>r;
if(op==1){
cin>>k;
modify(1,l,r,0,k);
}else if(op==2){
cin>>k;
modify(1,l,r,k,1);
}else cout<<query(1,l,r)<<endl;
}
return 0;
}
时间复杂度:O((m+n)logn)。
空间复杂度:O(n)。