【例题记录】树链剖分·线段树区间修改查询

习题：【模板】轻重链剖分/树链剖分 - 洛谷

记得初始操作，dep，dfs1，dfs2，build

子树dfn连续，但原结点编号不连续

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 5;
int top[N], fa[N], siz[N], son[N], dfn[N], rnk[N], dep[N], dfncnt;
int head[N], cnt, w[N];
int n, m, r, p;
struct node {
	int v, ne;
}e[N<<1];
void add(int u, int v) {
	e[++cnt].v = v, e[cnt].ne = head[u], head[u] = cnt;
}
struct segtree {
	int sum[N << 2], add[N << 2];
	void build(int root, int left, int right) {
		if (left == right) {
			sum[root] = w[rnk[left]]; return;
		}
		int mid = left + right >> 1;
		build(root << 1, left, mid);
		build(root << 1 | 1, mid + 1, right);
		sum[root] = sum[root << 1] + sum[root << 1 | 1];
	}
	void pushdown(int root,int left,int right) {
		if (!add[root]) return;
		int mid = left + right >> 1;
		sum[root << 1] += (mid - left + 1) * add[root];
		add[root << 1] += add[root];
		sum[root << 1 | 1] += (right - mid) * add[root];
		add[root << 1 | 1] += add[root];
		add[root] = 0;
	}
	void update(int root, int left, int right, int l, int r, int val) {
		if (l <= left && right <= r) {
			sum[root] += (right - left + 1) * val;
			add[root] += val; return;
		}
		pushdown(root, left, right);
		int mid = left + right >> 1;
		if (l <= mid) update(root << 1, left, mid, l, r, val);
		if (r > mid) update(root << 1 | 1, mid + 1, right, l, r, val);
		sum[root] = sum[root << 1] + sum[root << 1 | 1];
	}
	int query(int root, int left, int right, int l, int r) {
		if (l <= left && right <= r) return sum[root];
		pushdown(root, left, right);
		int mid = left + right >> 1;
		if (r <= mid) return query(root << 1, left, mid, l, r);
		else if (l > mid) return query(root << 1 | 1, mid + 1, right, l, r);
		else return query(root << 1, left, mid, l, r) + query(root << 1 | 1, mid + 1, right, l, r);
	}
}tr;
void dfs1(int now) {
	siz[now] = 1;
	for (int i = head[now]; i; i = e[i].ne) {
		if (dep[e[i].v]) continue;
		dep[e[i].v] = dep[now] + 1;
		fa[e[i].v] = now;
		dfs1(e[i].v);
		siz[now] += siz[e[i].v];
		if (!son[now] || siz[son[now]] < siz[e[i].v]) son[now] = e[i].v;
	}
}
void dfs2(int now, int tp) {
	top[now] = tp;
	dfn[now] = ++dfncnt;
	rnk[dfncnt] = now;
	if (son[now]) dfs2(son[now], tp);
	for (int i = head[now]; i; i = e[i].ne) {
		if (e[i].v == son[now] || e[i].v == fa[now]) continue;
		dfs2(e[i].v, e[i].v);
	}
}
void update(int x, int y, int z) {
	int fx = top[x], fy = top[y];
	while (fx != fy) {
		if (dep[fx] >= dep[fy]) {
			tr.update(1, 1, n, dfn[fx], dfn[x], z), x = fa[fx];
		}
		else {
			tr.update(1, 1, n, dfn[fy], dfn[y], z), y = fa[fy];
		}
		fx = top[x], fy = top[y];
	}
	if (dfn[x] < dfn[y]) tr.update(1, 1, n, dfn[x], dfn[y], z);
	else tr.update(1, 1, n, dfn[y], dfn[x], z);
}
int query(int x, int y) {
	int ret = 0, fx = top[x], fy = top[y];
	while (fx != fy) {
		if (dep[fx] >= dep[fy]) {
			ret = (ret + tr.query(1, 1, n, dfn[fx], dfn[x])) % p, x = fa[fx];
		}
		else ret = (ret + tr.query(1, 1, n, dfn[fy], dfn[y])) % p, y = fa[fy];
		fx = top[x], fy = top[y];
	}
	if (dfn[x] < dfn[y]) ret = (ret + tr.query(1, 1, n, dfn[x], dfn[y])) % p;
	else ret = (ret + tr.query(1, 1, n, dfn[y], dfn[x])) % p;
	return ret;
}
signed main() {
	cin >> n >> m >> r >> p;
	for (int i = 1; i <= n; i++) cin >> w[i];
	for (int i = 1; i <= n - 1; i++) {
		int u, v; cin >> u >> v;
		add(u, v), add(v, u);
	}
	dep[r] = 1; dfs1(r); dfs2(r, r);
	tr.build(1, 1, n);
	while (m--) {
		int op; cin >> op;
		if (op == 1) {
			int x, y, z; cin >> x >> y >> z;
			update(x, y, z);
		}
		else if (op == 2) {
			int x, y; cin >> x >> y;
			cout << query(x, y) << endl;
		}
		else if (op == 3) {
			int x, z; cin >> x >> z;
			tr.update(1, 1, n, dfn[x], dfn[x] + siz[x] - 1, z);
		}
		else {
			int x; cin >> x;
			cout << tr.query(1, 1, n, dfn[x], dfn[x] + siz[x] - 1) % p << endl;
		}
	}
	return 0;
}