【codevs 1540】银河英雄传说

sum[]以当前舰艇为首的队伍长度
s[]当前舰艇到根节点的距离

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int n,sum[500005],s[500005],fa[500005],x,y;
char a;
int find(int x)
{
    if(fa[x]==x) return x;
    int f=find(fa[x]);
    s[x]+=s[fa[x]];
    fa[x]=f;
    return fa[x];
}
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        fa[i]=i;
        sum[i]=1;
    }
    for(int i=1;i<=n;i++)
    {
        cin>>a>>x>>y;
        int fx=find(x),fy=find(y);
        if(a=='M')
        {
            fa[fx]=fy;
            s[fx]=sum[fy];
            sum[fy]+=sum[fx];
        }
        else 
        {
            if(fx!=fy) printf("%d\n",-1);
            else printf("%d\n",abs(s[x]-s[y])-1);
        }
    }
    return 0;
}