PAT 1107 Social Clusters （30 分）

最新推荐文章于 2021-09-06 17:09:04 发布

原创最新推荐文章于 2021-09-06 17:09:04 发布 · 430 阅读

1 ·

CC 4.0 BY-SA版权

PAT-A 专栏收录该内容

81 篇文章

订阅专栏

本文深入探讨了并查集算法的实现与应用，通过具体的代码示例，详细讲解了如何使用并查集解决群组划分问题，包括初始化、查找根节点、合并群组等关键步骤。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

在这里插入图片描述

解析

#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
const int maxn = 1010;
int hobby[maxn]{0};
bool isroot[maxn]{ false };
int findFather(int x) {
	if (x == hobby[x])    //father
		return x;
	else
		return hobby[x] = findFather(hobby[x]);
}
void Union(int a, int b) {
	int fa = findFather(a);
	int fb = findFather(b);
	if (fa != fb) 
		hobby[fa] = fb; //let fa`s father is fb
}
int main()
{
	for (int i = 0; i < maxn; i++) 
		hobby[i] = i;   //set i`s father is itself
	int N;
	scanf("%d", &N);
	vector<int> people(N+1);
	for (int i = 0; i < N; i++) {
		int K;
		scanf("%d:", &K);
		vector<int> clust(K);
		for (int j = 0; j < K; j++) {
			scanf("%d", &clust[j]);
		}
		people[i + 1] = clust[0];
		if (K >= 1) {
			for (int j = 1; j < K; j++)
				Union(clust[j], clust[j - 1]);
		}
	}
	for (int i = 0; i < N; i++) {
		people[i + 1] = findFather(people[i + 1]);
		isroot[people[i + 1]] = true;
	}
	vector<int> Cluster;
	for (int i = 0; i < maxn; i++) {
		if (isroot[i] == true)
			Cluster.push_back(count(people.cbegin(), people.cend(), i));
	}
	sort(Cluster.begin(), Cluster.end());
	printf("%d\n", Cluster.size());
	for (auto it = Cluster.crbegin(); it != Cluster.crend(); it++)
		printf("%d%c", *it,it+1==Cluster.crend()?'\n':' ');
}