AcWing 837. 连通块中点的数量
原题链接
简单
作者:
qpalzmczy
,
2025-04-09 21:27:00
· 广东
,
所有人可见
,
阅读 4
#include <bits/stdc++.h>
using namespace std;
const int N = 1e7 + 10;
int n, m, sum = 0;
int res[N], cnt[N];
bool st[N];
int find(int i)
{
if (res[i] != i)
{
res[i] = find(res[i]);
}
return res[i];
}
int main()
{
#ifdef LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
scanf("%d%d", &n, &m);
char c[2];
int a, b;
for (int i = 0; i < n + 1; i++)
{
res[i] = i;
cnt[i] = 1;
}
while (m--)
{
scanf("%s%d", c, &a);
if (*c == 'C')
{
scanf("%d", &b);
a = find(a), b = find(b);
if (a != b)
{
res[a] = b;
cnt[b] += cnt[a];
cnt[a] = 0;
}
#ifdef DEBUG
for (int i = 0; i < n + 1; i++)
printf("%d ", cnt[i]);
printf("\n");
#endif
}
else if (*c == 'Q')
{
if (*(c + 1) == '1')
{
scanf("%d", &b);
if (find(a) == find(b))
printf("Yes\n");
else
printf("No\n");
}
else if (*(c + 1) == '2')
printf("%d\n", cnt[find(a)]);
}
}
return 0;
}