帮忙看一下!
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
const int N=100005;
int c[N],f[N],m,tot,l[N],r[N];
vector<vector<int > >b(N);
int sum(int x){
int t=0;
while(x>0){
t+=c[x];
x-=(x&-x);
}
return t;
}
void updata(int x,int y){
int t=0;
while(x<=m){
c[x]+=y;
x+=(x&-x);
}
}
void dfs(int x){
l[x]=tot;
for(int i=0;i<b[x].size();++i){
tot++;
dfs(b[x][i]);
}
r[x]=tot;
}
int main(){
while(~scanf("%d",&m)){
int x,y;
memset(c,0,sizeof(c));
memset(l,0,sizeof(l));
memset(r,0,sizeof(r));
memset(f,0,sizeof(f));
for(int i=0;i<N;++i)
b[i].clear();
for(int i=1;i<m;++i){
scanf("%d%d",&x,&y);
b[x].push_back(y);
}
tot=1;
dfs(1);
for(int i=1;i<=m;++i){
f[i]=1;
updata(i,1);
}
int n,q;
char p[5];
scanf("%d",&n);
for(int i=1;i<=n;++i){
scanf("%s%d",p,&q);
if(p[0]=='Q')printf("%d\n",sum(r[q])-sum(l[q]-1));
else {
if(f[i])updata(l[q],-1);
else updata(l[q],1);
f[i]=!f[i];
}
}
}
return 0;
}