POJ【1611】The Suspects
2016-02-02 09:56
363 查看
The Suspects
Time Limit: 1000MS | Memory Limit: 20000K | |
Total Submissions: 29618 | Accepted: 14412 |
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
Source
Asia Kaohsiung 2003
#include <cstdio> #include <cstring> #include <iostream> using namespace std; const int maxn = 30005; int n,m,k; int fa[maxn],total[maxn]; int Find(int x) { if(x != fa[x]) fa[x] = Find(fa[x]); return fa[x]; } void join(int x,int y) { int fx = Find(x),fy = Find(y); if(fx == fy) return ; fa[fx] = fy; total[fy] += total[fx]; } int main() { while(scanf("%d%d",&n,&m) != EOF) { if(!n && !m) break; for(int i = 0; i < n; i++) { total[i] = 1; fa[i] = i; } while(m--) { int h,s; scanf("%d%d",&k,&h); for(int j = 1; j < k; j++) { scanf("%d",&s); join(h,s); } } printf("%d\n",total[Find(0)]);//此处不能用total[fa[0]],因为有可能没有进行路径压缩. } return 0; }
相关文章推荐
- 邮票的背胶
- 博客园—Android客户端
- (8)序列帧动画
- Flash pixel Bender学习笔记
- Retrofit三步理解之二 ------------------ Retrofit的进一步总结
- Qt使用Label控件显示图片的三种方法
- Android 查看手机电池信息
- Core Bluetooth 使用教程
- 苹果产品设计中鲜为人知的10个细节
- Visual Studio调试之断点基础篇
- PL/SQL DEVELOPER执行计划的查看
- 浏览器插件之ActiveX开发-打包插件
- 【spring】切面的配置、实现ApplicationContextAware、实现ApplicationListener
- 谈谈常见的迭代优化方法
- SASS用法指南
- Visual Studio调试之断点进阶篇
- (7)
- tab的简单写法
- JAVA中字符串比较equals()和equalsIgnoreCase()的区别
- IBM的云平台Bluemix使用初体验-创建第一个容器