1107. Social Clusters (30)

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] … hi[K​i]

where Ki(>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>

using namespace std;

int persHob[1024];

int finds(int x, vector<int> &parents){
    return x == parents[x] ? x: parents[x] = finds(parents[x], parents);
}
int main()
{
    vector<int> parents(1024);
    for(int i = 1; i <= 1000; ++i){
        parents[i] = i;
    }
    int n;
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i){
        int k, fir;
        scanf("%d: %d", &k, &fir);
        persHob[i] = fir;
        --k;
        while(k--){
            int x;
            scanf("%d", &x);
            int L1 = finds(fir, parents);
            int L2 = finds(x, parents);
            if(L1 != L2) parents[L2] = L1;
        }
    }
    map<int, int> cnts;
    for(int i = 1; i <= n; ++i){
        int L = finds(persHob[i], parents);
        cnts[L]++;
    }
    vector<int> res;
    for(auto e: cnts){
        res.push_back(e.second);
    }
    sort(res.begin(), res.end(), greater<int>());
    int sz = res.size();
    printf("%d\n", sz);
    for(int i = 0; i < sz; ++i){
        printf("%d%c", res[i], i == sz - 1 ? '\n' : ' ');
    }
    return 0;
}