这是一篇关于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:
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-increasi
最低0.47元/天 解锁文章
113
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
