作者:
Jesus
,
2022-06-22 00:47:44
,
所有人可见
,
阅读 5
#include <iostream>
#include <cstdio>
using namespace std;
const int N = 1e5 + 10;
int p[N], cnt[N]; //size变量名会冲突
int find(int x) {
if (p[x] != x) return p[x] = find(p[x]);
return p[x];
}
int main () {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
p[i] = i;
cnt[i] = 1;
}
while (m--) {
string op;
int a, b;
cin >> op;
if (op == "C")
{
cin >> a >> b;
a = find(a), b = find(b);
if (a != b)
{
p[a] = b;
cnt[b] += cnt[a];
}
}
else if (op == "Q1")
{
cin >> a >> b;
if (find(a) == find(b)) puts("Yes");
else puts("No");
}
else
{
cin >> a;
cout << cnt[find(a)] << endl;
}
}
return 0;
}