1107 Social Clusters

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:

Ki: hi[1] hi[2] … hi[Ki]

where Ki (>0) is the number of hobbies, and hi[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<stdio.h>
#include<vector>
#include<algorithm>
#include<string.h>
using namespace std;
int people[1005] = { 0 };
vector<vector<int>>hobbies(1005);
int find(int x){
    int temp = x;
    while (people[temp] != temp){
        temp = people[temp];
    }
    //压缩路径
    while (people[x] != x){
        people[x] = temp;
        x = people[x];
    }
    return temp;
}
void join(int x, int y){
    int tx = find(x);
    int ty = find(y);
    if (tx != ty){
        people[tx] = ty;
    }
}
int main(){
    for (int n; scanf("%d", &n) != EOF;){       
        for (int i = 1; i <= n; i++){
            //顺便初始化人员的标记数组
            people[i] = i;
            int k;
            scanf("%d:",&k);
            while (k--){
                int temp;
                scanf("%d", &temp);
                hobbies[temp].push_back(i);
            }
        }
        for (int i = 1; i < hobbies.size(); i++){
            if (hobbies[i].size()){
                int x = hobbies[i][0];
                for (int j = 1; j < hobbies[i].size(); j++){
                    int y = hobbies[i][j];
                    join(x, y);
                }
            }
        }
        for (int i = 1; i <= n; i++){
            find(i);
        }
        int ans[1005] = { 0 };
        for (int i = 1; i <= n; i++){
            ans[people[i]]++;
        }
        vector<int>group;
        for (int i = 1; i <= n; i++){
            if (ans[i]){
                group.push_back(ans[i]);
            }
        }
        printf("%d\n", group.size());
        sort(group.begin(), group.end());
        printf("%d", group[group.size() - 1]);
        for (int i = 1; i < group.size(); i++){
            printf(" %d", group[group.size() - 1 - i]);
        }
        printf("\n");
    }
    return 0;
}