POJ 1611 并查集
2018-01-30 23:29
211 查看
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.
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.
Output
For each case, output the number of suspects in one line.
Sample Input
Sample Output
并查集求子集元素个数。
#include <iostream>
#include <cstdio>
#include <cstring>
#define maxn 50005
using namespace std;
int d,num[maxn],a[maxn],pre[maxn];
int find(int x)
{
int r=x;
while(r!=pre[r])
{
r=pre[r];
}
return r;
}
void join(int x,int y)
{
int r1,r2;
r1=find(x);
r2=find(y);
if(r1!=r2)
{
pre[r1]=r2;
num[r2]+=num[r1];
}
}
int main()
{
int n,m;
while(~scanf("%d%d",&n,&m)&&n+m)
{
if(m==0)
{
printf("1\n");
}
for(int i=0;i<n;i++)
{
pre[i]=i;
num[i]=1;
}
int t;
for(int i=0;i<m;i++)
{
scanf("%d",&t);
for(int j=0;j<t;j++)
scanf("%d",&a[j]);
for(int j=0;j<t-1;j++)
join(a[j],a[j+1]);
}
int k=find(0);
printf("%d\n",num[k]);
}
return 0;
}
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.
Output
For each case, output the number of suspects in one line.
Sample Input
100 4 2 1 2 5 10 13 11 12 14 2 0 1 2 99 2 200 2 1 5 5 1 2 3 4 5 1 0 0 0
Sample Output
4 1 1
并查集求子集元素个数。
#include <iostream>
#include <cstdio>
#include <cstring>
#define maxn 50005
using namespace std;
int d,num[maxn],a[maxn],pre[maxn];
int find(int x)
{
int r=x;
while(r!=pre[r])
{
r=pre[r];
}
return r;
}
void join(int x,int y)
{
int r1,r2;
r1=find(x);
r2=find(y);
if(r1!=r2)
{
pre[r1]=r2;
num[r2]+=num[r1];
}
}
int main()
{
int n,m;
while(~scanf("%d%d",&n,&m)&&n+m)
{
if(m==0)
{
printf("1\n");
}
for(int i=0;i<n;i++)
{
pre[i]=i;
num[i]=1;
}
int t;
for(int i=0;i<m;i++)
{
scanf("%d",&t);
for(int j=0;j<t;j++)
scanf("%d",&a[j]);
for(int j=0;j<t-1;j++)
join(a[j],a[j+1]);
}
int k=find(0);
printf("%d\n",num[k]);
}
return 0;
}
相关文章推荐
- poj 1611 并查集(需要隔离的人数)
- POJ_1611(并查集应用)
- POJ 1611-The Suspects【并查集】
- poj1611(并查集)
- POJ 1611 The Suspects (并查集)
- POJ 1611 The Suspects (并查集)
- POJ 1611 并查集详解+基础应用
- 【并查集】poj 1611 The Suspects
- poj-2236 Wireless Network &&poj-1611 The Suspects && poj-2524 Ubiquitous Religions (基础并查集)
- poj 1611 The Suspects // hoj 1564 The Suspects 并查集
- poj 1611 The Suspects 并查集
- poj1611 The Suspects 并查集_小优化
- POJ 1611 ACM数据结构The Suspects (并查集)
- POJ1611(并查集)
- poj1611(并查集)
- POJ 1611 The Suspects【并查集】
- POJ-1611-The Suspects(并查集)
- poj 1611(并查集)
- 3.27 三二 B POJ 1611 SARS 并查集
- 【并查集】POJ 1611 The Suspects