AC通道:http://www.lydsy.com/JudgeOnline/problem.php?id=1103
【题解】
直接上树剖就好了,然而我的树剖本地测试5.2s,交到bzoj上却超时了,可能是蒟蒻自带大常数吧。
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
#define FILE "meg"
#define MAXN 500010
#define up(i,j,n) for(ll i=j;i<=n;++i)
#define dn(i,j,n) for(ll i=j;i>=n;--i)
namespace INIT{
char buf[1<<15],*fs,*ft;
inline char getc(){return (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<15,stdin),fs==ft))?0:*fs++;}
inline ll read(){
ll x=0,f=1; char ch=getchar();
while(!isdigit(ch)) {if(ch=='-') f=-1; ch=getchar();}
while(isdigit(ch)) {x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
}using namespace INIT;
struct node{ll y,next,v;}e[MAXN*2];
ll n,m,len,z,Link[MAXN],X[MAXN],Y[MAXN],f[MAXN],size[MAXN],w[MAXN],deep[MAXN],top[MAXN],son[MAXN],tr[MAXN*8];
void insert(ll x,ll y,ll v){e[++len].next=Link[x];Link[x]=len;e[len].y=y;e[len].v=v;}
void dfs(ll x){
size[x]=1; son[x]=0;
for(ll i=Link[x];i;i=e[i].next){
if(e[i].y==f[x]) continue;
f[e[i].y]=x; deep[e[i].y]=deep[x]+1;
dfs(e[i].y); size[x]+=size[e[i].y];
if(size[e[i].y]>size[son[x]]) son[x]=e[i].y;
}
}
void dfs(ll x,ll temp){
w[x]=++z; top[x]=temp;
if(son[x]) dfs(son[x],temp);
for(ll i=Link[x];i;i=e[i].next)
if(e[i].y!=son[x]&&e[i].y!=f[x]) dfs(e[i].y,e[i].y);
}
void updata(ll p,ll l,ll r,ll x,ll v){
if(x>r||x<l) return;
if(l==r) {tr[p]=v; return;}
ll mid=(l+r)>>1;
updata(p<<1,l,mid,x,v); updata(p<<1|1,mid+1,r,x,v);
tr[p]=tr[p<<1]+tr[p<<1|1];
}
ll find(ll p,ll l,ll r,ll x,ll y){
if(x>r||y<l) return 0;
if(x<=l&&y>=r) return tr[p];
ll mid=(l+r)>>1;
return find(p<<1,l,mid,x,y)+find(p<<1|1,mid+1,r,x,y);
}
int solve(ll x){
ll ans(0);
while(x){
ans+=find(1,1,z,w[top[x]],w[x]);
x=f[top[x]];
}
return ans;
}
int main(){
freopen(FILE".in","r",stdin);
freopen(FILE".out","w",stdout);
int __size__ = 20 << 20;
char *__p__ = (char*)malloc(__size__) + __size__;
__asm__("movl %0, %%esp\n" :: "r"(__p__));
n=read();
up(i,1,n-1){X[i]=read(),Y[i]=read(); insert(X[i],Y[i],1); insert(Y[i],X[i],1);}
dfs(1); dfs(1,1);
up(i,1,n-1){
if(deep[X[i]]>deep[Y[i]]) swap(X[i],Y[i]);
updata(1,1,z,w[Y[i]],1);
}
m=read();
up(i,1,n+m-1){
char ch[5]; scanf("%s",ch);
if(ch[0]=='A'){
ll x=read(),y=read();
if(deep[x]>deep[y]) swap(x,y);
updata(1,1,z,w[y],0);
}
else {ll x=read(); printf("%d\n",solve(x));}
}
return 0;
}