【poj1611】The Suspects 【Asia Kaohsiung 2003】
来源:互联网 发布:网络直播危害的事例 编辑:程序博客网 时间:2024/05/17 02:12
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
这道题是一个简单的并查集,只需要在普通的并查集上加一个sum数组记录当前节点所处的树的节点个数就可以了,下面是程序:
#include<stdio.h>#include<iostream>using namespace std;const int N=30005;int f[N],sum[N],n,m;int findf(int u){return f[u]==u?u:findf(f[u]);}void Union(int u,int v){int x=findf(u),y=findf(v);if(x!=y){f[x]=y;sum[y]+=sum[x];}}void work(){int i,k,x,y;for(i=0;i<=n;i++){f[i]=i;sum[i]=1; }while(m--){scanf("%d%d",&k,&x);for(i=1;i<k;i++){scanf("%d",&y);Union(x,y);x=y;}}printf("%d\n",sum[findf(0)]);}int main(){while(scanf("%d%d",&n,&m)!=EOF){if(!n&&!m){break;}if(!m){printf("1\n");continue;}work();}return 0;}
阅读全文
0 0
- 【poj1611】The Suspects 【Asia Kaohsiung 2003】
- The Suspects POJ1611
- POJ1611:The Suspects
- POJ1611 The Suspects
- poj1611 The Suspects
- POJ1611 The Suspects
- POJ1611:The Suspects
- POJ1611-The Suspects-ACM
- POJ1611---The Suspects
- poj1611 - The Suspects
- poj1611 The Suspects
- 【POJ1611】The Suspects
- poj1611 The Suspects
- POJ1611 The Suspects
- The Suspects<poj1611>
- poj1611 -- The Suspects
- POJ1611-The Suspects
- poj1611 - The Suspects
- 【opengl函数】glFeedbackBuffer
- 1.7 C# 属性以及参数传递
- 集训第三天(2017/8/2):继续刷搜索题
- [编程题] 序列和
- 用AppleDoc来生成一份你的文档吧
- 【poj1611】The Suspects 【Asia Kaohsiung 2003】
- C++设计模式 -> 创建型 -> 抽象工厂(Abstract Factory)
- Linux之find命令详解
- 现代前端技术解析:现代前端交互框架
- Android基础:异步消息处理机制Handler
- Android 对ListView和RecyclerView的两个BaseAdapter封装分享
- 翻译:Distributed Representations of Words and Phrases and their Compositionality
- iOS 测试 SwiftMonkey :iOS 上的 monkey
- hdu4597