poj 1611(详解)
来源:互联网 发布:php 异步请求 编辑:程序博客网 时间:2024/06/06 10:01
The Suspects
Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 22217 Accepted: 10805
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
AC代码:(代码有详细解释)
#include<iostream>using namespace std;int f[30010],num[30010];int find(int x){ if(x==f[x]) return f[x]; f[x]=find(f[x]); return f[x]; //返回x的父节点}void Union(int x,int y){ int fx=find(x); int fy=find(y); if(fx==fy) return ; if(num[fx]>num[fy]){ //fx作为父节点的节点数多于fy作为父节点的节点数 f[fy]=fx; //fx作为fy的父节点 num[fx]+=num[fy]; //此时fx作为父节点的节点数就要加上fy作为父节点的节点数 } else{ f[fx]=fy; num[fy]+=num[fx]; }}int main(){ int n,m; while(cin>>n>>m){ if(n==m&& m==0) break; int i,j; for(i=0;i<n;i++){ f[i]=i; num[i]=1; //num[i]表示以节点i作为父节点的树共有多少个节点 } int x,y,t; while(m--){ cin>>t; cin>>x; x=find(x); for(int i=1;i<t;i++){ cin>>y; y=find(y); Union(x,y); } } cout<<num[find(0)]<<endl; //输出0的父节点的节点数 } return 0;}
0 0
- poj 1611(详解)
- poj 1942(详解)
- poj 3252(详解)
- poj 1222 高斯消元详解
- poj 2230详解
- POJ 1611 并查集详解+基础应用
- poj 3581 后缀数组 详解
- POJ 1195 树状数组详解
- POJ 3461 Oulipo(KMP详解)
- POJ-2240 Arbitrage(floyd详解)
- poj 1312(详解)棋盘问题
- poj 2096 概率dp详解
- POJ 2709 Painter 贪心详解
- POJ 1741:点分治详解
- poj 2104 主席树 详解
- 单调栈详解 + poj 2796 poj 2559 CF 547B
- POJ 2965详解 (bfs、位运算)
- POJ 3264 Balanced Lineup(RMQ详解)
- 色彩转换
- 有哪些可供Web设计师&开发者消遣的网站?
- 视频帧人脸检测 (I)
- Android Junit测试框架的配置
- How many Fibs?(高精度)
- poj 1611(详解)
- 黑马程序员:银行业务调度系统
- 软件质量度量参考数据表
- zoj2314 Reactor Cooling --- 上下界可行流
- LFS之(1)建立新分区并挂载
- j2ee 实现
- hdu 2191 多重背包
- qqlive播放器下载视频
- 多线程实现生产者消费者问题 详细注释 事件+临界区 信号量+临界区2种方法