银河英雄传说

#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#define rep(i,l,r) for(int i=l;i<=r;++i)
#define per(i,l,r) for(int i=l;i>=r;--i)
#define MAXN 30010
using namespace std;
inline int ()
{
    char c;
    int a=0;
    while((c=getchar())==' '||c=='n'||c=='r');
    while(c>='0'&&c<='9')
    {
        a*=10;a+=(c-'0');c=getchar();
    }
    return a;
}
int a[MAXN],b[MAXN],v[MAXN];
int finda(int x)
{
    if(!a[x])
     return x;
    finda(a[x]);
    v[x]+=v[a[x]];
    return a[x]=finda(a[x]);
}
int findb(int x)
{
    return b[x]?b[x]=findb(b[x]):x;
}
int main()
{
    char c;
    int tx,ty;
    int T=read();
    while(T--)
    {
        while((c=getchar())==' '||c=='n'||c=='r');
        tx=read();ty=read();
        if(c=='M')//merge
        {
            tx=finda(tx);ty=findb(ty);
            v[tx]=1;
            a[tx]=ty;
            b[ty]=findb(tx);
        }
        else if(c=='C')//query
        {
            if(finda(tx)!=finda(ty))
             printf("-1n");
            else
             printf("%dn",abs(v[tx]-v[ty])-1);
        }
    }
    return 0;
}