POJ-1611 The Suspects

原创 2018年04月14日 22:54:12

题目链接:点击打开链接

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.

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
思路:我刚开始想的复杂,还有就是输入数据也会出错。这里用了sum数组。把每一个点当作这个集合的人数,初始化为自己本身。合并的时候,把人也合并。

AC代码:

#include<iostream>
#include<queue>
#include<algorithm>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cstdio>
#include<cstdlib>
#include<cctype>
#include<cstring>
using namespace std;
const int MAX = 30010;
const int INF = 0X3f3f3f;

int father[MAX];
int sum[MAX];
int n, m;
int vis[MAX];

void init() {
    for(int i = 0; i < n; i++) {//卡了我半天, 初始化用n 我原来用的MAX。
        father[i] = i;
        sum[i] = 1;
    }
}

int findfather(int x) {//路径压缩
    int a = x;
    while(x != father[x]) {
        x = father[x];
    }
    while(a != father[a]) {
        int z = a;
        a = father[a];
        father[z] = a;
    }
    return x;
}


void Union(int a, int b) {//合并
	int faA = findfather(a);
	int faB = findfather(b);
    if(faA != faB) {
        father[faA] = faB;
        sum[faB] += sum[faA];//注意不要合并错了
    }
}



int main() {
    while(scanf("%d %d", &n, &m) != EOF) {
        if(n == 0 && m == 0)
            break;
        init();
        while(m--) {//并查集,常用的处理数据方式
            int k, u, v;
            scanf("%d", &k);
            scanf("%d", &u);
            k--;
            while(k--) {
                scanf("%d", &v);
                Union(u, v);
            }
        }
        printf("%d\n", sum[findfather(0)]);//找到0的祖先,看这个集合多少人
    }
	return 0;
}

The Suspects POJ1611

The Suspects Time Limit: 1000MS   Memory Limit: 20000K Total Submissions: 13311   ...
  • tiantangrenjian
  • tiantangrenjian
  • 2011-12-19 16:24:05
  • 3410

Poj-1611 The Suspects

[题目描述] 题意: 有一个学校,有N个学生,编号为0-N-1,现在0号学生感染了非典,凡是和0在一个社团的人就会感染,并且这些人如果还参加了别的社团,他所在的社团照样全部感染,求感染的人数。 感...
  • zzti_xiaowei
  • zzti_xiaowei
  • 2018-04-11 11:53:34
  • 30

POJ-1611 ----The Suspects

The Suspects Time Limit: 1000MS   Memory Limit: 20000K Total Submissions: 39931   ...
  • IMLYZ
  • IMLYZ
  • 2017-07-27 14:30:41
  • 107

<poj-1611>The Suspects

The Suspects Time Limit: 1000MS   Memory Limit: 20000K Total Submissions: 34781   Accepted: 16...
  • Tenderness___
  • Tenderness___
  • 2016-11-10 16:13:08
  • 90

The Suspects(POJ-1611)

Description Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, w...
  • qq_36949416
  • qq_36949416
  • 2017-05-20 21:10:22
  • 58

poj-1611 The Suspects

Description Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, w...
  • chAngE_AC
  • chAngE_AC
  • 2015-08-10 19:44:50
  • 224

POJ-1611 并查集-The Suspects

Description Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, w...
  • geekword
  • geekword
  • 2016-08-10 17:25:56
  • 203

POJ-1611 The Suspects(并查集)

The Suspects Time Limit:1000MS     Memory Limit:20000KB     64bit IO Format:%lld & %llu Submit S...
  • qaz135135135
  • qaz135135135
  • 2016-08-01 15:11:24
  • 162

POJ-1611 The Suspects (并查集)

The Suspects Time Limit: 1000MS   Memory Limit: 20000K Total Submissions: 33264   Accepted: 16...
  • lu_1110
  • lu_1110
  • 2016-08-01 14:27:17
  • 93

POJ-1611 The Suspects (并查集模板题)

点击查看原题 这也是一道试模板的题 题目大意:有一种传染病,默认一个团体内有一个患病者就全部认为患病,0号默认患病,问有多少患病人员。 没什么好说的直接上模板#include #include ...
  • HHH_go_
  • HHH_go_
  • 2017-01-13 16:24:41
  • 255
收藏助手
不良信息举报
您举报文章:POJ-1611 The Suspects
举报原因:
原因补充:

(最多只允许输入30个字)