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: 4
Sample Output:
3
4 3 1
题意:
给出N个人,每个人喜欢若干项活动,如果两个人有任意一个活动相同,那么就称他们处于同一个社交网络(若A与B处于同一个社交网络,B与C处于一个社交网络,那么A与C处于同一个社交网络)。求这N个人总共形成了多少个社交网络。
知识点:
并查集
#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 1010;
int father[N]; //存放父亲节点
int isRoot[N] = {0}; //记录每个结点是否作为某个集合的根结点
int course[N] = {0}; //course[h]用来记录任意一个喜欢活动h的人的编号
//查找x所在集合的根结点
int findFather(int x){
int a = x; //由于x会在下面的while中编程根结点,因此先暂存到a
while(x != father[x]){ //寻找根节点
x = father[x];
}
//此时,x中存放的是根结点,下面把路径上的所有节点的father都改为根结点
//即就是路径压缩
while(a != father[a]){
int z = a; //a的值会被father[a]覆盖,先暂存到z
a = father[a]; //回溯父亲节点
father[z] = x;
}
return x;
}
//合并a和b的集合
void Union(int a, int b){
int faA = findFather(a);
int faB = findFather(b);
if(faA != faB){
father[faA] = faB;
}
}
//初始化father[i] 为i, isRoot[i] 为false
void init(int n){
for(int i = 1; i <= n; i++){
father[i] = i;
isRoot[i] = false;
}
}
bool cmp(int a, int b){
return a > b;
}
int main(){
int n, k, h;
scanf("%d", &n);
init(n);
for(int i = 1; i <= n; i++){
scanf("%d:", &k);
for(int j = 0; j < k; j++){
scanf("%d", &h);
if(course[h] == 0){ //如果活动h第一次有人喜欢,这个活动就会以第一个喜欢的节点为根
course[h] = i;
}
Union(i, findFather(course[h])); //合并
}
}
for(int i = 1; i <= n; i++){
isRoot[findFather(i)]++;
}
int ans = 0;
for(int i = 1; i <= n; i++){
if(isRoot[i] != 0){
ans++;
}
}
printf("%d\n", ans);
sort(isRoot + 1, isRoot + n + 1, cmp);
for(int i = 1; i <= ans; i++){
printf("%d", isRoot[i]);
if(i < ans)
printf(" ");
}
return 0;
}