洛谷P3373 【模板】线段树 2

只需要记住,对于乘法和加法操作，优先进行乘法操作,在执行$pushdown$操作的时候,要把$add的tag$直接乘上父亲节点的$mul$的$tag$.这样就能保证加法标记被正确乘上

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6+5;
const int INF = 1e9+7;
typedef long long ll;
typedef pair<int,int> pii;
#define all(a) (a).begin(), (a).end()
#define pb(a) push_back(a)
vector<int> G[maxn];
struct Node{
	ll sum,add,mul;//两个懒标记tag,分别维护add,mul
}tree[maxn*4+5];
int mod;int a[maxn];
#define L (idx<<1)
#define R (idx<<1|1)
#define MID (start+end>>1)
void push_up(int idx){
	tree[idx].sum = (tree[L].sum+tree[R].sum)%mod;
}
void push_down(int idx,int start,int end){
	//乘法标记直接乘sum部分,因为add部分在其他部分乘了
	tree[L].sum = (tree[L].sum*tree[idx].mul%mod + tree[idx].add*(MID-start+1)%mod)%mod;
	tree[R].sum = (tree[R].sum*tree[idx].mul%mod + tree[idx].add*(end-(MID+1)+1)%mod)%mod;
	//先把左右儿子的区间和维护了,再维护两个懒标记
	tree[L].mul = (tree[L].mul*tree[idx].mul)%mod;
	tree[R].mul = (tree[R].mul*tree[idx].mul)%mod;
	//加法特殊一点,先乘法后加法,先把父区间要的乘法tag乘下去,再加上父区间add_tag
	tree[L].add = (tree[L].add*tree[idx].mul%mod + tree[idx].add)%mod;
	tree[R].add = (tree[R].add*tree[idx].mul%mod + tree[idx].add)%mod;
	tree[idx].add = 0;tree[idx].mul = 1;
}
void build(int idx,int start,int end){
	if(start==end){
	    tree[idx].sum = a[start]%mod;tree[idx].add = 0,tree[idx].mul = 1;
	    return ;
	}
	tree[idx].mul = 1;
	build(L,start,MID);build(R,MID+1,end);
	push_up(idx);
}
void update_mul(int idx,int start,int end,int l,int r,int k){
	if(start>r||end<l) return ;
	if(start>=l&&end<=r){
		tree[idx].add = (tree[idx].add*k)%mod;
		tree[idx].mul = (tree[idx].mul*k%mod);
		tree[idx].sum = tree[idx].sum*k%mod;
		return ;
	}
	push_down(idx,start,end);
	update_mul(L,start,MID,l,r,k);
	update_mul(R,MID+1,end,l,r,k);
	push_up(idx);
}
void update_add(int idx,int start,int end,int l,int r,int k){
	if(start>r||end<l) return ;
	if(start>=l&&end<=r){
		tree[idx].add = (tree[idx].add+k)%mod;
		tree[idx].sum = (tree[idx].sum + k*(end-start+1)%mod)%mod;
		return ;
	}
	push_down(idx,start,end);
	update_add(L,start,MID,l,r,k);
	update_add(R,MID+1,end,l,r,k);
	push_up(idx);
}
int query(int idx,int start,int end,int l,int r){
	if(start>r||end<l) return 0;
	if(start>=l&&end<=r) return tree[idx].sum;
	push_down(idx,start,end);
	int ans = 0;
	ans = (ans+query(L,start,MID,l,r))%mod;
	ans = (ans+query(R,MID+1,end,l,r))%mod;
	return ans;
}
int main(){
    ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n,m;cin>>n>>m>>mod;
	for(int i=1;i<=n;i++) cin>>a[i];
	build(1,1,n);
	while(m--){
		int op,x,y;cin>>op>>x>>y;
		if(op==1){
			int k;cin>>k;
			update_mul(1,1,n,x,y,k);
		}
		if(op==2){
			int k;cin>>k;
			update_add(1,1,n,x,y,k);
		}
		if(op==3){
			cout<<query(1,1,n,x,y)%mod<<"\n";
		}
	}
}