1107. Social Clusters (30)
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:
Ki: hi[1] hi[2] ... hi[Ki]
where Ki (>0) is the number of hobbies, and hi[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: 4Sample Output:
3 4 3 1
https://www.patest.cn/contests/pat-a-practise/1107
思路:
先转化为图,再求连通分量的个数、规模
CODE:
#include<iostream>
#include<vector>
#include<map>
#include<cstring>
#include<cstdio>
#include<algorithm>
#define N 1010
#define NN 1000100
using namespace std;
map<int,int> ind;
vector<int> hb;
vector<int> hbp[NN];
vector<int> fri[N];
bool fl[N];
vector<int> res;
int dfs(int n)
{
int num=1;
for (int i=0;i<fri[n].size();i++)
{
if (fl[fri[n][i]]==1) continue;
fl[fri[n][i]]=1;
num+=dfs(fri[n][i]);
}
return num;
}
bool cmp(int a,int b)
{
return a>b;
}
int main()
{
int n;
scanf("%d",&n);
for (int i=1;i<=n;i++)
{
int m;
scanf("%d:",&m);
for (int j=0;j<m;j++)
{
int t;
scanf("%d",&t);
if (ind[t]==0)
{
hb.push_back(t);
ind[t]=hb.size();
hbp[ind[t]].push_back(i);
}
else
{
int si=hbp[ind[t]].size();
for(int k=0;k<si;k++)
{
//cout<<k<<endl;
fri[i].push_back(hbp[ind[t]][k]);
fri[hbp[ind[t]][k]].push_back(i);
}
hbp[ind[t]].push_back(i);
}
}
}
memset(fl,0,sizeof(fl));
for (int i=1;i<=n;i++)
{
if (fl[i]==1) continue;
fl[i]=1;
res.push_back(dfs(i));
}
sort(res.begin(),res.end(),cmp);
printf("%d\n",res.size());
for (int i=0;i<res.size();i++)
{
if (i!=0) printf(" ");
printf("%d",res[i]);
}
return 0;
}