AcWing 837. 连通块中点的数量
原题链接
简单
作者:
我是java同学
,
2022-12-11 19:24:45
,
所有人可见
,
阅读 106
#include <iostream>
using namespace std;
const int N = 100010;
int n, m;
int siz[N];
int p[N];
int find(int x)
{
if (p[x] != x) p[x] = find(p[x]);
return p[x];
}
int main()
{
cin >> n >> m;
for (int i = 1; i <= n; i ++)
{
p[i] = i;
siz[i] = 1;
}
while (m --)
{
string op;
int a, b;
cin >> op;
if (op == "C")
{
cin >> a >> b;
if (find(a) == find(b)) continue;
siz[find(b)] += siz[find(a)];
p[find(a)] = find(b);
}
else if (op == "Q1")
{
cin >> a >> b;
if (find(a) == find(b)) puts("Yes");
else puts("No");
}
else
{
cin >> a;
cout << siz[find(a)] << endl;
}
}
return 0;
}