PAT甲级真题 1076 Forwards on Weibo (30分) C++实现（图的广度优先遍历，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

思路

添加从用户指向其粉丝的连线，问题可以转换为有向图的广度优先遍历，并加入了层数限制。

用数组v保存当前层次待访问的节点，用额外的数组newV保存下层待访问节点，用数组visited记录节点是否已访问过。

每层搜索都遍历v中的节点，将与v相连且未访问的节点加入newV。当前层访问结束后，将newV赋值给v，清空newV，继续下层搜索。

---

注意不能用dfs，考虑下面的情况：

距离限制为2时，从节点1进行dfs访问结果为：1->2->3
而正确结果应该是：1->2->3->4

代码

#include <iostream>