POj1611:The Suspects(并查集)
2017-02-11 14:08
369 查看
The Suspects
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.
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
Source
Asia Kaohsiung 2003
题意:有N个人编号为0~n-1,有m个社团,每个社团k人,其中0号学生有非典,认为0号学生所在社团的人都被感染,且这些学生所在的其他社团的人也被感染,求总感染人数。
# include <stdio.h>
int pre[30001], num[30001];
int find(int x)
{
if(x != pre[x])
pre[x] = find(pre[x]);//路径压缩,降低树的高度。
return pre[x];
}
int main()
{
int n, m, k, x, y;
while(~scanf("%d%d",&n,&m),n+m)
{
for(int i=0; i<n; ++i)
{
pre[i] = i;
num[i] = 1;
}
while(m--)
{
scanf("%d",&k);
if(k)
scanf("%d",&x);
for(int i=1; i<k; ++i)
{
scanf("%d",&y);
int px = find(x);
int py = find(y);
if(px != py)
{
pre[px] = py;
num[py] += num[px];//根节点数据合并
}
}
}
printf("%d\n",num[find(0)]);
}
return 0;
}
Time Limit: 1000MS | Memory Limit: 20000K | |
Total Submissions: 35813 | Accepted: 17399 |
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
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
Source
Asia Kaohsiung 2003
题意:有N个人编号为0~n-1,有m个社团,每个社团k人,其中0号学生有非典,认为0号学生所在社团的人都被感染,且这些学生所在的其他社团的人也被感染,求总感染人数。
# include <stdio.h>
int pre[30001], num[30001];
int find(int x)
{
if(x != pre[x])
pre[x] = find(pre[x]);//路径压缩,降低树的高度。
return pre[x];
}
int main()
{
int n, m, k, x, y;
while(~scanf("%d%d",&n,&m),n+m)
{
for(int i=0; i<n; ++i)
{
pre[i] = i;
num[i] = 1;
}
while(m--)
{
scanf("%d",&k);
if(k)
scanf("%d",&x);
for(int i=1; i<k; ++i)
{
scanf("%d",&y);
int px = find(x);
int py = find(y);
if(px != py)
{
pre[px] = py;
num[py] += num[px];//根节点数据合并
}
}
}
printf("%d\n",num[find(0)]);
}
return 0;
}
相关文章推荐
- [POJ1611]The Suspects(并查集)
- POJ1611(The Suspects)又见并查集
- poj1611 The Suspects (并查集)
- POJ1611 The Suspects(并查集)
- poj1611 the suspects(并查集)
- POJ1611 The Suspects(并查集)
- 【POJ1611】The Suspects(并查集)
- poj1611(The Suspects)-并查集基础题
- poj1611 The Suspects(基础并查集)
- poj1611 简单并查集
- POJ 1611 The Suspects (并查集)
- POJ1611 The Suspects (并查集)
- kuangbin专题五 并查集 POJ-1611 The Suspects
- 并查集—B - The Suspects
- POJ 1611 The Suspects(并查集)
- Poj 1611 The Suspects(并查集
- 【遇到SARS不要慌,让我们找到谁是可疑感染者!!】 并查集--poj1611
- 简单并查集之按秩合并——The Suspects
- POJ1611 The Suspects 种类并查集
- 【POJ1611】【The Suspects】【并查集水题】【增加一个num[]记录数量】