并查集题目 The Suspects 计算疑似患者的数量

最新推荐文章于 2025-03-24 22:50:29 发布

CQY0531

最新推荐文章于 2025-03-24 22:50:29 发布

阅读量576

点赞数 14

文章标签：算法数据结构图论 c语言蓝桥杯

本文链接：https://blog.csdn.net/CQY0531/article/details/145503286

版权

解答

#include<cstdio>
int fa[30005];
int find(int x) {
   if (fa[x] != x) {
       fa[x] = find(fa[x]);
   }
   return fa[x];
}
void init(int n) {
   for (int i = 0; i < n; i++) {
       fa[i] = i;
   }
}
void ra(int x, int y) {
   int X = find(x);
   int Y = find(y);
   if (X != Y) {
       fa[Y] = X;
   }
}
int main() {
   int m, n;
   while (~scanf("%d%d", &n, &m)) {
       if (n == 0 && m == 0) {
           break;
       }
       init(n);
       for (int i = 1; i <= m; i++) {
           int k, t, s;
           scanf("%d", &k);
           if (k > 0) {
               scanf("%d", &t);
           }
           for (int j= 1; j< k; j++) {
               scanf("%d", &s);
               ra(t, s);
           }
       }
       int count = 0;
       for (int i = 0; i <n; i++) {
           if (find(i) == find(0)) {
               count++;
           }
       }
       printf("%d\n", count);
   }
   return 0;
}