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

#include <cstdio>
#include <cstring>
const int N=30050;
int h
,f
,size
;
char s[2];
inline int find(int x){
if(f[x]==x)return x;
int temp=f[x];f[x]=find(f[x]);
if(temp!=f[x])h[x]+=h[temp];
return f[x];
}
inline void Unit(int x,int y){
h[find(x)]=size[find(y)];
size[find(y)]+=size[find(x)];
f[find(x)]=find(y);
}
int main(){
int T,x,y;scanf("%d",&T);
for(int i=0;i<N;i++)f[i]=i,size[i]=1,h[i]=0;
while(T--){
scanf("%s",s);
if(s[0]=='M')scanf("%d%d",&x,&y),Unit(x,y);
else scanf("%d",&x),find(x),printf("%d\n",h[x]);
}
}