1107. Social Clusters

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

Sample Output:

3
4 3 1
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <deque>
#include <queue>
#include <cstring>
#include <vector>
#include <string>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
#include <stack>
#include <cmath>
#include <algorithm>
using namespace std;
struct node
{
	vector<int>h;
	int root;
};
int fa[1005];
int c[1005];
bool cmp(int a,int b)
{
	return a>b;
}
int find1(int x)
{
	int a=x;
	while(fa[x]!=x)
		x=fa[x];
	while(a!=fa[a])
	{
		int z=a;
		fa[a]=x;
		a=fa[z];
	}
	return x;
}
void union1(int a,int b)
{
	int a1=find1(a);
	int b1=find1(b);
	if(a1!=b1)
		fa[a1]=b1;
}
int main()
{
    int n;
    cin>>n;
    node g[n+1];
    for(int i=0;i<=1005;i++)
	{
		fa[i]=i;
		c[i]=0;
	}
    for(int i=1;i<=n;i++)
	{
		int num,a;
		scanf("%d:%d",&num,&a);
		g[i].h.push_back(a);
		for(int j=1;j<num;j++)
		{
			int b;
			cin>>b;
			g[i].h.push_back(b);
			union1(a,b);
		}
	}
	set<int>a;
	for(int i=1;i<=n;i++)
	{
		int root=find1(g[i].h[g[i].h.size()-1]);
		c[root]++;
		//cout<<root<<endl;
		a.insert(root);
	}
	/*for(int i=1;i<=1005;i++)
	{
		if(c[i]!=0)
			cout<<i<<' '<<c[i]<<endl;
	}*/
	cout<<a.size()<<endl;
	sort(c+1,c+1006,cmp);
	int flag=1;
	for(int i=1;i<=n;i++)
	{
		if(c[i]!=0)
		{
			if(flag==1)
				flag=0;
			else
				cout<<' ';
			cout<<c[i];
		}
		if(c[i]==0)
		    break;
	}
	return 0;
}