POJ-1611 The Suspects
来源:互联网 发布:英文小说优美 知乎 编辑:程序博客网 时间:2024/05/21 22:25
The Suspects
Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 36313 Accepted: 17636
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
Source
Asia Kaohsiung 2003
简单模板变式
#include <iostream>#include <stdio.h>using namespace std;#define Maxn 50000+50int pre[Maxn];int n,m;int a,b,c;int temp;int cnt=0;void UF_set(int n){ for(int i=0;i<=n;i++) pre[i]=i;}int find (int x){ int r=x; while(r!=pre[r]) r=pre[r]; int i=x; int j; while(i!=pre[i]){ j=pre[i]; pre[i]=r; i=j; } return r;}void Union(int x,int y){ x=find(x); y=find(y); pre[x]=y;}int main(){ while(~scanf("%d%d",&n,&m)&&(n+m)) { cnt=0; UF_set(n); while(m--) { cin>>a>>b; for(int i=1;i<a;i++) { cin>>c; Union(c,b); } } for(int i=0;i<=n;i++) { if(find(0)==find(i)) cnt++; } cout<<cnt<<endl; }}
0 0
- 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
- POJ 1611 The Suspects
- 使用缓冲功能的BufferedReader和BufferedWriter复制文本文件,按照行读写
- 第一章 多线程的技能
- 时间、空间复杂度
- 你是我的小呀小cookie
- 大数据IMF传奇行动绝密课程第71课:Spark SQL窗口函数解密与实战
- POJ-1611 The Suspects
- SpringMvc Junit4
- Hibernate一级缓存(基于查询分析)
- WebAssembly,Web的新时代
- 通过浏览器打开本地Activity
- 2017.3.4 pat甲级B题Chain the Ropes
- beautifulsoup在windows下的安装
- 斜率优化 【ZJOI 2007】仓库建设 bzoj1096
- 80:Path Sum