1076 Forwards on Weibo (30)

#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
using namespace std;
const int MAXN = 1010;
int N, L, K, num_forwards;
vector<int> followers[MAXN];
int deep[MAXN];//记录每个节点的深度，也可以用结构体
bool vis[MAXN];//每个用户只转发一次
int bfs(int start) {
	queue<int> q;
	q.push(start);
	deep[start] = 0;
	vis[start] = true;
	while(!q.empty()) {
		int front = q.front();
		q.pop();
		if(deep[front] < L) {
			for(int i=0; i<followers[front].size(); i++) {
				if(vis[followers[front][i]] == false) {
					q.push(followers[front][i]);
					deep[followers[front][i]] = deep[front] + 1;
					num_forwards ++;
					vis[followers[front][i]] = true;
				}
			}			
		} else return num_forwards;
	}
	return num_forwards; //若未达到三层，也返回
}
int main() {
	scanf("%d%d",&N,&L);
	for(int i=1; i<=N; i++) {
		int N_followers;
		scanf("%d",&N_followers);
		for(int j=0; j<N_followers; j++) {
			int i_followers;
			scanf("%d",&i_followers);
			followers[i_followers].push_back(i);//有向图的方向
		}
	}
	scanf("%d",&K);
	for(int i=0; i<K; i++) {
		int start;
		scanf("%d",&start);
		num_forwards = 0;
		memset(vis,false,sizeof(vis));
		printf("%d\n",bfs(start));
	}
	return 0;
}