The Suspects POJ-1611 (AL - 1 - 1 - E)
来源:互联网 发布:天津蜂鸟网络怎么样 编辑:程序博客网 时间:2024/06/17 13:19
The Suspects
Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 13311 Accepted: 6297
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题意:
需找SARS病毒感染者嫌疑人数,凡与感染者0号同学有同组( 连带,会传染)关系的皆为嫌疑人。
分析:
基础并查集应用,将所有同属一大组的同学合并。
#include<cstdio>#include<cstdlib>#include<cmath>#include<algorithm>#include<cstring>using namespace std;const int MAXN = 30000;int par[MAXN + 5];int Rank[MAXN + 5];int s[MAXN + 5];void init (int n){ for(int i = 0; i < n;i++) { par[i] = i; Rank[i] = 1; }}int Find(int x){ if(par[x] == x) { return x; } else { return par[x] = Find(par[x]); }}void unite(int x,int y){ x = Find(x); y = Find(y); // printf(" %d %d\n",x,y); if(x == y)return; else { par[y] = x; Rank[x] = Rank[x] + Rank[y]; }}int main(){ int n,m; while(~scanf("%d %d",&n,&m)) { if(n == 0&&m == 0)break;; int k; init(n); for(int l = 0;l < m;l++) { scanf("%d",&k); for(int i = 0;i < k;i++) { scanf("%d",&s[i]); } for(int i = 0;i < k - 1;i++) { unite(s[i],s[i+1]); } } int a = Find(0); printf("%d\n",Rank[a]); }}
0 0
- The Suspects POJ-1611 (AL - 1 - 1 - E)
- POJ 1611 The Suspects
- poj 1611 The Suspects
- poj 1611 The Suspects
- POJ 1611 The Suspects
- POJ-1611 The Suspects
- POJ 1611 The Suspects
- poj 1611 The Suspects
- POJ 1611 The Suspects
- poj 1611 The Suspects
- POJ 1611 - The Suspects
- POJ 1611 The Suspects
- Poj 1611 The Suspects
- POJ 1611 The Suspects
- poj 1611 The Suspects
- POJ 1611 The Suspects
- POJ 1611 The Suspects
- poj 1611 the suspects
- java虚拟机疑问与解答
- 微信小程序支付源码 Demo 后台服务端代码
- 51单片机汇编延时分析:
- Android中自动跳转到系统设置界面
- 2017-02-11 构造可靠数据传输协议、滑动窗口协议、比特交替协议、回退N步协议、选择重传协议
- The Suspects POJ-1611 (AL - 1 - 1 - E)
- 深度优先搜索和深度优先搜索的区别
- UML九种图之静态图
- linux启动tomcat -bash: ./startup.sh: Permission denied
- 通过RevitAPI创建可下拉的按钮
- poj3273——Monthly Expense(二分)
- Hive的UDAF
- (转)李迅雷:相信奇迹还是相信逻辑
- 二叉排序树