P3373(线段树)

最新推荐文章于 2024-02-04 16:59:59 发布

SundayJerry

最新推荐文章于 2024-02-04 16:59:59 发布

阅读量112

点赞数

分类专栏：线段树文章标签： c++

本文链接：https://blog.csdn.net/weixin_45908221/article/details/120520669

版权

线段树专栏收录该内容

5 篇文章 0 订阅

订阅专栏

利用线段树维护区间加和区间乘

#include<bits/stdc++.h>
#define ll long long
#define ls u<<1
#define rs u<<1|1
using namespace std;
ll mod;
int n,m;
const int maxn = 1e5 + 5;
ll a[maxn];
struct Segtree{
	int l,r;
	ll sum;
	ll add,mul;
}tr[maxn << 2];
void pushup(int u){
	tr[u].sum = (tr[ls].sum + tr[rs].sum)%mod;
}
void pushdown(int u){
	tr[ls].sum = (tr[ls].sum*tr[u].mul%mod + tr[u].add*(tr[ls].r - tr[ls].l + 1)%mod)%mod;
	tr[rs].sum = (tr[rs].sum*tr[u].mul%mod + tr[u].add*(tr[rs].r - tr[rs].l + 1)%mod)%mod;
	
	tr[ls].mul = (tr[ls].mul*tr[u].mul)%mod;
	tr[rs].mul = (tr[rs].mul*tr[u].mul)%mod;
	
	tr[ls].add = (tr[ls].add*tr[u].mul + tr[u].add)%mod;
	tr[rs].add = (tr[rs].add*tr[u].mul + tr[u].add)%mod;
	
	tr[u].mul = 1;
	tr[u].add = 0;
}
void build(int u, int l, int r){
	tr[u].l = l,tr[u].r = r;
	tr[u].add = 0,tr[u].mul = 1;
	if(l == r){
		tr[u].sum = a[l]%mod;
		return ;
	}
	int mid = l + r >> 1;
	build(ls, l, mid);
	build(rs, mid+1, r);
	pushup(u);
}
void update_mul(int u, int l, int r, ll d){
	if(tr[u].l >= l && tr[u].r <= r){
		tr[u].add = (tr[u].add * d)%mod;
		tr[u].mul = (tr[u].mul * d)%mod;
		tr[u].sum = (tr[u].sum * d)%mod;
		return ;
	} 
	pushdown(u);
	int mid = tr[u].l + tr[u].r >> 1;
	if(l <= mid)update_mul(ls, l, r, d);
	if(r > mid)update_mul(rs, l, r, d);
	pushup(u);
}
void update_add(int u, int l, int r, ll d){
	if(tr[u].l >= l && tr[u].r <= r){
		tr[u].add = (tr[u].add + d)%mod;
		tr[u].sum = (tr[u].sum + d*(tr[u].r - tr[u].l + 1)%mod)%mod;
		return ;
	}
	pushdown(u);
	int mid = tr[u].l + tr[u].r >> 1;
	if(l <= mid)update_add(ls, l, r, d);
	if(r > mid)update_add(rs, l, r, d);
	pushup(u);
}
ll query(int u, int l, int r){
	if(tr[u].l >= l && tr[u].r <= r)return tr[u].sum %mod;
	pushdown(u);
	int mid = tr[u].l + tr[u].r >> 1;
	ll ans = 0;
	if(l <= mid)ans += query(ls, l, r);
	if(r > mid)ans += query(rs, l, r);
	ans %= mod;
	return ans;
}
int main(){
	cin >> n >> m >> mod;
	for(int i = 1; i <= n; i++)cin >> a[i];
	build(1, 1, n);
	while(m--){
		int op,l,r;
		cin >> op >> l >> r;
		if(op == 1){
			ll k;
			cin >> k;
			update_mul(1, l, r, k);
		}else if(op == 2){
			ll k;
			cin >> k;
			update_add(1, l, r, k);
		} else{
			cout << query(1, l, r) << endl;
		}
	}
}