平常水题 - The Suspects POJ-1611(并查集)
2017-04-14 15:42
316 查看
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
需找SARS病毒感染者嫌疑人数,凡与感染者0号同学有同组( 连带,会传染)关系的皆为嫌疑人。
分析:
基础并查集应用,将所有同属一大组的同学合并。
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 30005;
int par[MAXN],rank[MAXN],s[MAXN];
void init(int n){
for(int i = 0;i < n;i++){
par[i] = i;
rank[i] = 1;
}
}
int find(int x){
if(par[x] == x) return x;
else return par[x] = find(par[x]);
}
void unite(int x,int y){
x = find(x);
y = find(y);
if(x == y) return;
else{
par[y] = x;
rank[x] = rank[x] + rank[y];
}
}
int main(){
int n,m,k;
while(~scanf("%d%d",&n,&m)){
if(n == 0 && m == 0) return 0;
init(n);
for(int i = 0;i < m;i++){
scanf("%d",&k);
for(int j = 0;j < k;j++) scanf("%d",&s[j]);
for(int j = 0;j < k - 1;j++) unite(s[j],s[j + 1]);
}
printf("%d\n",rank[find(0)]);
}
}
Time Limit: 1000MS | Memory Limit: 20000K | |
Total Submissions: 13311 | Accepted: 6297 |
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题意:
需找SARS病毒感染者嫌疑人数,凡与感染者0号同学有同组( 连带,会传染)关系的皆为嫌疑人。
分析:
基础并查集应用,将所有同属一大组的同学合并。
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 30005;
int par[MAXN],rank[MAXN],s[MAXN];
void init(int n){
for(int i = 0;i < n;i++){
par[i] = i;
rank[i] = 1;
}
}
int find(int x){
if(par[x] == x) return x;
else return par[x] = find(par[x]);
}
void unite(int x,int y){
x = find(x);
y = find(y);
if(x == y) return;
else{
par[y] = x;
rank[x] = rank[x] + rank[y];
}
}
int main(){
int n,m,k;
while(~scanf("%d%d",&n,&m)){
if(n == 0 && m == 0) return 0;
init(n);
for(int i = 0;i < m;i++){
scanf("%d",&k);
for(int j = 0;j < k;j++) scanf("%d",&s[j]);
for(int j = 0;j < k - 1;j++) unite(s[j],s[j + 1]);
}
printf("%d\n",rank[find(0)]);
}
}
相关文章推荐
- The Suspects POJ - 1611 并查集水题
- 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 / ZOJ 1789: The Suspects - 并查集
- poj-2236 Wireless Network &&poj-1611 The Suspects && poj-2524 Ubiquitous Religions (基础并查集)
- 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 // hoj 1564 The Suspects 并查集
- POJ 1611 The Suspects 并查集 Union Find
- poj 1611 The Suspects 并查集变形题目
- POJ 1611 The Suspects 并查集问题
- poj 1611 The Suspects 【并查集基础题】