POJ 1611 The Suspects(并查集求集合的基数)
来源:互联网 发布:周涵成都书店知乎 编辑:程序博客网 时间:2024/06/05 15:29
The Suspects
Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 38785 Accepted: 18796
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
注意要把pre向小取,因为0才是万恶之源。。
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#define maxn 30010
using namespace std;
int pre[maxn];
int off[maxn];
int fr(int x)
{
int r=x;
while(r!=pre[r])r=pre[r];
int j=x;
while(x!=r)
{
j=pre[x];
pre[x]=j;
x=j;
}
return r;
}
void join(int x,int y)
{
int r1=fr(x);
int r2=fr(y);
if(r1>r2)pre[r1]=r2;
else if(r1<r2)pre[r2]=r1;
}
int n,m;
int t;
int iss[maxn];
int main()
{
int a;
int fir;
while(scanf("%d%d",&n,&m)==2)
{
if(m==0&&n==0)break;
memset(iss,0,sizeof(iss));
for(int i=0;i<n;i++)pre[i]=i;
for(int i=0;i<m;i++)
{
scanf("%d",&t);
scanf("%d",&fir);
for(int i=0;i<t-1;i++)
{
scanf("%d",&a);
join(a,fir);
}
}
int cnt=0;
for(int i=0;i<n;i++)
{
if(fr(i)==0)cnt++;
}
printf("%d\n",cnt);
}
return 0;
}
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#define maxn 30010
using namespace std;
int pre[maxn];
int off[maxn];
int fr(int x)
{
int r=x;
while(r!=pre[r])r=pre[r];
int j=x;
while(x!=r)
{
j=pre[x];
pre[x]=j;
x=j;
}
return r;
}
void join(int x,int y)
{
int r1=fr(x);
int r2=fr(y);
if(r1>r2)pre[r1]=r2;
else if(r1<r2)pre[r2]=r1;
}
int n,m;
int t;
int iss[maxn];
int main()
{
int a;
int fir;
while(scanf("%d%d",&n,&m)==2)
{
if(m==0&&n==0)break;
memset(iss,0,sizeof(iss));
for(int i=0;i<n;i++)pre[i]=i;
for(int i=0;i<m;i++)
{
scanf("%d",&t);
scanf("%d",&fir);
for(int i=0;i<t-1;i++)
{
scanf("%d",&a);
join(a,fir);
}
}
int cnt=0;
for(int i=0;i<n;i++)
{
if(fr(i)==0)cnt++;
}
printf("%d\n",cnt);
}
return 0;
}
阅读全文
0 0
- POJ 1611 The Suspects(并查集求集合的基数)
- poj 1611The Suspects(简单的并查集求集合元素)
- POJ 1611-The Suspects(并查集-同一集合)
- poj-1611The Suspects(并查集求被感染的人数)
- [ACM] POJ 1611 The Suspects (并查集,输出第i个人所在集合的总人数)
- [ACM] POJ 1611 The Suspects (并查集,输出第i个人所在集合的总人数)
- POJ 1611 The Suspects (并查集)不相交集合+合并优化
- The Suspects(POJ 1611)(裸并查集)
- zoj 1789 || poj 1611 The Suspects(并查集)
- POJ 1611 The Suspects (并查集)
- POJ 1611 The Suspects(并查集)
- poj 1611 The Suspects(并查集)
- POJ 1611 The Suspects (并查集)
- POJ 1611 The Suspects (并查集III)
- poj-1611-The Suspects(水并查集)
- POJ 1611 The Suspects(并查集)
- POJ 1611 The Suspects(带权并查集)
- POJ 1611The Suspects(简单并查集)
- java连接多个mongoDB数据库
- RocketMQ(二)集群配置
- Leetcode习题记录—— palindrome和数组求最大的两个数
- 两款高性能并行计算引擎Storm和Spark简单比较
- C/C++动态内存管理
- POJ 1611 The Suspects(并查集求集合的基数)
- 洛谷 P2835 刻录光盘
- 腾讯暑期实习二面
- 关于Html5引用百度地图Api的小功能
- lintcode 比较字符串(Compare Strings ) (Java)
- 类和对象-第六天
- Maven3路程(三)用Maven创建第一个web项目(2)servlet演示
- sklearn.linear_model——梯度提升树(GBDT)调参小结
- CurrentHashMap原理与应用(JDK7版本)