1107 Social Clusters-PAT甲级（并查集）

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

并查集的使用，建立一个数组h[N]，h[i]代表的是爱好i对应的出现的第一个人，此后出现爱好i的人都与之进行合并，最后输出并查集的数量以及每组中排序的结果即可

满分代码如下：

#include<bits/stdc++.h>
using namespace std;
const int N=1005;
int fa[N],h[N],v[N];//用h[x]表示有爱好x的是哪一个人 
//v[x]代表类x中有多少个人 
bool cmp(int x,int y){
	return x>y;
}
void init(){
	for(int i=0;i<N;i++)
		fa[i]=i;
}
int get(int x){
	if(fa[x]==x)
		return x;
	return fa[x]=get(fa[x]);
}
void merge(int x,int y){
	x=get(x);
	y=get(y);
	if(x!=y)
		fa[x]=y;
}
bool same(int x,int y){
	return get(x)==get(y);
}
int n;
int main(){
	memset(h,0,sizeof(h));
	init();
	scanf("%d",&n);
	int k,x;
	for(int i=1;i<=n;i++){
		scanf("%d:",&k);
		for(int j=1;j<=k;j++){
			scanf("%d",&x);
			if(h[x]){
				merge(h[x],i);
			}else{
				h[x]=i;
			}
			
		}
	}
	set<int>st;
	memset(v,0,sizeof(v));
	for(int i=1;i<=n;i++){
		int x=get(i);
		st.insert(x);
		v[x]++;
	}
	printf("%d\n",st.size());
	sort(v,v+N,cmp);
	for(int i=0;i<N&&v[i]>0;i++){
		if(i!=0) printf(" ");
		printf("%d",v[i]);
	}
	return 0;
}