poj union_find相关之1611 The Suspects

最新推荐文章于 2018-08-08 17:08:29 发布

金星上的小沼泽

最新推荐文章于 2018-08-08 17:08:29 发布

阅读量219

点赞数

分类专栏：算法题并查集

本文链接：https://blog.csdn.net/ziqi9216/article/details/73511627

版权

算法题同时被 2 个专栏收录

38 篇文章 0 订阅

订阅专栏

并查集

2 篇文章 0 订阅

订阅专栏

poj union-find 1611 The Suspects
就是简单的并查集

#include<cstdio>
#include<cstring>
#include<iostream>
#include<memory.h>
#define MAXS 30005
#define MAXG 505
using namespace std;
int n, m;
int pre[MAXS];
int find(int t)
{
    int a = t;
    while (pre[a] != a)
        a = pre[a];
    return a;
}
void union_int(int a,int b)
{
    int x, y;
    x = find(a);
    y = find(b);
    if (x != y)
        pre[y] = x;
}
int main()
{
    //freopen("1.txt", "r", stdin);
    int i, j, k, a, b, cont;
    while (scanf("%d%d", &n, &m) != EOF && (n || m))
    {
        for (i = 0; i < n; i++)
            pre[i] = i;
        for (i = 0; i < m; i++)
        {
            scanf("%d", &k);
            scanf("%d", &a);
            for (j = 1; j < k; j++)
            {
                scanf("%d", &b);
                union_int(a, b);
            }
        }
        cont = 1;
        j = find(0);
        for (i = 1; i < n;i++)
        if (find(i) == j)
            cont++;
        printf("%d\n", cont);
    }
}