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

大意：社交网络中有n个人，每个人有k个爱好，同一个爱好的人在一起形成一个圈子，问网络中一共有多少圈子？按照圈子人数从多到少输出。

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

vector<int> isroot, father;

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

int findfather(int x)
{
	//第一种写法：
	if (x==father[x])
	{
		return x;
	}
	return father[x] = findfather(father[x]);//路径压缩

	//第二种写法：
	/*int a = x;
	while (x!=father[x])
	{
		x = father[x];
	}
	while (a!=father[a])//路径压缩
	{
		int z = a;
		a = father[a];
		father[z] = x;
	}
	return x;*/
}

void Union(int a,int b)
{
	int fa = findfather(a);
	int fb = findfather(b);
	if (fa!=fb)
	{
		father[fa] = fb;
	}
}

int main()
{
	freopen("in.txt", "r", stdin);
	int n,k,t,cnt=0;
	int course[1001] = { 0 };
	cin >> 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++)
		{
			cin >> t;
			if (course[t] ==0)
			{
				course[t] = i;
			}
			Union(i, findfather(course[t]));
		}
	}
	for (int i = 1; i <= n; i++)
	{
		isroot[findfather(i)]++;
	}
	for (int i = 1; i <= n; i++)
	{
		if (isroot[i]!=0)
		{
			cnt++;
		}
	}
	cout << cnt << endl;
	sort(isroot.begin(), isroot.end(), cmp);
	cout << isroot[0];
	for (int i = 1; i < cnt; i++)
	{
		cout << " " << isroot[i];
	}

	/*for (int i = 0; i < cnt; i++)
	{
		if (i!=0)
		{
			cout << " ";
		}
		cout << isroot[i];
	}*/
	cout << endl;
	return 0;
}

二刷：

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

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

vector<int> father, isroot;

int findfather(int x)
{
	//return x == father[x] ? x : (father[x]=findfather(father[x]));
	while (x!=father[x])
	{
		x = father[x];
	}
	return x;
}

void Union(int a, int b)
{
	int fa = findfather(a),fb=findfather(b);
	if (fa!=fb)
	{
		father[fa] = fb;
	}	
}

int main()
{
	//freopen("in.txt", "r", stdin);
	int n, k, course[10001] = { 0 };
	cin >> 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++)
	{
		int k;
		scanf("%d:", &k);
		for (int j = 0; j < k; j++)
		{
			int h;
			cin >> h;
			if (course[h]==0)
			{
				course[h] = i;
			}
			Union(i, findfather(course[h]));
		}
	}
	for (int i = 1; i <= n; i++)
	{
		isroot[findfather(i)]++;
	}
	int cnt = 0;
	for (auto c : isroot)
	{
		if (c!=0)
		{
			cnt++;
		}
	}
	cout << cnt << endl;
	sort(isroot.begin(), isroot.end(), cmp);
	cout << isroot[0];
	for (int i = 1; i <= cnt-1; i++)
	{
		cout << " " << isroot[i];
	}
	cout << endl;
	return 0;
}