题目链接~https://www.patest.cn/contests/gplt/L3-003
分析:并查集裸题,把模板背下来的话问题不大注意兴趣的取值范围是[1,1000],因此初始化时不是到n....
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e4+100;
//#define loc
int n,k,num1,num2;
int father[maxn];
int tem[maxn]; //存储每个人的第一个爱好
vector<int> v;
int hashtable[maxn];
int res[maxn]; //存放每个集群的人数
void init(){
//初始化到1000
for(int i = 0; i<=1000; i++)
father[i] = i;
}
int findF(int x){
int a = x;
while(father[x] != x){
x = father[x];
}
//路径压缩
while(father[a] != x){
int tem = father[a];
father[a] = x;
a = tem;
}
return x;
}
void merge(int a, int b){
int fa = findF(a);
int fb = findF(b);
if(fb != fa){
father[fb] = fa;
}
}
int main(){
#ifdef loc
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
cin>>n;
init(); //不要漏了初始化
for(int i = 1; i<=n; i++){
scanf("%d: %d", &k, &num1);
for(int j = 1; j<k; j++){
scanf("%d", &num2);
merge(num1, num2);
}
tem[i] = num1;
}
for(int i = 1; i<=n; i++){
tem[i] = findF(tem[i]);
if(hashtable[tem[i]] == 0){
v.push_back(tem[i]); //存放不同的集群
hashtable[tem[i]] = 1;
}
else hashtable[tem[i]]++;
}
for(int i = 0; i<v.size(); i++){
res[i] = hashtable[v[i]];
}
sort(res, res+v.size());
printf("%d\n", v.size());
for(int i = v.size()-1; i>=0; i--){
if(i != v.size()-1) printf(" ");
printf("%d", res[i]);
}
return 0;
}