PAT-A1076 Forwards on Weibo 题目内容及题解

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 triger, 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:

7 3
3 2 3 4
0
2 5 6
2 3 1
2 3 4
1 4
1 5
2 2 6

Sample Output:

4
5

题目大意

题目通过输入每个用户的关注者的信息给定一个社交网络，假设只计算到某一层间接关注者，题目要求计算任何特定用户的最大转发潜在数量。

解题思路

1. 题目给定数据为用户关注者信息，先由此信息初始化并生成一个从被关注者到关注者的有向图；
2. 对请求序列中的每个请求使用BFS进行遍历、计数并输出；
3. 返回零值。

代码

#include<cstdio>
#include<vector>
using namespace std;

#define maxn 1010

vector<int> Adj[maxn]; 
int inq[maxn];
int N,L;

void Init(){
    int num,a,i;
    scanf("%d%d",&N,&L);
    for(i=1;i<=N;i++){
        scanf("%d",&num);
        while(num--){
            scanf("%d",&a);
            Adj[a].push_back(i);
        }
    }
}

int BFS(int s){
    int Queue[maxn*6];
    int front=0,rear=0;
    int now,level=0,cnt=-1,i;
    for(i=1;i<=N;i++){
        inq[i]=0;
    }
    Queue[rear++]=s;
    inq[s]=1;
    Queue[rear++]=-1;
    while(rear>front){
        now=Queue[front++];
        if(now==-1){
            Queue[rear++]=-1;
            level++;
            if(level<=L){
                continue;
            }else{
                break;
            }
        }
        cnt++;
        for(i=0;i<Adj[now].size();i++){
            if(inq[Adj[now][i]]==0){
                Queue[rear++]=Adj[now][i];
                inq[Adj[now][i]]=1;
            }
        }
    }
    return cnt;
}

int main(){
    int K,Query;
    Init();
    scanf("%d",&K);
    while(K--){
        scanf("%d",&Query);
        printf("%d\n",BFS(Query));
    }
    return 0;
}

运行结果