1107 Social Clusters (30分)

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] … 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<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int N=1010;
int n;
int p[N];
vector<int> m[N];
int ans[N];
int res;

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

int main(){
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        int k;
        scanf("%d:",&k);
        for(int j=0;j<k;j++){
            int t;
            scanf("%d",&t);
            m[t].push_back(i+1);
        }
    }
    
    for(int i=1;i<=n;i++) p[i]=i;
    
    for(int i=1;i<=1000;i++){
        for(int j=1;j<m[i].size();j++)
        {
            p[find(m[i][0])]=find(m[i][j]);
        }
    }
    
    for(int i=1;i<=n;i++) ans[find(i)]++;
    
    sort(ans+1,ans+n+1,greater<int>());
    int i=1;
    while(ans[i]>0){
        res++;
        i++;
    } 
    
    cout << res<< endl;
    for(int i=1;i<=res;i++){
        if(i!=1)
            printf(" ");
        printf("%d",ans[i]);
    }
    
    return 0;
}