P3384 【模板】树链剖分
树链剖分是把一棵树划分成几条链,这几条链又能组成数组,然后把数组建成线段树,继而相当于在树树上操作。
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
using namespace std;
const int maxn=2e5+10;
int a[maxn];
int fa[maxn],dep[maxn],num[maxn],son[maxn];
int top[maxn],p[maxn],fp[maxn];
int cnt,tot;
int n,m,r,mod;
struct node
{
int to,next;
}edge[maxn];
int head[maxn];
void add(int u,int to)
{
edge[tot].to=to;
edge[tot].next=head[u];
head[u]=tot++;
}
struct Node
{
int l,r;
int val,f;
}tree[maxn*20];
void init()
{
cnt=0,tot=0;
memset(head,-1,sizeof(head));
memset(son,-1,sizeof(son));
}
void build(int i,int l,int r)
{
tree[i].l=l;
tree[i].r=r;
tree[i].f=0;
if(l==r)
{
tree[i].val=a[fp[l]]%mod;
return ;
}
int mid=(l+r)/2;
build(i<<1,l,mid);
build(i<<1|1,mid+1,r);
tree[i].val=(tree[i<<1].val+tree[i<<1|1].val)%mod;
}
void pushdown(int i)
{
if(tree[i].f)
{
int k=tree[i].f;
tree[i].f=0;
int l=tree[i<<1].l,r=tree[i<<1].r;
tree[i<<1].f+=k;
tree[i<<1].val+=(r-l+1)*k%mod;
l=tree[i<<1|1].l,r=tree[i<<1|1].r;
tree[i<<1|1].f+=k;
tree[i<<1|1].val+=(r-l+1)*k%mod;
}
}
int query(int i,int ql,int qr)
{
int l=tree[i].l,r=tree[i].r;
int mid=(l+r)/2;
int ans=0;
if(ql<=l&&r<=qr) return tree[i].val;
pushdown(i);
if(ql<=mid) ans+=query(i<<1,ql,qr)%mod;
if(qr>mid) ans+=query(i<<1|1,ql,qr)%mod;
return ans%mod;
}
void update(int i,int ql,int qr,int k)
{
int l=tree[i].l,r=tree[i].r;
int mid=(l+r)/2;
if(ql<=l&&r<=qr)
{
tree[i].f+=k;
tree[i].val+=(r-l+1)*k%mod;
return ;
}
pushdown(i);
if(ql<=mid) update(i<<1,ql,qr,k);
if(qr>mid) update(i<<1|1,ql,qr,k);
tree[i].val=(tree[i<<1].val+tree[i<<1|1].val)%mod;
}
void dfs1(int u,int pre,int d)
{
dep[u]=d;
fa[u]=pre;
num[u]=1;
for(int i=head[u]; i!=-1; i=edge[i].next)
{
int v=edge[i].to;
if(v!=pre)
{
dfs1(v,u,d+1);
num[u]+=num[v];
if(son[u]==-1||num[v]>num[son[u]])
son[u]=v;
}
}
}
void getpos(int u,int sp)
{
top[u]=sp;
p[u]=++cnt;
fp[cnt]=u;
if(son[u]==-1) return ;
getpos(son[u],sp);
for(int i=head[u];~i;i=edge[i].next)
{
int v=edge[i].to;
if(v!=son[u]&&v!=fa[u])
getpos(v,v);
}
}
void solve1(int x,int y,int z)
{
while(top[x]!=top[y])
{
if(dep[top[x]]<dep[top[y]]) swap(x,y);
update(1,p[top[x]],p[x],z);
x=fa[top[x]];
}
if(dep[x]>dep[y]) swap(x,y);
update(1,p[x],p[y],z);
}
int solve2(int x,int y)
{
int ans=0;
while(top[x]!=top[y])
{
if(dep[top[x]]<dep[top[y]]) swap(x,y);
ans+=query(1,p[top[x]],p[x])%mod;
x=fa[top[x]];
}
if(dep[x]>dep[y]) swap(x,y);
ans+=query(1,p[x],p[y])%mod;
return ans%mod;
}
void solve3(int x,int z)
{
update(1,p[x],num[x]+p[x]-1,z);
}
int solve4(int x)
{
return query(1,p[x],num[x]+p[x]-1)%mod;
}
int main()
{
while(~scanf("%d%d%d%d",&n,&m,&r,&mod))
{
init();
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(int i=1;i<n;i++)
{
int u,v;
scanf("%d%d",&u,&v);
add(u,v);
add(v,u);
}
dfs1(r,0,1);
getpos(r,r);
build(1,1,n);
for(int i=0;i<m;i++)
{
int q,x,y,z;
scanf("%d",&q);
if(q==1)
{
scanf("%d%d%d",&x,&y,&z);
solve1(x,y,z);
}
else if(q==2)
{
scanf("%d%d",&x,&y);
printf("%d\n",solve2(x,y));
}
else if(q==3)
{
scanf("%d%d",&x,&z);
solve3(x,z);
}
else
{
scanf("%d",&x);
printf("%d\n",solve4(x));
}
}
}
return 0;
}