【BZOJ1798】[Ahoi2009]Seq 维护序列seq 【线段树】

【题目链接】

线段树各种标记一直没写过。

注意乘法的时候也要更新加法标记。

/* Footprints In The Blood Soaked Snow */
#include <cstdio>
#include <algorithm>

using namespace std;

typedef unsigned long long ULL;

const int maxn = 100005;

int n;
ULL mod, sum[maxn << 2], mulv[maxn << 2], addv[maxn << 2];

inline int iread() {
	int f = 1, x = 0; char ch = getchar();
	for(; ch < '0' || ch > '9'; ch = getchar()) f = ch == '-' ? -1 : 1;
	for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
	return f * x;
}

inline void pushup(int p) {
	sum[p] = sum[p << 1] + sum[p << 1 | 1] % mod;
}

inline void pushdown(int p, int l, int mid, int r) {
	int ls = p << 1, rs = p << 1 | 1;
	sum[ls] = (sum[ls] * mulv[p] + (mid - l + 1) * addv[p]) % mod;
	mulv[ls] = mulv[ls] * mulv[p] % mod;
	addv[ls] = (addv[ls] * mulv[p] + addv[p]) % mod;
	sum[rs] = (sum[rs] * mulv[p] + (r - mid) * addv[p]) % mod;
	mulv[rs] = mulv[rs] * mulv[p] % mod;
	addv[rs] = (addv[rs] * mulv[p] + addv[p]) % mod;
	mulv[p] = 1; addv[p] = 0;
}

inline void build(int p, int l, int r) {
	sum[p] = addv[p] = 0; mulv[p] = 1;
	if(l == r) {
		sum[p] = iread();
		return;
	}
	int mid = l + r >> 1;
	build(p << 1, l, mid); build(p << 1 | 1, mid + 1, r);
	pushup(p);
}

inline void mulchange(int p, int l, int r, int x, int y, ULL c) {
	if(x <= l && r <= y) {
		sum[p] = sum[p] * c % mod;
		mulv[p] = mulv[p] * c % mod;
		addv[p] = addv[p] * c % mod;
		return;
	}
	int mid = l + r >> 1;
	pushdown(p, l, mid, r);
	if(x <= mid) mulchange(p << 1, l, mid, x, y, c);
	if(y > mid) mulchange(p << 1 | 1, mid + 1, r, x, y, c);
	pushup(p);
}

inline void addchange(int p, int l, int r, int x, int y, ULL c) {
	if(x <= l && r <= y) {
		sum[p] = (sum[p] + (r - l + 1) * c) % mod;
		addv[p] = (addv[p] + c) % mod;
		return;
	}
	int mid = l + r >> 1;
	pushdown(p, l, mid, r);
	if(x <= mid) addchange(p << 1, l, mid, x, y, c);
	if(y > mid) addchange(p << 1 | 1, mid + 1, r, x, y, c);
	pushup(p);
}

inline ULL query(int p, int l, int r, int x, int y) {
	if(x <= l && r <= y) return sum[p];
	int mid = l + r >> 1;
	pushdown(p, l, mid, r);
	ULL ans = 0;
	if(x <= mid) ans = (ans + query(p << 1, l, mid, x, y)) % mod;
	if(y > mid) ans = (ans + query(p << 1 | 1, mid + 1, r, x, y)) % mod;
	return ans;
}

int main() {
	n = iread(); mod = iread();
	build(1, 1, n);
	for(int m = iread(); m; m--) {
		int opt = iread(), x = iread(), y = iread();
		if(opt == 1) mulchange(1, 1, n, x, y, iread() % mod);
		else if(opt == 2) addchange(1, 1, n, x, y, iread() % mod);
		else if(opt == 3) printf("%llu\n", query(1, 1, n, x, y));
	}
	return 0;
}