PAT (Advanced Level) Practise 1107Social Clusters (30)
来源:互联网 发布:文件打开软件 编辑:程序博客网 时间:2024/05/16 17:49
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:83: 2 7 101: 42: 5 31: 41: 31: 44: 6 8 1 51: 4Sample Output:
34 3 1
就是统计一下有几个连通块,分别有多少人,直接dfs。
#include<cstdio>#include<vector>#include<cstring>#include<algorithm>#include<functional>using namespace std;typedef long long LL;const int maxn =1e3 + 10;int n,x,m,vis[maxn];vector<int> t[maxn],p[maxn],ans;int dfs(int x){ if (vis[x]) return 0; vis[x]=1; int ans=1; for (int i=0;i<t[x].size();i++) { for (int j=0;j<p[t[x][i]].size();j++) { ans+=dfs(p[t[x][i]][j]); } } return ans;}int main(){ scanf("%d", &n); for (int i=1;i<=n;i++) { scanf("%d:",&m); while (m--) { scanf("%d",&x); t[i].push_back(x); p[x].push_back(i); } } for (int i=1;i<=n;i++) { if (!vis[i]) ans.push_back(dfs(i)); } sort(ans.begin(),ans.end(),greater<int>()); printf("%d\n",ans.size()); for (int i=0;i<ans.size();i++) { if (i) printf(" "); printf("%d",ans[i]); } return 0;}
- PAT (Advanced Level) Practise 1107Social Clusters (30)
- PAT (Advanced Level) Practise 1107 Social Clusters (30)
- 【PAT】【Advanced Level】1107. Social Clusters (30)
- PAT (Advanced Level) Practise 1107. Social Clusters (30) 并查集
- PAT 1107 Social Clusters
- [PAT] (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1057 Stack (30)
- PAT (Advanced Level) Practise 1057 Stack (30)
- 【PAT】1107. Social Clusters (30)
- Linux asm系统调用:32位和64位的区别
- MFC-CStatusBar(状态栏)
- Airplane mode的三种切换方式
- SAS中的if过滤语句
- 对java中int与Integer的一些理解
- PAT (Advanced Level) Practise 1107Social Clusters (30)
- 【LeetCode】290. Word Pattern
- redis cmd 使用例子
- android中permission_group与permisson区别、作用?
- Maven deploy配置方法
- poj 1083 Moving Tables
- 华硕笔记本安装windows8.1和ubuntu双系统注意事项
- 动态规划求最长递增子序列
- DB2死锁问题与日常维护