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<vector>
#include<algorithm>
using namespace std;
int hobby[1001];
vector<int>father, isroot;
int findfather(int root)
{
	int son, tmp;
	son = root;
	while (root != father[root]) root = father[root];
	while (son != root)
	{
		tmp = father[son];
		father[son] = root;
		son = tmp;
	}
	return root;
}
void Union(int a, int b)
{
	int faa = findfather(a);
	int fab = findfather(b);
	if (faa != fab) father[faa] = fab;
}
int main()
{
	int n, k, t, cnt = 0;
	scanf("%d", &n);
	father.resize(n + 1);
	isroot.resize(n + 1);
	for (int i = 1; i <= n; i++) father[i] = i;
	for (int i = 1; i <= n; i++)
	{
		scanf("%d:", &k);
		for (int j = 0; j < k; j++)
		{
			scanf("%d", &t);
			if (hobby[t] == 0) hobby[t] = i;
			Union(i, findfather(hobby[t]));
		}
	}
	for (int i = 1; i <= n; i++) isroot[findfather(i)]++;
	for (int i = 1; i <= n; i++)
	{
		if (isroot[i]) cnt++;
	}
	printf("%d\n", cnt);
	sort(isroot.begin(), isroot.end());
	reverse(isroot.begin(), isroot.end());
	for (int i = 0; i < cnt; i++)
	{
		if (i != 0) printf(" ");
		printf("%d",isroot[i]);
	}
	return 0;
}

后记

最开始看柳神的代码和晴神的代码都觉得不太好懂，后来在网上找了一篇blog这篇博客非常得好！
超有爱的并查集~