1076 Forwards on Weibo (30 分)

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

//indirect 间接的
//只计算L的最大间接转发数 
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue> 
using namespace std;
int n,l,k;
vector <int> G[1005]; //保留关系表 注意这道题是有向图 
int qur[1005];        //询问列表
int vis[1005];

struct node{
	int val;
	int le; //层数 
};
queue <node> q;
int res;
void bfs(int start)
{
	memset(vis,0,sizeof(vis));
	vis[start]=1;
	node root;
	root.le = 0;
	root.val = start;
	q.push(root);
	while(!q.empty())
	{
		node tem = q.front();
		q.pop();
		int u = tem.val;
		int h = tem.le;
		res+=1;
		for(int i = 0;i<G[u].size();i++)
		{
			if(vis[G[u][i]]==0&&h<l)
			{
				node t;
				vis[G[u][i]] = 1;
				t.le = h+1;
				t.val = G[u][i];
				q.push(t); 
			}
		}	
	} 
	return ;
}
int main()
{
	scanf("%d %d",&n,&l); //总人数与层数
	int num;
	for(int i = 1;i<=n;i++)
	{
		scanf("%d",&num);
		int x;
		for(int j = 0;j<num;j++)
		{
			scanf("%d",&x);
			G[x].push_back(i); //加入邻接表，单向的 
		}
	}
	cin>>k;
	for(int i = 1;i<=k;i++)
	{
		scanf("%d",&qur[i]);
	}
	
	for(int i =1;i<=k;i++)
	{
		memset(vis,0,sizeof(vis));
		res = 0;             //先将人数清零
		bfs(qur[i]);		 //如果题目中出现了level字眼的，应该首先想到bfs 
		cout<<res-1<<endl;
	}
	return 0;
}