注意点:
- 根节点的深度需要提前设置,否则会死循环.
#include<cstdio>
#include<iostream>
using namespace std;
const int MAXN=1000010,MAXM=1000010;
struct Node{
int ls,rs,lazy;
long long sum;
}tr[MAXN];
int nodeCnt=0;
void insert(int &now,int l,int r,int ll,int rr,int x){
if(!now)now=++nodeCnt;
int b=min(r,rr)-max(l,ll)+1;
tr[now].sum+=b*x;
if(ll<=l&&rr>=r){
tr[now].lazy+=x;
return;
}
int mid=(l+r)>>1;
if(ll<=mid)insert(tr[now].ls,l,mid,ll,rr,x);
if(rr>mid)insert(tr[now].rs,mid+1,r,ll,rr,x);
}
long long query(int now,int l,int r,int ll,int rr){
if(ll<=l&&rr>=r)return tr[now].sum;
int mid=(l+r)>>1;
if(tr[now].lazy){
if(!tr[now].ls)tr[now].ls=++nodeCnt;
tr[tr[now].ls].lazy+=tr[now].lazy;
tr[tr[now].ls].sum+=tr[now].lazy*(mid-l+1);
if(!tr[now].rs)tr[now].rs=++nodeCnt;
tr[tr[now].rs].lazy+=tr[now].lazy;
tr[tr[now].rs].sum+=tr[now].lazy*(r-mid);
tr[now].lazy=0;
}
long long ans=0;
if(ll<=mid)ans+=query(tr[now].ls,l,mid,ll,rr);
if(rr>mid)ans+=query(tr[now].rs,mid+1,r,ll,rr);
return ans;
}
struct Edge{
int from,to,nxt;
}e[MAXM];
int head[MAXN],edgeCnt=1;
void addEdge(int u,int v){
e[++edgeCnt].from=u;
e[edgeCnt].to=v;
e[edgeCnt].nxt=head[u];
head[u]=edgeCnt;
}
int dep[MAXN],siz[MAXN],son[MAXN],fa[MAXN];
void dfs1(int x){
dep[x]=dep[fa[x]]+1;
siz[x]=1;
for(int i=head[x];i;i=e[i].nxt){
int nowV=e[i].to;
if(!dep[nowV]){
//dep[nowV]=dep[x]+1;
fa[nowV]=x;
dfs1(nowV);
siz[x]+=siz[nowV];
if(siz[nowV]>siz[son[x]])son[x]=nowV;
}
}
}
int initValue[MAXN],top[MAXN],id[MAXN];
int root=0,idCnt=0;
void dfs2(int x){
id[x]=++idCnt;
insert(root,1,MAXN,id[x],id[x],initValue[x]);
if(x==son[fa[x]])top[x]=top[fa[x]];
else top[x]=x;
if(son[x])dfs2(son[x]);
for(int i=head[x];i;i=e[i].nxt){
int nowV=e[i].to;
if(nowV!=son[x]&&nowV!=fa[x]){
dfs2(nowV);
}
}
}
void add(int u,int v,int x){
while(top[u]!=top[v]){
if(dep[top[u]]>dep[top[v]])swap(u,v);
insert(root,1,MAXN,id[top[v]],id[v],x);
v=fa[top[v]];
}
insert(root,1,MAXN,min(id[u],id[v]),max(id[u],id[v]),x);
}
long long sum(int u,int v){
long long ans=0;
while(top[u]!=top[v]){
if(dep[top[u]]>dep[top[v]])swap(u,v);
ans+=query(root,1,MAXN,id[top[v]],id[v]);
v=fa[top[v]];
}
ans+=query(root,1,MAXN,min(id[u],id[v]),max(id[u],id[v]));
return ans;
}
int main(){
int n,m,r,p;
scanf("%d%d%d%d",&n,&m,&r,&p);
for(int i=1;i<=n;i++){
scanf("%d",&initValue[i]);
}
for(int i=1;i<=n-1;i++){
int x,y;
scanf("%d%d",&x,&y);
addEdge(x,y);
addEdge(y,x);
}
dfs1(r);
dfs2(r);
for(int i=1;i<=m;i++){
int opt,x,y,z;
scanf("%d%d",&opt,&x);
switch(opt){
case 1:
scanf("%d%d",&y,&z);
add(x,y,z);
break;
case 2:
scanf("%d",&y);
cout<<sum(x,y)%p<<endl;
break;
case 3:
scanf("%d",&z);
insert(root,1,MAXN,id[x],id[x]+siz[x]-1,z);
break;
case 4:
cout<<query(root,1,MAXN,id[x],id[x]+siz[x]-1)%p<<endl;
break;
}
}
return 0;
}