30PTS求条

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e5+5;
int mod;
struct node
{
	int l;
	int r;
	long long sum;
	long long lzy;
	long long mul;
};
node tr[N*4];
int a[N];
void pushup(int u)
{
	tr[u].sum=(tr[u*2].sum+tr[u*2+1].sum)%mod;
}
void pushdown(int u)
{
	tr[u*2].lzy*=tr[u].mul%mod;
	tr[u*2].lzy+=tr[u].lzy%mod;
	tr[u*2].mul*=tr[u].mul%mod;
	tr[u*2].sum*=tr[u].mul%mod;
	tr[u*2].sum+=(long long)(tr[u*2].r-tr[u*2].l+1)*tr[u].lzy%mod;
	tr[u*2+1].lzy*=tr[u].mul%mod;
	tr[u*2+1].lzy+=tr[u].lzy%mod;
	tr[u*2+1].mul*=tr[u].mul%mod;
	tr[u*2+1].sum*=tr[u].mul%mod;
	tr[u*2+1].sum+=(long long)(tr[u*2+1].r-tr[u*2+1].l+1)*tr[u].lzy%mod;
	tr[u].lzy=0;
	tr[u].mul=1;
}
void bui(int u,int l,int r)
{
	tr[u].l=l;tr[u].r=r;tr[u].lzy=0;tr[u].mul=1;
	if(l==r)
	{
		tr[u].sum=a[l];
		return ;		
	}
	int mid=(l+r)/2;
	bui(u*2,l,mid);
	bui(u*2+1,mid+1,r);
	pushup(u);
}
long long query(int u,int l,int r)
{
	if(tr[u].l>=l&&tr[u].r<=r)
		return tr[u].sum;
	pushdown(u);
	int mid=(tr[u].l+tr[u].r)/2;
	long long sum=0;
	if(l<=mid)
		sum+=query(u*2,l,r);
	if(r>mid)
		sum+=query(u*2+1,l,r);
	return sum;
}
void modify(int u,int l,int r,int v)
{
	if(tr[u].l>=l&&tr[u].r<=r)
	{
		tr[u].lzy+=v%mod;
		tr[u].sum+=(long long)(tr[u].r-tr[u].l+1)*v%mod;
	}
	else
	{
		pushdown(u);
		int mid=(tr[u].l+tr[u].r)/2;
		if(l<=mid)
			modify(u*2,l,r,v);
		if(r>mid)
			modify(u*2+1,l,r,v);
		pushup(u);
	}
}
void modul(int u,int l,int r,int mul)
{
	if(tr[u].l>=l&&tr[u].r<=r)
	{
		tr[u].lzy*=mul%mod;
		tr[u].mul*=mul%mod;
		tr[u].sum*=mul%mod;
	}
	else
	{
		pushdown(u);
		int mid=(tr[u].l+tr[u].r)/2;
		if(l<=mid)
			modul(u*2,l,r,mul);
		if(r>mid)
			modul(u*2+1,l,r,mul);
		pushup(u);
	}
}
signed main()
{
	int n,m;
	cin>>n>>m>>mod;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
	bui(1,1,n);
	while(m--)
	{
		int op;
		cin>>op;
		if(op==1)
		{
			int ll,rr,kk;
			cin>>ll>>rr>>kk;
			modul(1,ll,rr,kk);
		}
		if(op==2)
		{
			int ll,rr,kk;
			cin>>ll>>rr>>kk;
			modify(1,ll,rr,kk);
		}
		if(op==3)
		{
			int ll,rr;
			cin>>ll>>rr;
			cout<<query(1,ll,rr)%mod<<endl;
		}
	}
	return 0;
}