pat 甲级并查集 A1107 Social Clusters (30分)

最新推荐文章于 2025-09-24 09:44:37 发布

原创最新推荐文章于 2025-09-24 09:44:37 发布 · 186 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

并查集

本文介绍了一种算法，用于分析社交网络中基于共同爱好的人群集群。通过输入每个人的爱好列表，算法能够找出所有集群并统计每个集群的人数，最终输出集群总数及各集群人数。

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:

Sample Output:

3
4 3 1

题意：按照从1到n的编号以次输入n个人的爱好活动，每个人喜欢k个活动，若两个人任意一个活动相同，就处于同一个社交网络。输出有几个社交网络，及按照人数递减输出每个社交网络的人数。

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
vector<int> father,isRoot;
int course[1100]={0};
int findFather(int v)
{
    if(v==father[v]) return v;
    else
    {
        int f=findFather(father[v]);
        father[v]=f;
        return f;
    }
}
void Union(int a,int b)
{
    int fa=findFather(a);
    int fb=findFather(b);
    if(fa!=fb)
        father[fa]=fb;
}
void init(int n)
{
    for(int i=1;i<=n;i++)
        father[i]=i;
}
int cmp(int a,int b)
{
    return a>b;
}
int main()
{
    int n,k,h;
    cin>>n;
    father.resize(n+1);
    isRoot.resize(n+1);
    init(n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d:",&k);
        for(int j=0;j<k;j++)
        {
            cin>>h;
            if(course[h]==0)//如果这个活动还没人喜欢
            {
                course[h]=i;//编号为i的人喜欢活动h
            }
            Union(i,findFather(course[h]));//合并喜欢活动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++;
    }
    cout<<ans<<endl;
    sort(isRoot.begin(),isRoot.end(),cmp);
    for(int i=0;i<ans;i++)
    {
        cout<<isRoot[i];
        if(i<ans-1) cout<<" ";
        else cout<<endl;
    }
    return 0;
}