题目:LOJ144.
这只是个用来屯板子的blog,原文.
代码如下:
#include<bits/stdc++.h>
using namespace std;
#define Abigail inline void
typedef long long LL;
const int N=1000000;
int Ri(){
int x=0,y=1;
char c=getchar();
for (;c<'0'||c>'9';c=getchar()) if (c=='-') y=-1;
for (;c<='9'&&c>='0';c=getchar()) x=x*10+c-'0';
return x*y;
}
struct side{
int y,next;
}e[N*2+9];
int lin[N+9],top,n,m,rot;
void Ins(int x,int y){
e[++top].y=y;
e[top].next=lin[x];
lin[x]=top;
}
int ld[N+9],rd[N+9],ord[N+9],co;
LL v[N+9],c[N+9];
void Dfs(int k,int fa){
ord[++co]=k;ld[k]=co;
for (int i=lin[k];i;i=e[i].next)
if (e[i].y^fa) Dfs(e[i].y,k);
rd[k]=co;
}
void Bit_add(int x,LL v){for (;x<=n;x+=x&-x) c[x]+=v;}
LL Bit_query(int x){LL sum=0;for (;x;x-=x&-x) sum+=c[x];return sum;}
LL Bit_query(int l,int r){return Bit_query(r)-Bit_query(l-1);}
void Add_node(int x,LL v){Bit_add(ld[x],v);}
LL Query_tree(int x){return Bit_query(ld[x],rd[x]);}
void Build(){for (int i=1;i<=n;++i) Add_node(i,v[i]);}
Abigail into(){
n=Ri();m=Ri();rot=Ri();
int x,y;
for (int i=1;i<=n;++i) v[i]=(LL)Ri();
for (int i=1;i<n;++i){
x=Ri();y=Ri();
Ins(x,y);Ins(y,x);
}
}
Abigail work(){
Dfs(rot,0);
Build();
}
Abigail getans(){
int opt,a;
while (m--){
opt=Ri();a=Ri();
if (opt==2) printf("%lld\n",Query_tree(a));
else Add_node(a,(LL)Ri());
}
}
int main(){
into();
work();
getans();
return 0;
}