POJ---1611 The Suspects【并查集】

        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 find 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 finds all the suspects.

Input

The input file 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

SOURCE:点击打开链接

题意：

    有N个人，编号为0到n-1，把他们分成了好多组（一个人不一定只在一个组中），只要每个组中有一个人的了病，整个组都被传染，其中0号是病原体，问一共有多少人的了病。

    输入多组案例，每组第一行输入总共有n个人，分成m组，接下来m行，第一个为该组有多少人，接下来就是编号。输入n=0，m=0停止。

代码：

#include <iostream>
#define MAX 30005
using namespace std;
int par[MAX];
int find(int x);
void unite(int x,int y);
int main(void)
{
    int n,m,t,fir,d,ans;
    while(cin>>n>>m)
    {
        if(m==0&&n==0)
            break;
        ans=0;
        for(int i=0; i<n; i++)
            par[i]=i;    //初始化，每个节点的父节点为自己，表示与别的节点无联系
        for(int i=0; i<m; i++)
        {
            cin>>t>>fir;
            for(int j=1; j<t; j++)
            {
                cin>>d;
                unite(fir,d);    //将每一组中的节点与该组第一个节点建立联系
            }
        }
        for(int i=0; i<n; i++)
            if(find(i)==0)  //如果某个节点的根节点为0，那么就被传染，人数就加1
                ans++;
        cout<<ans<<endl;
    }
    return 0;
}
int find(int x)
{
    int r=x;
    while(par[r]!=r)    //寻找根节点
        r=par[r];
    int i=x,j;
    while(i!=r)    //路径压缩
    {
        j=par[i];
        par[i]=r;
        i=j;
    }
    return r;
}
void unite(int x,int y)
{
    int r1 = find(x);
    int r2 = find(y);
    if(r1 == 0)      //如果x的根节点为0，就将y所在树的根节点接在0节点上
        par[r2] = r1;
    else if(r2 == 0)   //如果y的根节点为0，就将x所在树的根节点接在0节点上
        par[r1] = r2;
    else
        par[r1] =r2 ;   //如果x与y的根节点都不为0，就将x所在树的根节点接在y所在树的根节点上par[r2] =r1亦可
}