树链剖分模板

#include <cstdio>
#include <iostream>
#include <cstring>
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define ll long long
using namespace std;
struct node{
	int a, b, c, n;
}d[200001];
int dep[100001], h[100001], son[100001], size[100001], fa[100001];
int re[100001], num[100001], w[100001], top[100001];
int n, m, s, cnt;
ll p, sum[400005], tag[400005];
void cr(int i, int a, int b){
	d[i].a = a; d[i].b = b; d[i].n = h[a]; h[a] = i;
}
void pushdown(int rt, int x){
	if(tag[rt]){
		sum[rt<<1] = (sum[rt<<1]+tag[rt]*(x-x/2))%p;
		sum[rt<<1|1] = (sum[rt<<1|1] + tag[rt]*(x/2))%p;
		tag[rt<<1] = (tag[rt<<1] + tag[rt])%p;
		tag[rt<<1|1] = (tag[rt<<1|1] + tag[rt])%p;
		tag[rt] = 0; 
	}
}
void dfs1(int a){
	int i, b;
	size[a] = 1; son[a] = 0;
	for(i = h[a]; i; i = d[i].n){
		b = d[i].b;
		if(b == fa[a]) continue;
		fa[b] = a;
		dep[b] = dep[a] + 1;
		dfs1(b);
		
		if(size[b] > size[son[a]]) son[a] = b;
		size[a] += size[b];
	}
}
void dfs2(int a, int tp){
	int i, b;
	num[a] = ++cnt; top[a] = tp;
	re[cnt] = a;
	if(son[a]) dfs2(son[a], tp);
	for(i = h[a]; i; i = d[i].n){
		b = d[i].b;
		if(b != fa[a] && b != son[a]) dfs2(b, b);
	}
}
void build(int l, int r, int rt){
	if(l == r){
		sum[rt] = w[re[l]];
		return;
	}
	int m = l+r>>1;
	build(lson);
	build(rson);
	sum[rt] = sum[rt<<1] + sum[rt<<1|1];
}
void update(int l, int r, int rt, int a, int b, ll c){
	if(l >= a && r <= b){
		sum[rt] = (sum[rt] + (r-l+1)*c)%p;
		tag[rt] = (tag[rt] + c)%p;
		return;
	}
	int m = l+r>>1;
	pushdown(rt,r-l+1);
	if(a <= m) update(lson,a,b,c);
	if(b > m) update(rson,a,b,c);
	sum[rt] = (sum[rt<<1] + sum[rt<<1|1])%p;
}
ll query(int l, int r, int rt, int a, int b){
	if(l >= a && r <= b) return sum[rt]%p;
	int m = l+r>>1;
	pushdown(rt,r-l+1);
	ll ans = 0;
	if(a <= m) ans = (ans + query(lson,a,b))%p;
	if(b > m) ans = (ans + query(rson,a,b))%p;
	return ans%p;
}
void add1(int a, int b, ll c){
	int f1 = top[a], f2 = top[b];
	while(f1 != f2){
		if(dep[f1] < dep[f2]){
			swap(f1,f2);
			swap(a,b);
		}
		update(1,n,1,num[f1],num[a],c);
		a = fa[f1]; f1 = top[a];
	}
	if(dep[a] > dep[b]) swap(a,b);
	update(1,n,1,num[a],num[b],c);
}
void add2(int a, ll c){
	update(1,n,1,num[a],num[a]+size[a]-1, c);
}
ll getsum(int p){
	int a = num[p], b = a+size[p]-1;
	return query(1,n,1,a,b);
}
ll find(int a, int b){
	int f1 = top[a], f2 = top[b];
	ll ans = 0;
	while(f1 != f2){
		if(dep[f1] < dep[f2]){
			swap(f1,f2);
			swap(a,b);
		}
		ans = (ans+ query(1,n,1,num[f1],num[a]))%p;
		a = fa[f1]; f1 = top[a];
	}
	if(dep[a] > dep[b]) swap(a,b);
	ans = (ans + query(1,n,1,num[a],num[b]))%p;
	return ans;
}
int main(){
	int i, j, a, b, o;
	ll c;
	scanf("%d%d%d%lld", &n, &m, &s, &p);
	for(i = 1; i <= n; i++) scanf("%d", &w[i]);
	for(i = 1; i < n; i++){
		scanf("%d%d", &a, &b);
		cr(i,a,b);
		cr(i+n,b,a);
	}
	dfs1(s);
	dfs2(s, s);
	build(1,n,1);
	while(m--){
		scanf("%d", &o);
		if(o == 1){
			scanf("%d%d%lld", &a, &b, &c);
			add1(a,b,c);
		}
		if(o == 2){
			scanf("%d%d", &a, &b);
			printf("%lld\n", find(a,b));
		}
		if(o == 3){
			scanf("%d%lld", &a, &c);
			add2(a,c);
		}
		if(o == 4){
			scanf("%d", &a);
			printf("%lld\n", getsum(a));
		}
	}
	return 0;
}

150行啊！！支持区间修改，子树修改。