UVA - 1197 （简单并查集计数）

标签：ogr   lis   space   cts   nim   cat   style   pac   suspect   

Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strategy is to separate the suspects from others. In the Not-Spreading-Your-Sickness University (NSYSU), there are many student groups. Students in the same group intercommunicate with each other frequently, and a student may join several groups. To prevent the possible transmissions of SARS, the NSYSU collects the member lists of all student groups, and makes the following rule in their standard operation procedure (SOP).
Once a member in a group is a suspect, all members in the group are suspects.
However, they ?nd that it is not easy to identify all the suspects when a student is recognized as a suspect. Your job is to write a program which ?nds all the suspects.
Input
The input ?le contains several cases. Each test case begins with two integers n and m in a line, where n is the number of students, and m is the number of groups. You may assume that 0 < n ≤ 30000 and 0 ≤ m ≤ 500. Every student is numbered by a unique integer between 0 and n−1, and initially student 0 is recognized as a suspect in all the cases. This line is followed by m member lists of the groups, one line per group. Each line begins with an integer k by itself representing the number of members in the group. Following the number of members, there are k integers representing the students in this group. All the integers in a line are separated by at least one space. A case with n = 0 and m = 0 indicates the end of the input, and need not be processed.
Output
For each case, output the number of suspects in one line.
Sample Input
100 4 2 1 2 5 10 13 11 12 14 2 0 1 2 99 2 200 2 1 5 5 1 2 3 4 5 1 0 0 0
Sample Output
4 1 1

题目意思：

有n个人，m个学习，每个信息表示k个人曾经是一个团体（一个团体的人只要一人有病，团体所有人都可能患病）现在已经知道0号有病

问你有几个人可能会患病

分析：

简单的计数并查集

最后统计一些和0在一个集合里面的人数就是可能患病总人数

code：

#include <iostream>
#include<algorithm>
#include <cstdio>
#include<cstring>
#include<math.h>
#include<memory>
using namespace std;
typedef long long LL;
#define max_v 30000
int pa[max_v];
int rk[max_v];
int n,m;
void make_set(int x)
{
    pa[x]=x;
    rk[x]=0;
}
int find_set(int x)
{
    if(x!=pa[x])
        pa[x]=find_set(pa[x]);
    return pa[x];
}
void union_set(int x,int y)
{
    x=find_set(x);
    y=find_set(y);
    if(x==y)
        return ;
    if(rk[x]>rk[y])
        pa[y]=x;
    else
    {
        pa[x]=y;
        if(rk[x]==rk[y])
            rk[y]++;
    }
}
int main()
{
    while(~scanf("%d %d",&n,&m))
    {
        if(n==0&&m==0)
            break;
        for(int i=0;i<=n-1;i++)
            make_set(i);
        for(int i=1;i<=m;i++)
        {
            int k;
            scanf("%d",&k);
            int x,y;
            scanf("%d",&x);
            for(int i=1;i<=k-1;i++)
            {
                scanf("%d",&y);
                union_set(x,y);
            }
        }
        int sum=0;
       for(int i=0;i<=n-1;i++)
       {
           if(find_set(i)==pa[0])
            sum++;
       }
       printf("%d\n",sum);
    }
    return 0;
}

UVA - 1197 （简单并查集计数）

标签：ogr   lis   space   cts   nim   cat   style   pac   suspect   

原文地址：https://www.cnblogs.com/yinbiao/p/9432256.html