【POJ】1611 The Suspects
2015-11-16 21:18
375 查看
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
分析:基础并查集。
解法一:
#include <iostream>
#include <vector>
using namespace std;
int N,M;
vector<int> par;
vector<int> rank;
void init(int n){
par.clear();
rank.clear();
par.resize(n);
rank.resize(n);
for(int i=0; i<n; i++){
par[i] = i;
rank[i] = 0;
}
}
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;
if(rank[x] < rank[y]){
par[x] = y;
}else{
par[y] = x;
if(rank[x]==rank[y])
rank[x]++;
}
}
bool same(int x, int y){
return find(x)==find(y);
}
int main(){
int i;
while(scanf("%d%d",&N,&M)){
if(N==0 && M==0) break;
init(N);
int num, t;
int first;
for(int j=0; j<M; j++){
scanf("%d",&num);
for(i=0; i<num; i++){
scanf("%d",&t);
if(i==0){
first = t;
}
unite(first,t);
}
}
int cnt = 0;
for(i=0; i<N; i++){
if(same(0,i)){
cnt++;
}
}
printf("%d\n",cnt);
}
return 0;
}
解法二:
#include <iostream>
#include <vector>
using namespace std;
int N,M;
vector<int> par;
vector<int> num;
void init(int n){
par.clear();
num.clear();
par.resize(n);
num.resize(n);
for(int i=0; i<n; i++){
par[i] = i;
num[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;
if(num[x] <= num[y]){
par[x] = y;
num[y] += num[x];
}else if(num[x] > num[y]){
par[y] = x;
num[x] += num[y];
}
}
bool same(int x, int y){
return find(x)==find(y);
}
int main(){
int i;
while(scanf("%d%d",&N,&M)){
if(N==0 && M==0) break;
init(N);
int cnt, t;
int first;
for(int j=0; j<M; j++){
scanf("%d",&cnt);
for(i=0; i<cnt; i++){
scanf("%d",&t);
if(i==0){
first = t;
}
unite(first,t);
}
}
printf("%d\n",num[find(0)]);
}
return 0;
}
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
分析:基础并查集。
解法一:
#include <iostream>
#include <vector>
using namespace std;
int N,M;
vector<int> par;
vector<int> rank;
void init(int n){
par.clear();
rank.clear();
par.resize(n);
rank.resize(n);
for(int i=0; i<n; i++){
par[i] = i;
rank[i] = 0;
}
}
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;
if(rank[x] < rank[y]){
par[x] = y;
}else{
par[y] = x;
if(rank[x]==rank[y])
rank[x]++;
}
}
bool same(int x, int y){
return find(x)==find(y);
}
int main(){
int i;
while(scanf("%d%d",&N,&M)){
if(N==0 && M==0) break;
init(N);
int num, t;
int first;
for(int j=0; j<M; j++){
scanf("%d",&num);
for(i=0; i<num; i++){
scanf("%d",&t);
if(i==0){
first = t;
}
unite(first,t);
}
}
int cnt = 0;
for(i=0; i<N; i++){
if(same(0,i)){
cnt++;
}
}
printf("%d\n",cnt);
}
return 0;
}
解法二:
#include <iostream>
#include <vector>
using namespace std;
int N,M;
vector<int> par;
vector<int> num;
void init(int n){
par.clear();
num.clear();
par.resize(n);
num.resize(n);
for(int i=0; i<n; i++){
par[i] = i;
num[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;
if(num[x] <= num[y]){
par[x] = y;
num[y] += num[x];
}else if(num[x] > num[y]){
par[y] = x;
num[x] += num[y];
}
}
bool same(int x, int y){
return find(x)==find(y);
}
int main(){
int i;
while(scanf("%d%d",&N,&M)){
if(N==0 && M==0) break;
init(N);
int cnt, t;
int first;
for(int j=0; j<M; j++){
scanf("%d",&cnt);
for(i=0; i<cnt; i++){
scanf("%d",&t);
if(i==0){
first = t;
}
unite(first,t);
}
}
printf("%d\n",num[find(0)]);
}
return 0;
}
相关文章推荐
- 初学ACM - 组合数学基础题目PKU 1833
- POJ ACM 1001
- POJ ACM 1002
- POJ 2635 The Embarrassed Cryptographe
- POJ 3292 Semi-prime H-numbers
- POJ 2773 HAPPY 2006
- POJ 3090 Visible Lattice Points
- POJ-2409-Let it Bead&&NYOJ-280-LK的项链
- POJ-1695-Magazine Delivery-dp
- POJ1523 SPF dfs
- POJ-1001 求高精度幂-大数乘法系列
- POJ-1003 Hangover
- POJ-1004 Financial Management
- 用单调栈解决最大连续矩形面积问题
- 2632 Crashing Robots的解决方法
- 1573 Robot Motion (简单题)
- HDU-1213-How Many Tables
- POJ 1200 Crazy Search(简单哈希)
- Longest Consecutive Sequence,Distinct Subsequences,Interleaving String,Scramble String
- 【高手回避】poj3268,一道很水的dijkstra算法题