[并查集 树] BZOJ 4551 [Tjoi2016&Heoi2016]树

本来想的二分加树链剖分

结果直接离线并查集可过

记录fat为上边的第一个有标记的祖先

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#define V G[p].v
using namespace std;
 
inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
  return *p1++;
}
 
inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
 
inline void read(char &x){
  for (x=nc();x!='Q' && x!='C';x=nc());
}
 
const int N=100005;
 
struct edge{
  int u,v,next;
};
 
edge G[N<<1];
int head[N],inum;
 
inline void add(int u,int v,int p){
  G[p].u=u; G[p].v=v; G[p].next=head[u]; head[u]=p;
}
 
int n,m,flag[N];
 
int fat[N];
inline int Fat(int u){
  return u==fat[u]?u:fat[u]=Fat(fat[u]);
}
 
int fat0[N];
 
inline void dfs(int u,int fa,int top){
  if (flag[u]) top=u;
  fat[u]=top; fat0[u]=fa;
  for (int p=head[u];p;p=G[p].next)
    if (V!=fa)
      dfs(V,u,top);
}
 
struct event{
  char f; int x; int ans;
}eve[N];
 
int main()
{
  int ix,iy;
  read(n); read(m); flag[1]++;
  for (int i=1;i<n;i++)
    read(ix),read(iy),add(ix,iy,++inum);
  for (int i=1;i<=m;i++){
    read(eve[i].f); read(eve[i].x);
    if (eve[i].f=='C') flag[eve[i].x]++;
  }
  dfs(1,0,1);
  for (int i=m;i;i--)
    if (eve[i].f=='Q')
    {
      eve[i].ans=Fat(eve[i].x);
    }
    else if (eve[i].f=='C')
    {
      flag[eve[i].x]--;
      if (!flag[eve[i].x])
        fat[eve[i].x]=Fat(fat0[eve[i].x]);
    }
  for (int i=1;i<=m;i++)
    if (eve[i].f=='Q')
      printf("%d\n",eve[i].ans);
  return 0;
}