poj The Suspects(并查集)
来源:互联网 发布:拖延症 知乎 编辑:程序博客网 时间:2024/06/03 22:53
The Suspects
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.
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.
For each case, output the number of suspects in one line.
100 42 1 25 10 13 11 12 142 0 12 99 2200 21 55 1 2 3 4 51 00 0
411代码:
#include<stdio.h>const int maxn=30000+10;int pre[maxn],n;void init(){ for(int i=0;i<n;++i) pre[i]=i;}int Find(int x){ return x==pre[x]?x:pre[x]=Find(pre[x]);}void join(int x,int y){ int fx=Find(x),fy=Find(y); if(fx!=fy) pre[fy]=fx;}int main(){ int m; while(~scanf("%d%d",&n,&m),m||n) { init(); int i,j,k,a,b; for(i=0;i<m;i++) { scanf("%d",&k); if(!k) continue; scanf("%d",&a); for(j=1;j<k;j++) { scanf("%d",&b); join(a,b); } } a=Find(0); int ans=1; for(i=1;i<n;i++) if(a==Find(i))//寻找掌门为Find(0)的伙伴 ans++; printf("%d\n",ans); } return 0;}ps:并查集的基本理解。。
1 0
- poj 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 1611The 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 并查集
- Linux中硬链接与软连接的区别_(转)
- 关于设计(二)设计的方法
- WPF/WinForm在线程中调用提示窗MessageBox阻塞窗口方法
- 1272: [BeiJingWc2008]Gate Of Babylon
- av_opt_set函数族详解
- poj The Suspects(并查集)
- a++与++a及a--和--a的区别
- Mix C and C++
- IIR滤波器间接设计
- 阿里巴巴 JAVA开发手册 内含大量规范,应用范例.涉及数据库,高并发,集合,索引等等大量干货
- 如何计算cuboid的数量
- 关于设计(三)设计存在的意义
- 史上最详细的Android原生APP中添加ReactNative 进行混合开发教程
- 米国总统好声音巅峰对决!