PAT甲级 1107 Social Clusters

题目简介

When register on a social network, you are always asked to specify your hobbies in order to find some potential friends with the same hobbies. A social cluster is a set of people who have some of their hobbies in common. You are supposed to find all the clusters.

Input Specification:

Each input file contains one test case. For each test case, the first line contains a positive integer N (≤1000), the total number of people in a social network. Hence the people are numbered from 1 to N. Then N lines follow, each gives the hobby list of a person in the format:

$K_i$​: $h_i$​[1] $h_i$​[2] … $h_i$​[Ki​]

where $K_i$​ (>0) is the number of hobbies, and $h_i$​[j] is the index of the j-th hobby, which is an integer in [1, 1000].

Output Specification:

For each case, print in one line the total number of clusters in the network. Then in the second line, print the numbers of people in the clusters in non-increasing order. The numbers must be separated by exactly one space, and there must be no extra space at the end of the line.

Sample Input:

8
3: 2 7 10
1: 4
2: 5 3
1: 4
1: 3
1: 4
4: 6 8 1 5
1: 4

Sample Output:

3
4 3 1

题解

#include<bits/stdc++.h>

int parent[1010] = {0}, hobby[1010] = {0};

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

void Union(int x, int y) {
    int x_root = find(x);
    int y_root = find(y);
    parent[x_root] = y_root;
}

int main() {
    int N;
    std::cin >> N;

    for(int i = 1; i <= N; i++) {
        parent[i] = i;
    }

    int K, hobby_index;
    for(int i = 1; i <= N; i++) {
        scanf("%d: ", &K);
        while(K--) {
            std::cin >> hobby_index;
            if(hobby[hobby_index] == 0) {
                hobby[hobby_index] = i;
            }else {
                Union(i, hobby[hobby_index]);
            }
        }
    }

    std::vector<int> res(N + 1, 0);
    int cnt = 0;
    for(int i = 1; i <= N; i++) {
        if(find(i) == i) cnt++;
        res[find(i)]++;
    }

    std::sort(res.begin(), res.end(), std::greater<int>());
    std::cout << cnt << std::endl;
    for(int i = 0; i < cnt; i++) {
        if(i != cnt - 1)
            std::cout << res[i] << " ";
        else
            std::cout << res[i] << std::endl;
    }

    
    return 0;
}