POJ 1611 The Suspects
2016-01-15 20:01
288 查看
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
Source
Asia Kaohsiung 2003
折腾了我很久_(:з」∠)_
并查集,但是要用压缩路径。依旧是暂时没法理解为甚那么写直接死记。
思路是按着别人的,依旧是自己没想出来。
Time Limit: 1000MS | Memory Limit: 20000K | |
Total Submissions: 29222 | Accepted: 14229 |
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<stdio.h> int per[33333]; int hehe[33333]; int Find(int x) { int i,j,r; r=x;i=x; while(r!=per[r]) r=per[r]; while(per[i]!=r) { j=per[i]; per[i]=r; i=j; } return r; } void Merge(int x,int y) { int fx=Find(x); int fy=Find(y); if(fx!=fy) per[fx]=fy; } int main() { int n,m,i,t; while(scanf("%d%d",&n,&m),n||m) { for(i=0;i<n;i++) per[i]=i; while(m--) { scanf("%d",&t); for(i=0;i<t;i++) scanf("%d",&hehe[i]); if(t>=2) { for(i=1;i<t;i++) Merge(hehe[i-1],hehe[i]); } } int root=Find(per[0]); int ans=0; for(i=0;i<n;i++) { if(root==Find(per[i])) ans++; } printf("%d\n",ans); } return 0; }
相关文章推荐
- canvas--绘制路径
- LightOJ1348 树链剖分
- Max-heap && Min-heap && push_heap
- FZU2082树链剖分
- leetcode--Search a 2D Matrix
- ssh能够连接而sftp不能连接的解决方法
- 怎样理解最小二乘法原理及其用途
- POJ 1287 Networking
- 位运算函数实现float型变量取整数位
- Java对象的强、软、弱和虚引用原理+结合ReferenceQueue对象构造Java对象的高速缓存器
- Windows 下使用命令行编译C/C++文件
- HYSBZ1036 树链剖分
- 【手把手教你全文检索】Lucene索引的【增、删、改、查】
- Android AppWidget控制手机上网APN接入点
- Mysql 中 if 的 用法
- Codeforces Round #339 (Div. 2) B. Gena's Code 水题
- poj3237 树链剖分 暴力
- hdu2548 两军交锋
- Linux驱动Platform总线模型
- LeetCode_HappyNumber_哈希表的使用