PAT A1107 Social Clusters +并查集

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

代码：

#include <algorithm>
#include <cstdio>
#include <iostream>

using namespace std;

const int maxn=1010;

int father[maxn];
int isRoot[maxn]={0};
int course[maxn]={0}; //course[h]表示喜欢hobbyh的人编号

int n;

void init(){
    for(int i=1;i<=n;i++){
        father[i]=i;
        isRoot[i]=0;
    }
}

int findFather(int x){
    int a=x;
    while(x!=father[x]){
        x=father[x];
    }

    //路径压缩
    while(a!=father[a]){
        int z=father[a];
        father[a]=x;
        a=z;
    }
    return x;
}

void Union(int a,int b){
    int aF=findFather(a);
    int bF=findFather(b);
    if(aF!=bF){
        father[aF]=bF;
    }
}

bool cmp(int a,int b){
    return a>b;
}

int main(){
    cin >> n;
    init();
    int num,h;


    for(int i=1;i<=n;i++){
        scanf("%d:",&num);
        for(int j=0;j<num;j++){
            scanf("%d",&h);
            if(course[h]==0){  //h还没人喜欢过
                course[h]=i;
            }
            Union(i,course[h]);  //把新人i和同样喜欢h的人合并一组
        }
    }

    //记录每组人数
    for(int i=1;i<=n;i++){
        isRoot[findFather(i)]++;
    }

    //人数不为0即有一组
    int ans=0;
    for(int i=1;i<=n;i++){
        if(isRoot[i]!=0)
            ans++;
    }

    //人数由大到小输出
    sort(isRoot+1,isRoot+1+n,cmp);
    cout << ans << endl;
    for(int i=1;i<=ans;i++){
        printf("%d",isRoot[i]);
        if(i!=ans)
            printf(" ");
    }
}