poj 1611 The Suspects(并查集)

最新推荐文章于 2021-10-22 21:50:22 发布

原创最新推荐文章于 2021-10-22 21:50:22 发布 · 1.2k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

解题报告

数据结构__并查集

本文介绍了一种使用并查集算法解决学生群体中SARS传染问题的方法，通过收集各学生群体成员名单，识别传染源，并确定所有受感染的学生。此算法适用于在特定条件下快速识别传染链。

链接：

http://poj.org/problem?id=1611

题目：

The Suspects

Time Limit: 1000MS		Memory Limit: 20000K
Total Submissions: 15926		Accepted: 7622

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

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

分析与总结：

开始时想复杂了，还以为是种类并查集 = =～，其实就是基础的带数量的并查集。。。

把每组的合并成一个并查集即可，注意如果有0，都指向0。

代码：

#include<cstdio>
#include<cstring>

const int N = 30005;
int n,m,k,f[N],rank[N];

inline void init(){
    for(int i=0; i<=n; ++i)
        f[i]=i, rank[i]=1;
}
int find(int x){
    int i, j=x;
    while(j!=f[j]) j=f[j];
    while(x!=j){
        i=f[x]; f[x]=j; x=i;
    }
    return j;
}
void Union(int x, int y){
    int a=find(x), b=find(y);
    if(a==b) return;
    if(a==0){
        f[b] = a;
        rank[a] += rank[b];
    }
    else{
        f[a] = b;
        rank[b] += rank[a];
    }
}

int main(){
    int u,v;
    while(~scanf("%d%d",&n,&m)&&n+m){
        init();
        int ans=0;
        for(int i=0; i<m; ++i){
            scanf("%d",&k);
            scanf("%d",&u);
            for(int j=1; j<k; ++j){
                scanf("%d",&v);
                Union(u,v);
            }
        }
        printf("%d\n", rank[0]);
    }
    return 0;
}

 
  
     
    ——  生命的意义，在于赋予它意义。
    
     
                
     
     
           原创 http://blog.csdn.net/shuangde800 ， By   D_Double  (转载请标明)