1076 Forwards on Weibo (30 分)

最新推荐文章于 2024-11-18 18:38:00 发布

是六六呀yhy521

最新推荐文章于 2024-11-18 18:38:00 发布

阅读量129

点赞数

分类专栏： PAT (Advanced Level) Practice 文章标签： c++ pat考试图 BFS queue

本文链接：https://blog.csdn.net/fairylyt/article/details/123239441

版权

PAT (Advanced Level) Practice 专栏收录该内容

61 篇文章 0 订阅

订阅专栏

该博客介绍了如何使用广度优先搜索（BFS）算法解决计算微博用户最大潜在转发数量的问题。代码展示了如何构建邻接表并进行BFS遍历，以计算在限定的间接粉丝层级内，用户能触发的最大转发次数。此问题涉及社交网络分析和算法应用。

摘要由CSDN通过智能技术生成

欢迎大家关注我的公众号，不定期分享PAT-A/B代码~

Weibo is known as the Chinese version of Twitter. One user on Weibo may have many followers, and may follow many other users as well. Hence a social network is formed with followers relations. When a user makes a post on Weibo, all his/her followers can view and forward his/her post, which can then be forwarded again by their followers. Now given a social network, you are supposed to calculate the maximum potential amount of forwards for any specific user, assuming that only L levels of indirect followers are counted.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 positive integers: N (≤1000), the number of users; and L (≤6), the number of levels of indirect followers that are counted. Hence it is assumed that all the users are numbered from 1 to N. Then N lines follow, each in the format:

M[i] user_list[i]

where M[i] (≤100) is the total number of people that user[i] follows; and user_list[i] is a list of the M[i] users that followed by user[i]. It is guaranteed that no one can follow oneself. All the numbers are separated by a space.

Then finally a positive K is given, followed by K UserID's for query.

Output Specification:

For each UserID, you are supposed to print in one line the maximum potential amount of forwards this user can trigger, assuming that everyone who can view the initial post will forward it once, and that only L levels of indirect followers are counted.

Sample Input:

Sample Output:

4
5

代码：

#include<iostream>
#include<queue>
#include<vector>
using namespace std;
int N,L,K;
bool inq[1010];//用来判断某元素是否入过队
int level[1010];
vector<int> Adj[1010];//构建邻接表
void init()//初始化inq和level数组
{
    for(int i=0;i<=N;i++)
    {
        inq[i]=false;
        level[i]=0;
    }
}
void BFS(int n)//进行广度优先搜索
{
    init();
    queue<int> Q;
    Q.push(n);
    inq[n]=true;
    int count=0;
    while(!Q.empty())
    {
        int temp=Q.front();
        Q.pop();
        for(int i=0;i<Adj[temp].size();i++)
        {
            if(inq[Adj[temp][i]]==false)
            {
                level[Adj[temp][i]]=level[temp]+1;
                if(level[Adj[temp][i]]<=L)
                    count++;
                inq[Adj[temp][i]]=true;
                Q.push(Adj[temp][i]);
            }
        }
    }
    printf("%d\n",count);
}
int main()
{
    scanf("%d%d",&N,&L);
    for(int i=1;i<=N;i++)//读取数据，构建邻接表
    {
        int M;
        scanf("%d",&M);
        for(int j=0;j<M;j++)
        {
            int f;
            scanf("%d",&f);
            Adj[f].push_back(i);
        }
    }
    scanf("%d",&K);
    for(int i=0;i<K;i++)//依次检测每个需要检测的结点
    {
        int num;
        scanf("%d",&num);
        BFS(num);
    }
    return 0;
}