PAT - 甲级 - 1076. Forwards on Weibo (30)(BFS)

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 are 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.表明有n个使用者，表示要查询的转发关系的最大深度L
2.给定每个使用者关注了的人

要求：
1.如果某人发布信息，最多有多少人转发，最大深度L

求解：
1.从要查询的节点开始广度优先搜索
2.用单独的数组来存储每个节点所在深度
3.深度超过L则不进行计算

---

#include <cstdio>
#include <algorithm>
#include <queue>
#define INF 999999999

using namespace std;

int n, l, k, a, ans, level[1005];
bool follow[1005][1005], vis[1005];

void bfs(int cur) {
	queue<int> q;
	q.push(cur);
	while(!q.empty()) {
		int front = q.front();
		for(int i = 1; i <= n; i++) {
			if(follow[front][i] == true && vis[i] == false) {
				vis[i] = true;
				level[i] = level[front] + 1;
				if(level[i] > l) break;
				q.push(i);
				ans += 1;
			}
		}
		q.pop();
	}
}

int main() {

	fill(follow[0], follow[0]+1005*1005, false);
	scanf("%d%d", &n, &l);
	for(int i = 1; i <= n; i++) {
		scanf("%d", &k);
		for(int j = 0; j < k; j++) {
			scanf("%d", &a);
			follow[a][i] = true;
		}
	}
	scanf("%d", &k);
	for(int i = 0; i < k; i++) {
		scanf("%d", &a);
		fill(vis, vis+1005, false);
		fill(level, level+1005, 0);
		ans = 0;
		vis[a] = true;
		bfs(a);
		printf("%d\n", ans);
	}
	return 0;
}

---