The Suspects 并查集

最新推荐文章于 2025-11-24 14:22:58 发布

原创最新推荐文章于 2025-11-24 14:22:58 发布 · 228 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c++ #图论

并查集专栏收录该内容

3 篇文章

订阅专栏

本文介绍了一个编程问题，针对2003年SARS期间如何通过学生社团结构快速识别并隔离疑似病例。你需要编写一个程序，在给定学生群组关系中，找出当某学生被识别为疑似时，所有可能受影响的学生人数。

The Suspects

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
Output
4
1
1

#include <iostream>

using namespace std;

const int N = 30005;

int p[N];
int n, m;

void init(int x) {
    for(int i = 0; i < x; ++i) p[i] = i;
} 

int find(int x) {
    if(p[x] != x) 
        p[x] = find(p[x]);
    return p[x];
}

void merge(int a, int b) {
    p[find(a)] = find(b);
}

int main() {

    while(cin >> n >> m) {
        if(n == 0 && m == 0)
            break;

        init(n);

        while(m--) {
            int k, fa;
            cin >> k >> fa;

            for(int i = 0; i < k - 1; ++i) {
                int t;
                cin >> t;
                merge(fa, t);
            }
        }

        int root = find(0);

        int ans = 1;

        for(int i = 1; i < n; ++i) {
            if(find(i) == root) ans++;
        }

        cout << ans << endl;


    }


    return 0;
}