PAT-A 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

思路：

祝她爱情事业两开花，然后我失眠了，刷PAT写博客，特此纪念。

如果A和B在一个社交群，B和C在一个社交群，那么A和C也在一个社交群。 

#include <cstdio>
#include <algorithm>

using namespace std;

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

const int maxn = 1010;
int h2p[maxn];
int farther[maxn];
int isRoot[maxn];

int findFarther(int x)
{
    int a = x;
    while(farther[x] != x)
    {
        x = farther[x];
    }

    while(farther[a] != a)
    {
        int  t = farther[a];
        farther[a] = x;
        a = t;
    }
    return x;
}

void unionSets(int a, int b)
{
    int fa = findFarther(a);
    int fb = findFarther(b);
    if(fa != fb)
        farther[fb] = fa;
}

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

int main()
{
    fill(h2p, h2p + maxn, -1);
    int n;
    scanf("%d", &n);
    init(n);
    for(int i = 1; i <= n; i++)
    {
        int k;
        scanf("%d:", &k);
        for(int j = 0; j < k; j++)
        {
            int h;
            scanf("%d", &h);
            if(h2p[h] == -1) // 爱好h第一次有人喜欢
                h2p[h] = i;  // 将喜欢h的人置为当前的i
            else
                unionSets(i, findFarther(h2p[h]));  // 爱好h不是第一次有人喜欢，将i号人合并到喜欢h的人的集合中
        }
    }

    int ans = 0;  // 社交团体的数量
    for(int i = 1; i <= n; i++)
    {
        isRoot[findFarther(i)]++;
        if(findFarther(i) == i)  // 当前是并查集的根节点
            ans++;
    }

    sort(isRoot + 1, isRoot + n + 1, cmp);
    printf("%d\n", ans);
    for(int i = 1; i <= ans; i++)
    {
        if(i != 1)
            printf(" ");
        printf("%d", isRoot[i]);
    }
    printf("\n");
    return 0;
}