The Suspects(POJ 1611 并查集)
2016-03-11 11:13
429 查看
The Suspects
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
Sample Output
Time Limit: 1000MS | Memory Limit: 20000K | |
Total Submissions: 30158 | Accepted: 14665 |
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 //n个学生,m个分组 2 1 2 //该分组k人,分别... 5 10 13 11 12 14 2 0 1 2 99 2 //假如0感染后,哪些人也会被感染或间接感染 200 2 1 5 5 1 2 3 4 5 1 0 0 0
Sample Output
4 1 1
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; #define Max 30005 int par[Max],num[Max]; int find(int x) { if(par[x]!=x) return par[x]=find(par[x]); return par[x]; } void unite(int x,int y) { x=find(x); y=find(y); if(x!=y) { par[x]=y; num[y]+=num[x]; } return; } int main() { int n,m; int a,b,k; int i,j; freopen("in.txt","r",stdin); while(scanf("%d%d",&n,&m)) { if(n==0&&m==0) break; for(i=0;i<Max;i++) { par[i]=i; num[i]=1; } for(i=0;i<m;i++) { scanf("%d",&k); for(j=0;j<k;j++) { if(j==0) scanf("%d",&a); else { scanf("%d",&b); unite(a,b); } } } printf("%d\n",num[find(0)]); } }
相关文章推荐
- 如何保护 .NET 应用的安全?
- 小css
- 【Unity】关于游戏中的暂停
- 字符串按字典排序
- Swift 登录页面跳转,条件判断 ,页面跳转
- verilog实现uart:发送机部分(详细注释+仿真结果)
- 部署MongoDB Replica Set同时给数据库设置用户名密码
- 如何保护 .NET 应用的安全?
- 二维码
- Android逆向---Fiddler简易使用教程之配置环境(1)
- 【js】js中的隐藏对象arguments,caller,callee
- Swift2.1关键字 @noescape介绍
- C++第一次试验——循环
- yii2随笔(五):mysql 防注入 实现 mysql_real_escape_string 功能
- 22. Generate Parentheses
- 263. Ugly Number
- DoTween小结
- Java计算程序运行时间
- 实现ListView的弹性效果,下拉隐藏ToolBar(ActionBar),上拉显示ToolBar
- HttpClient使用详解