The Suspects
来源:互联网 发布:iphone剪辑音乐软件 编辑:程序博客网 时间:2024/06/08 06:12
http://poj.org/problem?id=1611
The Suspects
Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 28641 Accepted: 13954
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 <cstdio>const int N=30000;int total[N+10];//存当前点的这棵树节点个数,并查集还可以很快查询树的节点个数int parent[N+10];int root(int a){ if(parent[a]==a)return a; else return parent[a]=root(parent[a]);}void Merge(int x,int y){ int fx=root(x); int fy=root(y); if(fx==fy)return; total[fx]+=total[fy]; parent[fy]=fx;}int main(){ int n,m; while(scanf("%d%d",&n,&m)!=EOF){ if(n==0&&m==0)break; for(int i=0;i<n;i++){ total[i]=1; parent[i]=i; } for(int i=0;i<m;i++){ int num,x,y; scanf("%d",&num); if(num!=0)scanf("%d",&y); for(int j=1;j<num;j++){ scanf("%d",&x); Merge(x,y); } } printf("%d\n",total[root(0)]); } return 0;}
0 0
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- hdu5112
- hdoj 1495 (bfs())(非常可乐)
- Android M新特性Doze and App Standby模式详解
- Python小结,和java的区别
- NSTimer注意点
- The Suspects
- android 应用之listview添加radiobutton,获取textView
- 单链表的创建+ 求表长+ 查找+插入+删除
- 手动编译hadoop2.6.2
- java二叉树的实现
- iOS7中计算UILabel中字符串的高度
- Android中ListView与RadioButton结合----自定义单选列表
- (译) JSON-RPC 2.0 规范(中文版)
- Linux IPC实践--System V信号量(2)