一看到Cluster就应该想到使用并查集。这题的并查集有些变化,以往都是以有向图的形式出题,告知了有向边的信息。这题有向边的信息不够直白,但可以稍做转换。
可以假设每一个Cluster中编号最小的hobby为根节点。这样,输入时找到每个人爱好的编号最小的节点,这个节点与其他爱好构成有向边。
例如,某个人爱好为2,3,4,7,其中目前7所在的Cluster根节点最小,为1,那么就等于告知了1->2,1->3,1->4,1->7四条有向边,再按照并查集的传统方式来操作即可。
贴上AC代码
#include<stdio.h>
#include<map>
#include<vector>
#include<algorithm>
using namespace std;
int num[1001];
int clusters[1001]; // hobby <second> belongs to cluster <first>
int getCluster(int hobby)
{
if (clusters[hobby] == hobby)
{
return hobby;
}
else
{
int cluster = getCluster(clusters[hobby]);
clusters[hobby] = cluster;
return cluster;
}
}
bool cmp(int a, int b)
{
return a > b;
}
int main()
{
int N;
scanf("%d", &N);
// init clusters
for (int i = 1; i <= 1000; i++)
{
clusters[i] = i;
num[i] = 0;
}
for (int i = 0; i < N; i++)
{
int k;
scanf("%d: ", &k);
int mainhobby = 1001;
vector<int> hobbies;
for (int j = 0; j < k; j++)
{
int hobby;
scanf("%d", &hobby);
hobbies.push_back(hobby);
if (getCluster(hobby) < mainhobby)
{
mainhobby = getCluster(hobby);
}
}
num[mainhobby]++;
for(int j=0;j<k;j++)
{
int cluster = getCluster(hobbies[j]);
if (cluster != mainhobby)
{
num[mainhobby] += num[cluster];
clusters[cluster] = mainhobby;
}
}
}
vector<int> ans;
for (int i = 1; i < 1001; i++)
{
if (clusters[i] == i&&num[i] > 0)
{
ans.push_back(num[i]);
}
}
sort(ans.begin(), ans.end(), cmp);
printf("%d\n", ans.size());
for (int i = 0; i < ans.size(); i++)
{
if (i == 0) printf("%d", ans[i]);
else printf(" %d", ans[i]);
}
printf("\n");
return 0;
}