#include <iostream>
using namespace std;
const int N = 30010;
int p[N], cnt[N], d[N];
int find(int x)
{
if (p[x] != x)
{
int t = find(p[x]);
d[x] += d[p[x]];
p[x] = t;
}
return p[x];
}
int main()
{
int T;
scanf("%d", &T);
for (int i = 1; i < N; i ++ )
{
p[i] = i;
cnt[i] = 1;
}
while (T -- )
{
char op[2];
int a, b;
scanf("%s%d%d", op, &a, &b);
if (op[0] == 'M')
{
int pa = find(a), pb = find(b);
if (pa != pb)
{
d[pa] = cnt[pb];
cnt[pb] += cnt[pa];
p[pa] = pb;
}
}
else
{
int pa = find(a), pb = find(b);
if (pa != pb) puts("-1");
else printf("%d\n", max(0, abs(d[a] - d[b]) - 1));
}
}
return 0;
}
银河英雄传说——银河英雄传说
最新推荐文章于 2024-02-28 10:11:02 发布