链接:lg3384[树剖模板]
题解
- 模板没什么说的…
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
using namespace std;
const int N=1e6+7;
ll rt[N<<2],id[N],hson[N],top[N],size[N],deep[N],f[N],lz[N<<2];
ll nxt[N],to[N],head[N],w[N],wt[N];
int n,m,q,p,cnt;
inline void adde(int x,int y){
nxt[++cnt]=head[x];
to[cnt]=y;
head[x]=cnt;
}
inline void pushup(int o){rt[o]=(rt[o<<1]+rt[o<<1|1])%p;}
inline void pushdown(int o,int len){
if(!lz[o])return ;
lz[o<<1]+=lz[o];
lz[o<<1|1]+=lz[o];
rt[o<<1]=(rt[o<<1]+(len-(len>>1))*lz[o])%p;
rt[o<<1|1]=(rt[o<<1|1]+(len>>1)*lz[o])%p;
lz[o]=0;
}
inline void build(int o,int l,int r){
lz[o]=0;
if(l==r){rt[o]=wt[l]%p;return ;}
int mid=l+r>>1;
build(lson);
build(rson);
pushup(o);
}
inline void update(int o,int l,int r,int L,int R,ll x){
if(L<=l&&R>=r){
lz[o]+=x;
rt[o]=(rt[o]+(r-l+1)*x)%p;
return ;
}
pushdown(o,r-l+1);
int mid=l+r>>1;
if(L<=mid)update(lson,L,R,x);
if(R>mid)update(rson,L,R,x);
pushup(o);
}
inline ll query(int o,int l,int r,int L,int R){
if(L<=l&&R>=r)return rt[o];
pushdown(o,r-l+1);
int mid=l+r>>1;
ll ans=0;
if(L<=mid)ans+=query(lson,L,R);
if(R>mid)ans+=query(rson,L,R);
return ans%p;
}
inline void dfs1(int x){
size[x]=1;
for(int i=head[x];i;i=nxt[i])if(to[i]!=f[x]){
f[to[i]]=x;
deep[to[i]]=deep[x]+1;
dfs1(to[i]);
size[x]+=size[to[i]];
if(size[hson[x]]<size[to[i]])hson[x]=to[i];
}
}
inline void dfs2(int x,int t){
top[x]=t;id[x]=++cnt;wt[cnt]=w[x];
if(!hson[x])return ;
dfs2(hson[x],t);
for(int i=head[x];i;i=nxt[i])if(hson[x]!=to[i]&&to[i]!=f[x])dfs2(to[i],to[i]);
}
inline ll queryrange(int x,int y){
ll ans=0;
while(top[x]!=top[y]){
if(deep[top[x]]<deep[top[y]])swap(x,y);
ans=(ans+query(1,1,n,id[top[x]],id[x]))%p;
x=f[top[x]];
}
if(deep[x]>deep[y])swap(x,y);
return (ans+query(1,1,n,id[x],id[y]))%p;
}
inline void uprange(int x,int y,ll k){
while(top[x]!=top[y]){
if(deep[top[x]]<deep[top[y]])swap(x,y);
update(1,1,n,id[top[x]],id[x],k);
x=f[top[x]];
}
if(deep[x]>deep[y])swap(x,y);
update(1,1,n,id[x],id[y],k);
}
int main(){
scanf("%d%d%d%d",&n,&m,&q,&p);
rep(i,1,n)scanf("%d",&w[i]);
rep(i,2,n){int a,b;scanf("%d%d",&a,&b);adde(a,b);adde(b,a);}
cnt=0;
dfs1(q);
dfs2(q,q);
build(1,1,n);
while(m--){
int op,x,y,z;
scanf("%d",&op);
if(op==1){
scanf("%d%d%d",&x,&y,&z);
uprange(x,y,z%p);
}
else if(op==2){
scanf("%d%d",&x,&y);
printf("%lld\n",queryrange(x,y));
}
else if(op==3){
scanf("%d%d",&x,&y);
update(1,1,n,id[x],id[x]+size[x]-1,y%p);
}
else {
scanf("%d",&x);
printf("%lld\n",query(1,1,n,id[x],id[x]+size[x]-1));
}
}
return 0;
}