POJ 1611 The Suspects 并查集
来源:互联网 发布:相信命运知乎 编辑:程序博客网 时间:2024/06/14 13:29
The Suspects
Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 21661 Accepted: 10488
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.
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.
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 42 1 25 10 13 11 12 142 0 12 99 2200 21 55 1 2 3 4 51 00 0
Sample Output
411
#include<iostream>#include<cstring>using namespace std;int f[30005];int a[30005];int find(int x){return f[x] == x ? x : f[x] == find(f[x]);}int main(){int n,m;while(cin>>n>>m){if(n==0 && m==0) break;if(m==0) {cout<<1<<endl;continue;}int i;for(i=0;i<=n;i++){f[i]=i;a[i]=0;}int k,p=0;while(m--){cin>>k;for(i=p;i<k+p;i++){cin>>a[i];f[find(a[i])]=find(a[p]);}p+=k;}int sum=0;for(i=0;i<n;i++){if(find(i)==find(0))sum++;}cout<<sum<<endl;}return 0;}
0 0
- POJ 1611 The Suspects(并查集)
- poj 1611 The Suspects 并查集
- POJ 1611 The Suspects 并查集
- poj 1611 The Suspects(并查集)
- POJ 1611 The Suspects 并查集
- POJ--1611--The Suspects【并查集】
- poj 1611-The Suspects:并查集
- POJ--1611 -- The Suspects [并查集]
- poj 1611 - The Suspects(并查集)
- poj 1611The Suspects 并查集
- poj 1611 The Suspects 并查集
- [并查集]POJ 1611 The Suspects
- poj 1611 The Suspects --- 并查集
- POJ 1611 The Suspects (并查集)
- POJ 1611 The Suspects(并查集)
- POJ 1611--The Suspects 并查集
- POJ 1611 The Suspects 并查集
- poj 1611 The Suspects(并查集)
- 删除表的记录以后,如何使新记录的编号仍然从1开始
- 指针类型和指针
- Makefile讲义(3)——书写规则
- 看了那么多人的励志故事,我才刚刚开始。。。
- Arrays and Pointers部分
- POJ 1611 The Suspects 并查集
- How can I put a ListView into a ScrollView without it collapsing?
- 7-1. 换个格式输出整数
- df与du命令输出区别
- 水处理过滤器:自清洗过滤器应用范围
- OC中多线程的一些概念
- Codeforces 448A Rewards
- 软件考试报名相关
- Java安全机制之泛型(JDK1.5)