1107 Social Clusters （30 分）--PAT甲级

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

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

找出具有部分相同爱好的人的集合。
考查并查集。father[]保存每个结点的父亲结点，num[]保存所有根结点所在集合的大小，hoppy[]保存第i个爱好被第几号人喜欢。

#include <iostream>
#include<cstdio>
#include <algorithm>
using namespace std;
const int maxn=1010;
int father[maxn];
int num[maxn];
int hoppy[maxn];
int findfather(int n){
    return n==father[n]?n:findfather(father[n]);
}
void Union(int a,int b){
    int fa=findfather(a);
    int fb=findfather(b);
    if(fa!=fb){
        father[fb]=fa;
    }
}
bool cmp(int a,int b){
    return a>b;
}

int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        father[i]=i;
    }
    for(int i=1;i<=n;i++){
        int sum;
        scanf("%d: ",&sum);
        for(int j=0;j<sum;j++){
            int t;
            scanf("%d",&t);
            if(hoppy[t]==0) hoppy[t]=i;//还没人喜欢
            else Union(hoppy[t],i);//已有人喜欢，合并他们
        }
    }
    int cnt=0;
    for(int i=1;i<=n;i++){
        int fa=findfather(i);
        if(fa==i) cnt++;
        num[fa]++;
    }
    sort(num+1,num+n+1,cmp);
    printf("%d\n",cnt);
    for(int i=1;i<=n;i++){
        if(num[i]==0) break;
        if(i==1) printf("%d",num[i]);
        else printf(" %d",num[i]);
    }
    return 0;
}