poj 1611 并查集
来源:互联网 发布:河南虫虫网络 编辑:程序博客网 时间:2024/06/07 03:03
The Suspects
Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 18435 Accepted: 8920
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
这是一道裸的并查集的题目,主要是用来熟悉该算法。话不多说,下面是代码:
#include<cstdio>#include<cstdlib>#include<cstring>#include<iostream>#include<cmath>#define maxn 30050using namespace std;int pre[maxn];int n,m;void init(){ for(int i=0;i<n;i++) pre[i]=i;}int find(int x){ int r=x; while(pre[r]!=r) r=pre[r]; int i=x; int j; while(i!=r){ j=pre[i]; pre[i]=r; i=j; } return r;}void join(int a,int b){ int x=find(a),y=find(b); if(x<y) pre[y]=x; else pre[x]=y;}int main(){ int k,t,t1; while(scanf("%d%d",&n,&m)!=EOF){ if(m==0&&n==0) break; init(); int count=0; for(int i=0;i<m;i++){ cin>>k; cin>>t; for(int j=1;j<k;j++){ cin>>t1; join(t,t1); } } for(int i=0;i<n;i++){ if(find(i)==0) count++; } printf("%d\n",count); } return 0;}
- 并查集 POJ 1611
- 【并查集】POJ-1611
- poj 1611(并查集)
- poj 1611 并查集
- poj 1611 并查集
- 【POJ 1611 并查集】
- poj 1611 并查集
- poj 1611(并查集)
- poj-1611 并查集
- POJ 1611 并查集
- poj 1611 并查集
- POJ 1611 (并查集)
- POJ 1611 <并查集>
- poj 1611 并查集
- 并查集 POJ 1611
- POJ 1611 (并查集)
- Poj 并查集
- poj并查集
- Hadoop安装-安装步骤
- 让svn支持https协议的checkout
- android progressdialog 对话框试用实例
- google protocol buffer基础
- 爱因斯坦难题的C语言程序设计
- poj 1611 并查集
- 小米2013年校园招聘笔试题——朋友圈
- Android IM客户端登陆Openfire 之一
- hdu4465 Candy(快速排列组合+概率)
- HDU 1024
- POJ-2352-Stars
- 最受欢迎的8位Java牛人
- 最新县及县以上行政区划代码(截止2013年1月18日) 全国省市县数据库 之县级数据
- 寻找表达式