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

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <math.h>
#include <queue>
#include <stack>
#include <string.h>
using namespace std;
#define LL long long
const int N = 2e5 + 10;
LL read()//快读 
{
	char ch;
	ch = getchar();
	LL ss = 0;
	while(ch < '0' || ch > '9')
		ch = getchar();
	while(ch >='0' && ch <= '9') 
	{
		ss = ss*10 + ch - '0';
		ch = getchar();
	}
	return ss;
}
//===========================================链式前向星 
LL n , m , r , mod;
LL num[N];
LL head[N] , to[N] , ne[N] , ids;
LL fa[N] , size[N] , son[N] , dep[N] ;
LL top[N] , a[N] , idx[N] ,cnt;
void add(LL x , LL y) {
	to[++ids] = y , ne[ids] = head[x] , head[x] = ids;
}
void dfs1(int u , int f)//确认重儿子 
{
	fa[u] = f , dep[u] = dep[f] + 1 , size[u] = 1;
	for(int i = head[u] ; i ; i = ne[i]) 
	{
		int v = to[i];
		if( v != f ) 
		{
			dfs1(v , u);
			size[u] += size[v];
			if( size[ son[u] ] < size[v])
				son[u] = v;
		}
	}
}
void dfs2(int u , int f)//确认轻儿子
{
	top[u] = f , idx[u] = ++cnt , a[cnt] = num[u];
	if(son[u])
		dfs2(son[u] , f);
	for(int i = head[u] ; i ; i = ne[i])
		if(to[i] != fa[u] && to[i] != son[u])
			dfs2(to[i] , to[i]);
}
//dfs1 dfs2都是用于判断
/****dfs1用处：
标记每个点的深度dep[]
标记每个点的父亲fa[]
标记每个非叶子节点的子树大小(含它自己)
标记每个非叶子节点的重儿子编号son[] 
dfs2用处：
标记每个点的新编号
赋值每个点的初始值到新编号上
处理每个点所在链的顶端
处理每条链 
*****/ 
//================================================树的部分 
struct node {//建立node函数用于调用便于计算 
	LL l , r , lazy , sum;
} tree[N<<2];
void push_up(int id)//增加 
{
	tree[id].sum = tree[id<<1].sum + tree[id<<1|1].sum;
}
void push_down(int id)//减少 
{
	tree[id<<1].sum = (tree[id<<1].sum +  (tree[id<<1].r - tree[id<<1].l + 1) * tree[id].lazy )%mod;
	tree[id<<1|1].sum = (tree[id<<1|1].sum +  (tree[id<<1|1].r - tree[id<<1|1].l + 1) * tree[id].lazy )%mod;
 
	tree[id<<1].lazy = (tree[id<<1].lazy + tree[id].lazy) % mod;
	tree[id<<1|1].lazy = (tree[id<<1|1].lazy + tree[id].lazy) % mod;
 
	tree[id].lazy = 0;
}
void build(int id , int l , int r )//建立一棵数 
{
	if(l > r)   return;
	tree[id].l = l , tree[id].r = r , tree[id].lazy = 0;
	if(l == r) 
	{
		tree[id].sum = a[l];
		return ;
	}
	int mid = l + r >> 1;
	build(id<<1 , l , mid);// 建立一棵树 
	build(id<<1|1 , mid + 1, r);//建立另外一棵树 
	push_up(id);//减去 
}
void tree_add(int id , int l , int r , LL k)// 
{
	if(l > tree[id].r || r < tree[id].l) 
		return ;
	if(l <= tree[id].l && tree[id].r <= r) 
	{
		tree[id].sum = (tree[id].sum + (tree[id].r - tree[id].l + 1) * k )%mod;
		tree[id].lazy = (tree[id].lazy + k) % mod;
		return ;
	}
	push_down(id);
	tree_add(id << 1 , l , r , k);
	tree_add(id<<1|1 , l , r , k);
	push_up(id);
}
LL tree_sum(int id , int l , int r) 
{
	if(l > tree[id].r || r < tree[id].l)
		return 0;
	if(l <= tree[id].l && tree[id].r <= r)
		return tree[id].sum % mod;
	push_down(id);
	return  ( tree_sum(id << 1 , l , r) + tree_sum(id<<1|1 , l , r) ) %mod;
}
void lca_add(int x ,int y , LL z)//同于判断最近公共祖先 
{
	while(top[x] != top[y]) 
	{
		if(dep[ top[x] ] < dep[ top[y] ])
			swap(x,y);
		tree_add(1,idx[ top[x] ] , idx[x]  , z);
		x = fa[top[x]];
	}
	if(dep[x] < dep[y])
		swap(x,y);
	tree_add(1 , idx[y] , idx[x] , z);
}
LL lca_sum(int x , int y)//同于判断最近公共祖先 
{
	LL ans = 0;
	while(top[x] != top[y]) 
	{
		if(dep[top[x] ] < dep[top[y]] )
			swap(x,y);
		ans = (ans + tree_sum (1 , idx[top[x]] , idx[x] ))%mod;
		x = fa[ top[x] ];
	}
	if(dep[x] < dep[y])
		swap(x,y);
	ans = (ans + tree_sum(1, idx[y] , idx[x]) )%mod;
	return ans;
}
int main() 
{
	n =read() , m = read() , r = read() , mod = read();
	for(int i = 1 ; i <= n ; i++)
		num[i] = read();
	for(int i = 1,x,y ; i < n ; i++) 
	{
		x = read() , y = read();
		add(x,y) , add(y,x);
	}
	dfs1(r,-1);
	dfs2(r,r);
	build(1 , 1 , cnt);
	LL opt , x ,y , z;
	while(m--) 
	{
		opt = read() , x = read();
		if(opt == 1)//表示将树从 x 到 y 结点最短路径上所有节点的值都加上 z
		{
			y = read() , z = read();
			lca_add( x,y,z  );
		} 
		else if(opt == 2) 
		{
			y = read();//表示求树从 x 到 y 结点最短路径上所有节点的值之和
			printf("%lld\n",lca_sum(x,y));
		} 
		else if(opt == 3) 
		{
			z = read();//表示将以 x 为根节点的子树内所有节点值都加上 z
			tree_add( 1  , idx[x] , idx[x] + size[x] - 1 , z  );
		} 
		else//表示求以 x 为根节点的子树内所有节点值之和
			printf("%lld\n",tree_sum( 1  , idx[x] , idx[x] + size[x] - 1));
	}
}