The Suspects POJ - 1611 并查集，同集合的数

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

翻译：有n个人，m个集合，每个人的标号为0到n，其中0带有传染病，如果再一个集合中有人有传染病，那么这个集合里的所有人都会有这种传染病
，问每个测试中有传染病的有但是人，输入第一行为n,m。往下为m行，每行第一个为该集合的人数，其他为该集合中人的标号。输入以0 0结束。

思路：简单的并查集，套用模板即可，结果只需判断与0同集合的有但是人。

代码：

#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <iostream>
#define mod 998244353
#define eps 1e-6
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;

//fa[x]表示x的最远祖先
int fa[30005];
//初始化，一开始每个点单独成集合
void build(int qwq) 
{
    for(int i=0;i<=qwq;i++)
    {
        fa[i]=i;
    }
    return ;
} 
//找到x的最远祖先，并且压缩路径
int find(int x)
{
    if(fa[x]==x)
    {
        return x;
    }
    return fa[x]=find(fa[x]);
}
//判断x,y是不是在同一个集合里，直接判断最远祖先是不是一样的 
bool che(int x,int y)
{
    return find(x)==find(y);
}
//合并x,y，我们在判断x和y是不是同一个集合里，
//路径压缩之后fa[x],fa[y]已经是最远祖先了，
//所以直接将fa[x]的父亲连接在fa[y]的祖先上
void mer(int x,int y)
{
    if(!che(x,y)) 
    {
        fa[fa[x]]=fa[y];
    }
    return ;
}

int main()
{
    int n,m;
    while(scanf("%d %d",&n,&m)&&(n||m))
    {
        //初始化
        build(n);
        int k,a,b;
        for(int i=0;i<m;i++)
        {
            scanf("%d",&k);
            //每组第一个数
            scanf("%d",&a);
            //将每组其他数与本组的第一个数合并
            for(int j=1;j<k;j++)
            {
                scanf("%d",&b);
                mer(a,b);
            }
        }
        //0本身也是一个人
        int ans=1;
        //遍历寻找与0同集合的数
        for(int i=1;i<=n;i++)
        {
            if(find(i)==find(0))
            {
                ans++;
            }
        }
        printf("%dn",ans);
    }
}