[CodeChef-ANUDTQ] Dynamic Trees and Queries

类似维护括号序列，给每个点建两个点，然后所有操作都能轻松支持了。注意sum和lastans是long long。

 #include<cstdio>
 #include<algorithm>
 #define rep(i,l,r) for (int i=(l); i<=(r); i++)
 #define For(i,x) for (int i=h[x],k; i; i=nxt[i])
 typedef long long ll;
 using namespace std;

 const int N=;
 ll ans,sm[N];
 int n,nd,tim,rt,op,x,y,m,cnt,a[N],tag[N];
 int v[N],f[N],L[N],R[N],sz[N],c[N][],h[N],to[N],nxt[N];

 void add(int u,int v){ to[++cnt]=v; nxt[cnt]=h[u]; h[u]=cnt; }

 void dfs(int x,int fa){
     L[x]=++tim; v[tim]=a[x];
     For(i,x) if ((k=to[i])!=fa) dfs(k,x);
     R[x]=++tim; v[tim]=a[x];
 }

 void upd(int x){
     sm[x]=sm[c[x][]]+sm[c[x][]]+v[x];
     sz[x]=sz[c[x][]]+sz[c[x][]]+;
 }

 void put(int x,int k){ v[x]+=k; sm[x]+=1ll*k*sz[x]; tag[x]+=k; }

 void push(int x){
     if (!tag[x]) return;
     if (c[x][]) put(c[x][],tag[x]);
     if (c[x][]) put(c[x][],tag[x]);
     tag[x]=;
 }

 void pd(int x){ if (f[x]) pd(f[x]); push(x); }

 int build(int l,int r){
     int mid=(l+r)>>,x=mid;
     if (l<mid) c[x][]=build(l,mid-),f[c[x][]]=x;
     if (mid<r) c[x][]=build(mid+,r),f[c[x][]]=x;
     upd(x); return x;
 }

 void rot(int &rt,int x){
     int y=f[x],z=f[y],w=c[y][]==x;
     if (y==rt) rt=x; else c[z][c[z][]==y]=x;
     f[x]=z; f[y]=x; f[c[x][w^]]=y; c[y][w]=c[x][w^];
     c[x][w^]=y; upd(y);
 }

 void splay(int &rt,int x){
     for (pd(x); x!=rt; rot(rt,x)){
         int y=f[x],z=f[y];
         if (y!=rt) (c[z][]==y)^(c[y][]==x) ? rot(rt,x) : rot(rt,y);
     }
     upd(x);
 }

 int pre(int x){ splay(rt,x); for (x=c[x][]; c[x][]; x=c[x][]); return x; }
 int lst(int x){ splay(rt,x); for (x=c[x][]; c[x][]; x=c[x][]); return x; }

 void Ins(int x,int y){
     int k=lst(L[x]); splay(rt,L[x]); splay(c[rt][],k);
     c[k][]=++nd; v[nd]=y; f[nd]=k; R[++n]=nd;
     nd++; c[nd-][]=nd; v[nd]=y; f[nd]=nd-; L[n]=nd;
     upd(nd); upd(nd-); upd(k); upd(rt);
 }

 void Add(int x,int y){
     int l=pre(L[x]),r=lst(R[x]); splay(rt,l); splay(c[rt][],r);
     put(c[r][],y); upd(r); upd(rt);
 }

 void Del(int x){
     int l=pre(L[x]),r=lst(R[x]); splay(rt,l); splay(c[rt][],r);
     c[r][]=f[c[r][]]=; upd(r); upd(rt);
 }

 ll Que(int x){ int l=pre(L[x]),r=lst(R[x]); splay(rt,l); splay(c[rt][],r); return sm[c[r][]]; }

 int main(){
     freopen("anudtq.in","r",stdin);
     freopen("anudtq.out","w",stdout);
     scanf("%d",&n);
     rep(i,,n) scanf("%d",&a[i]);
     rep(i,,n) scanf("%d%d",&x,&y),x++,y++,add(x,y),add(y,x);
     tim=; dfs(,); rt=build(,tim+); nd=tim+; scanf("%d",&m);
     rep(i,,m){
         scanf("%d%d",&op,&x); x+=ans+;
         if (op==) scanf("%d",&y),Ins(x,y);
         if (op==) scanf("%d",&y),Add(x,y);
         if (op==) Del(x);
         if (op==) printf("%lld\n",ans=Que(x)/);
     }
     return ;
 }