题意:给一个树和树上点的权值,两个操作,一个是将点的权值修改,一个是询问u到v的点权和
思路:模版题,kuangbin开的这套题为什么这么模版的写的人这么少,可能大神们不屑于写这种题吧(弱哭)
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <vector>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f3fll;
const int maxn=30010;
int fa[maxn],siz[maxn],son[maxn],w[maxn],p[maxn],dep[maxn],fp[maxn],Rank[maxn],A[maxn];
//fa为父节点,siz为子节点中siz最大的,dep为深度,son为重儿子,w表示在线段树中的位置
int num[maxn<<2];
int tree_id,n;
vector<int>G[maxn];
void dfs1(int u,int ff,int deep){
son[u]=0;fa[u]=ff;siz[u]=1;dep[u]=deep;
for(unsigned int i=0;i<G[u].size();i++){
int v=G[u][i];
if(v==ff) continue;
dfs1(v,u,deep+1);
siz[u]+=siz[v];
if(siz[v]>siz[son[u]]) son[u]=v;
}
}
void dfs2(int u,int ff){
w[u]=++tree_id;p[u]=ff;Rank[w[u]]=u;
if(son[u]) dfs2(son[u],ff);
else return ;
for(unsigned int i=0;i<G[u].size();i++){
int v=G[u][i];
if(v!=fa[u]&&v!=son[u]) dfs2(v,v);
}
}
void buildtree(int le,int ri,int node){
if(le==ri){
num[node]=A[Rank[le]];
return ;
}
int t=(le+ri)>>1;
buildtree(le,t,node<<1);
buildtree(t+1,ri,node<<1|1);
num[node]=num[node<<1]+num[node<<1|1];
}
void update(int pos,int val,int le,int ri,int node){
if(le==ri){
num[node]=val;
return ;
}
int t=(le+ri)>>1;
if(pos<=t) update(pos,val,le,t,node<<1);
else update(pos,val,t+1,ri,node<<1|1);
num[node]=num[node<<1]+num[node<<1|1];
}
int query(int l,int r,int le,int ri,int node){
if(l<=le&&ri<=r) return num[node];
int t=(le+ri)>>1,ans=0;
if(l<=t) ans+=query(l,r,le,t,node<<1);
if(r>t) ans+=query(l,r,t+1,ri,node<<1|1);
return ans;
}
int getans(int u,int v){
int f1=p[u],f2=p[v],tmp=0;
while(f1!=f2){
if(dep[f1]<dep[f2]){
swap(f1,f2);
swap(u,v);
}
tmp+=query(w[f1],w[u],1,n,1);
u=fa[f1];f1=p[u];
}
if(dep[u]>dep[v]) swap(u,v);
tmp+=query(w[u],w[v],1,n,1);
return tmp;
}
int main(){
int m,q,u,v,T,cas=1,op;
scanf("%d",&T);
while(T--){
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&A[i]);
for(int i=0;i<maxn;i++) G[i].clear();
memset(son,0,sizeof(son));tree_id=0;
for(int i=0;i<n-1;i++){
scanf("%d%d",&u,&v);
u++;v++;
G[u].push_back(v);
G[v].push_back(u);
}
dfs1(1,1,0);
dfs2(1,1);
buildtree(1,n,1);
scanf("%d",&q);
printf("Case %d:\n",cas++);
while(q--){
scanf("%d",&op);
if(op==0){
scanf("%d%d",&u,&v);
u++;v++;
printf("%d\n",getans(u,v));
}else{
scanf("%d%d",&u,&v);
u++;
update(w[u],v,1,n,1);
}
}
}
return 0;
}