标签：iss can lan strategy prevent std span find possible
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患病，问多少人可能患病。
思路：
并查集，求最后和0在同一集合人数
1 #include <stdio.h>
2 #include <string.h>
3
4 int pre[30004];
5 int sum[30004];
6
7 void init(int n)
8 {
9 int i;
10 for(i=0;i<=n;i++)
11 {
12 pre[i] = i;
13 sum[i] = 1;
14 }
15 }
16
17 int find_pre(int x)
18 {
19 if(pre[x]==x) return x;
20 else return pre[x] = find_pre(pre[x]);
21 }
22
23 int main()
24 {
25 int n, m, i, num;
26 int xx, yy, root, x;
27 while(~scanf("%d %d", &n, &m) && (n || m))
28 {
29 init(n);
30 for(i=0;i<m;i++)
31 {
32 scanf("%d", &num);
33 scanf("%d", &root);
34 yy = find_pre(root);
35 num--;
36 while(num--)
37 {
38 scanf("%d", &x);
39 xx = find_pre(x);
40 if(xx != yy) //这里之前写成pre[yy] = xx; sum[xx] += sum[yy]; 样例可以过，但是WA了
41 {
42 pre[xx] = yy;
43 sum[yy] += sum[xx];
44 }
45 }
46 }
47 printf("%d\n", sum[find_pre(0)]);
48 }
49 return 0;
50 }
POJ 1611 ---The Suspects（并查集）
标签：iss can lan strategy prevent std span find possible
原文地址：https://www.cnblogs.com/0xiaoyu/p/11375196.html
