poj-1611
2015-06-18 14:34
274 查看
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: 25286 | Accepted: 12392 |
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个学生,编号为0-N-1,现在0号学生感染了非典,凡是和0在一个社团的人就会感染,并且这些人如果还参加了别的社团,他所在的社团照样全部感染,求感染的人数。找到有多少和0共房间的,也就说和0在一棵树上的#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; int n,m,a,b; int father[30005],num[300005]; void makeset(int n) { for(int i=0;i<n;i++) { father[i]=i; num[i]=1; } } int findset(int x) { return father[x]==x?x:findset(father[x]); } void Union(int a,int b) { int x=findset(a); int y=findset(b); if(x==y) return; if(num[x]<=num[y]) { father[x]=y; num[y]+=num[x]; } else { father[y]=x; num[x]+=num[y]; } } int main() { while(cin>>n>>m&&n) { int count,first,b; makeset(n); for(int i=0;i<m;i++) { scanf("%d%d",&count,&first); for(int j=1;j<count;j++) { scanf("%d",&b); Union(first,b); } } printf("%d\n",num[findset(0)]); } return 0; }
相关文章推荐
- Oracle 中的JOIN
- PHP 排序算法实现讲解
- 递归和迭代之间的差
- 这几天在搞UNITY3D,感觉回到了AS2
- Spring, Hibernate and Oracle Stored Procedures
- ORACLE SQL 行函数
- Class form or html not found in Laravel 5 :
- 并查集
- JavaScript学习总结-技巧、实用函数、简洁方法、编程细节
- Linux下搭建tomcat7和mysql5.6
- oracle故障代码
- cocos2d-x 屏幕适配
- 我是谁
- 【Java线程】锁机制:synchronized、Lock、Condition
- BZOJ 4145 AMPPZ2014 The Prices 状压DP
- iOS 通过constraint 进行autolayout的动画
- AIX下安装GNU make
- 怎么像safari一样滑动的时候隐藏navigationbar?
- ORACLE SQL WHERE和ORDER BY
- C++中正确使用PRId64