AcWing 837. 连通块中点的数量
原题链接
简单
作者:
piaofan
,
2021-02-06 11:32:51
,
所有人可见
,
阅读 475
#include<bits/stdc++.h>
using namespace std;
const int N = 100005;
int p[N], siz[N];
int find (int x) {
if (p[x] != x) return p[x] = find(p[x]);
return p[x];
}
int main (void) {
int n, m, a, b;
char op[3];
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) { p[i] = i; siz[i] = 1; }
while (m--) {
scanf("%s", op);
if (op[0] == 'C') {
scanf("%d%d", &a, &b);
if (find(a) != find(b)) {
siz[find(b)] += siz[find(a)];
p[find(a)] = find(b);
}
}
else if (op[1] == '1') {
scanf("%d%d", &a, &b);
if (find(a) == find(b)) printf("Yes\n");
else printf("No\n");
} else {
scanf("%d", &a);
printf("%d\n", siz[find(a)]);
}
}
return 0;
}