POJ - 1611 - The Suspects

---

题目连接：http://poj.org/problem?id=1611

题目描述

Description

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.

严重急性呼吸系统综合症( SARS), 一种原因不明的非典型性肺炎,从2003年3月中旬开始被认为是全球威胁。为了减少传播给别人的机会, 最好的策略是隔离可能的患者。
在Not-Spreading-Your-Sickness大学( NSYSU), 有许多学生团体。同一组的学生经常彼此相通,一个学生可以同时加入几个小组。为了防止非典的传播,NSYSU收集了所有学生团体的成员名单。他们的标准操作程序(SOP)如下：
一旦一组中有一个可能的患者, 组内的所有成员就都是可能的患者。
然而,他们发现当一个学生被确认为可能的患者后不容易识别所有可能的患者。你的工作是编写一个程序, 发现所有可能的患者。

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.

输入文件包含多组数据。
对于每组测试数据：
第一行为两个整数n和m, 其中n是学生的数量, m是团体的数量。0 < n <= 30000，0 <= m <= 500。
每个学生编号是一个0到n-1之间的整数，一开始只有0号学生被视为可能的患者。
紧随其后的是团体的成员列表，每组一行。
每一行有一个整数k，代表成员数量。之后,有k个整数代表这个群体的学生。一行中的所有整数由至少一个空格隔开。
n = m = 0表示输入结束，不需要处理。

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

解题思路

采用并查集的优化方法，直接传递为根节点，然后父亲设置的时候小数当父亲，这样数字 0 就是可能患病的人数，遍历一下即可
并查集详细介绍

AC代码

#include<iostream>
#include<cstring>
#define N 30010
using namespace std;
int pre[N];
int a[N];
int find(int x) {
    int r = x;
    while(r != pre[r]) {    
        r = pre[r];
    }
    int i = x, j;
    while(pre[i] != r) {
        j = i;
        i = pre[i];
        pre[j] = r;
    } 
    return r;
}
void join(int a, int b) {
    int x = find(a);
    int y = find(b);
    if(x > y) pre[x] = y;
    if(x < y) pre[y] = x;
}
int main () {
    int n, m, x;
    while(~scanf("%d %d", &n, &m) && (n || m)) {
        for(int i = 0; i < n; i++) 
            pre[i] = i;
        memset(a, 0, sizeof(a));
        for(int i = 0; i < m; i++) {
            scanf("%d", &x);
            for(int j = 0; j < x; j++) {
                scanf("%d", &a[j]);
                if(j != 0) 
                    join(a[j], a[j-1]);
            }
        }
        for(int i = 0; i < n; i++) {
            find(i);
        }
        int ans = 0;
        for(int i = 0; i < n; i++) {
            if(pre[i] == 0) {
                ans++;
            }
        }
        printf("%d\n", ans);
    } 
    return 0;
}