A1107 Social Clusters (30 分)

//并查集，省时
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;
const int maxn = 1100;
int N;
int root[maxn];
int hob[maxn];
int clus[maxn];
bool cmp(int a, int b){
	return a > b;
}
void init(){
	for(int i = 1; i < maxn; i++){
		root[i] = i;
		hob[i] = -1;
		clus[i] = 0;
	}
}
int find(int x){
	if(root[x] == x) return x;
	return root[x] = find(root[x]);
}
void Union(int x, int y){
	int rx = find(x);
	int ry = find(y);
	if(rx != ry) root[rx] = ry;
}
int main(){
	scanf("%d", &N);
	init();
	int k, x;
	for(int i = 1; i <= N; i++){
		scanf("%d:", &k);
		for(int j = 0; j < k; j++){
			scanf("%d", &x);
			if(hob[x] == -1) hob[x] = i;
			Union(i, hob[x]);
		}
	}
	int num = 0;
	for(int i = 1; i <= N; i++){
		root[i] = find(i);
		if(clus[root[i]] == 0) num++;
		clus[root[i]]++;
	}
	sort(clus+1, clus+N+1, cmp);	
	printf("%d\n%d", num, clus[1]);
	for(int i = 2; i <= num; i++){
		printf(" %d", clus[i]);
	}
	return 0;	
}

//非并查集方法，略慢
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
#include <set>
using namespace std;
struct Clus{
	int len;
	set<int> hob;
}clus[1010];
int N;
int root[maxn];
int num = 0;
bool cmp(Clus c1, Clus c2){
	return c1.len > c2.len;
}
void unite(int x, int y){
	clus[y].len += clus[x].len;
	clus[x].len = -1;
	set<int>::iterator it = clus[x].hob.begin();
	for(; it != clus[x].hob.end(); it++){
		root[*it] = y;
		clus[y].hob.insert(*it);
	}
}
int main(){
	memset(root, -1, sizeof(root));
	scanf("%d", &N);
	int k, x;
	for(int i = 0; i < N; i++){
		scanf("%d:", &k);
		clus[i].len = 1; num++;
		for(int j = 0; j < k; j++){
			scanf("%d", &x);
			if(root[x] == -1){
				clus[i].hob.insert(x);
				root[x] = i;
			}else if(root[x] != i){
				num--;
				unite(root[x], i);
			}	
		}		
	}
	sort(clus, clus+N, cmp);	
	printf("%d\n%d", num, clus[0].len);
	for(int i = 1; i < num; i++){
		printf(" %d", clus[i].len);
	}	
	return 0;	
}