The Suspects
2016-07-21 18:30
267 查看
A - The Suspects
Time Limit:1000MS Memory Limit:20000KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice POJ
1611
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
这个题可以利用一个并查集,把一个组织的连接在一起,然后看看谁跟0这个人在一颗树上即可。
Time Limit:1000MS Memory Limit:20000KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice POJ
1611
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
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
这个题可以利用一个并查集,把一个组织的连接在一起,然后看看谁跟0这个人在一颗树上即可。
#include <iostream> #include <cstdio> #include <algorithm> using namespace std; int pre[30005]; int n,m; int findx(int x) { int r=x; while(r!=pre[r]) { r=pre[r]; } int k; while(pre[x]!=r) { k=pre[x]; pre[x]=r; x=k; } return r; } void he(int x,int y) { int fx=findx(x); int fy=findx(y); if(fx!=fy)pre[fy]=fx; } int main() { int i,j,k; int x,y; while(~scanf("%d%d",&n,&m)) { if(n==0&&m==0)break; for(i=0;i<n;++i)pre[i]=i; while(m--) { scanf("%d",&k); k--; scanf("%d",&x); while(k--) { scanf("%d",&y); he(x,y); } } int sum=0; for(i=1;i<n;++i)if(findx(i)==findx(0))sum++; printf("%d\n",sum+1); } return 0; }
相关文章推荐
- iOS开发中如遇到频繁的Http请求,如何取消之前已经发送的Http请求?
- 【转载】dts介绍
- css简介及相关概念
- 系列文章之二 用cocos2d-js和pomelo开发MMORPG传奇手游-启动游戏续(一)
- 如何配置vim
- 漫谈 iOS Crash 收集框架
- ng-include
- 相机拍照
- 10340 - All in All
- Linux上安装JDK环境变量配置
- 转帖:30多条mysql数据库优化方法,千万级数据库记录查询轻松解决
- nGrinder安装指南
- jQuery 對table的基本操作
- 5-SQL 函数
- js获取ifram对象
- 详读List,Map源码心得笔记
- PHP按比例生成縮略圖片
- Android源码解析系列
- 粒度的设计
- 遇到的坑