BZOJ 3376 [Usaco2004 Open]Cube Stacking 方块游戏(带权并查集）

题解

 #include<iostream>
 #include<cstring>
 #include<cstdio>
 #include<cmath>
 #include<algorithm>
 using namespace std;
 const int N=;
 int q,fa[N],f[N],d[N];
 int find(int x){
     if(fa[x]!=x){
         int y=fa[x];
         fa[x]=find(y);
         d[x]=d[y];
         f[x]=f[x]+f[y];
     }
     return fa[x];
 }
 int main(){
     scanf("%d",&q);
     for(int i=;i<=;i++){
         fa[i]=i;f[i]=;d[i]=i;
     }
     char s[];
     while(q--){
         scanf("%s",s);
         if(s[]=='M'){
             int x,y;
             scanf("%d%d",&x,&y);
             int a=find(x);
             int b=find(y);
             fa[b]=a;
             f[b]=f[d[a]]+;
             d[a]=d[b];
             find(d[b]);
         }
         else{
             int x;
             scanf("%d",&x);
             find(x);
             printf("%d\n",f[d[x]]-f[x]);
         }
     }
     return ;
 }