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:
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
#include<iostream>
#include<cstdio>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<set>
#include<map>
using namespace std;
const int MAXV = 1010;
struct Node {
int v; //顶点
int layer; //结点层号
};
vector<Node> Adj[MAXV];
bool inq[MAXV] = {false};
//s表示起始顶点,L表示层数上限
int BFS(int s,int L) {
int numForward = 0;//转发数
queue<Node> q;
Node start;
start.v = s; //起始顶点
start.layer = 0; //起始层数
q.push(start);
inq[start.v] = true;
while(!q.empty()) {
Node topNode = q.front();
q.pop();
int u = topNode.v;
for(int i = 0;i < Adj[u].size();i++) {
Node next = Adj[u][i];
next.layer = topNode.layer + 1;
if(inq[next.v] == false && next.layer <= L) {
q.push(next);
inq[next.v] = true;
numForward++;
}
}
}
return numForward;
}
int main() {
Node user;
int N,L;//N表示用户数,L表示上限
int numFollow;//表示一个用户关注的人的数目
int followId;//用户关注的人的id
scanf("%d%d",&N,&L);
for(int i = 1;i <= N;i++) {
user.v = i;
scanf("%d",&numFollow);
for(int j = 0;j < numFollow;j++) {
scanf("%d",&followId);
Adj[followId].push_back(user);
}
}
//numQuery表示要查询的人的数量,s表示起始结点编号
int numQuery,s;
scanf("%d",&numQuery);
for(int i = 0;i < numQuery;i++) {
memset(inq,false,sizeof(inq));
scanf("%d",&s);//输入结点起始编号
int numFollow = BFS(s,L);
printf("%d\n",numFollow);
}
return 0;
}