传送门
题意:
两种操作:
1.修改某条边的边权(0/1)
2.询问某个点到1路径上的边权和
题解:
在DFS序上差分+树状数组。
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN=250004;
int n,m;
int head[MAXN],etot=0;
struct EDGE {
int v,nxt;
}e[MAXN<<1];
int in[MAXN],out[MAXN],tim=0;
inline int read() {
int x=0;char c=getchar();
while (c<'0'||c>'9') c=getchar();
while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x;
}
inline void adde(int u,int v) {
e[etot].nxt=head[u],e[etot].v=v,head[u]=etot++;
e[etot].nxt=head[v],e[etot].v=u,head[v]=etot++;
}
void dfs(int p,int fa) {
in[p]=++tim;
for (int i=head[p];~i;i=e[i].nxt) {
int v=e[i].v;
if (v^fa) dfs(v,p);
}
out[p]=tim;
}
int c[MAXN];
inline void add(int x,int delta) {
for (;x<=n;x+=x&-x) c[x]+=delta;
}
inline int query(int x) {
int ret=0;
for (;x;x-=x&-x) ret+=c[x];
return ret;
}
int main() {
// freopen("bzoj 1103.in","r",stdin);
memset(head,-1,sizeof(head));
n=read();
for (register int i=1;i<n;++i) {
int u=read(),v=read();
adde(u,v);
}
m=read()+n-1;
dfs(1,0);
for (register int i=2;i<=n;++i) add(in[i],1),add(out[i]+1,-1);
for (register int i=0;i<m;++i) {
char s;
while (!isalpha(s=getchar()));
if (s=='A') {
int x=read(),y=read();
add(in[y],-1),add(out[y]+1,1);
} else {
int x=read();
printf("%d\n",query(in[x]));
}
}
return 0;
}