luogu P5092 [USACO2004OPEN]Cube Stacking 方块游戏

//
#include<bits/stdc++.h>
using namespace std;
int n,p;
#define maxnn 40100
int f[maxnn],dis[maxnn],cnt[maxnn];
int  gf(int v,int num)
{
    if(f[v]==v)
    {
        cnt[v]+=num;
        return v;
    }
    else
    {
        int fx=f[v];
        f[v]=gf(f[v],num);
        if(f[v]!=fx)
        dis[v]=dis[v]+dis[fx];
        return f[v];
    }
}
int main()
{
    char a;
    cin>>p;
    int x,y;
    for(int i=1;i<=40000;i++)
    f[i]=i,dis[i]=0,cnt[i]=1;
    
    for(int i=1;i<=p;i++)
    {
        cin>>a;
        if(a==‘M‘)
        {
            cin>>x>>y;
            int fy=gf(y,0);
            if(gf(y,0)!=gf(x,0))
            {
            dis[gf(y,0)]=cnt[gf(x,0)];
            f[gf(y,0)]=gf(x,0);
            cnt[gf(x,0)]+=cnt[fy];
            }
        }
        else
        {
            cin>>x;
            
            {
            gf(x,0);
            cout<<abs(dis[x]-cnt[gf(x,0)])-1<<endl;
            }
        }
    }
}