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 "iostream"

#include "algorithm"

using namespace std;

const int maxn=1010;

int n;

int father[maxn];

int h[maxn];

int group[maxn]={0};

 

int findfather(int x){

    while (x!=father[x]) {

        x=father[x];

    }

    return x;

}

 

void Union(int a,int b){

    int fa=findfather(a);

    int fb=findfather(b);

    father[fa]=fb;

}

 

bool comp(int a,int b){

    return a>b;

}

 

int main(){

    scanf("%d",&n);

    for (int i=0; i<n; i++) {

        father[i]=i;

    }

    for (int i=0; i<maxn; i++) {

        h[i]=-1;

    }

    for (int i=0; i<n; i++) {

        int number;

        scanf("%d: ",&number);

        for (int j=0; j<number; j++) {

            int hobby;

            scanf("%d",&hobby);

            if (h[hobby]==-1) {

                h[hobby]=i;

            }

            else {

                Union(h[hobby], i);

            }

        }

    }

    for (int i=0; i<n; i++) {

        group[findfather(i)]++;

    }

    int sum=0;

    for(int i=0;i<n;i++){

        if (group[i]!=0) {

            sum++;

        }

    }

    printf("%d\n",sum);

    sort(group, group+n,comp);

    for (int i=0; i<n; i++) {

        if (group[i]!=0) {

            printf("%d",group[i]);

            sum--;

            if (sum!=0) {

                printf(" ");

            }

        }

    }

}