PAT (Advanced Level) Practice A1076 Forwards on Weibo （30 分）(C++)（甲级）(有向图，BFS，层数)

原题链接：A1076 Forwards on Weibo

#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cstring>
#include <ctime>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
using namespace std;

const int MAX = 1010;
bool Graph[MAX][MAX] = {{0}};//邻接矩阵表示有向图，如Graph[1][2]表示2是1的粉丝
int N, L, M, K, userID;

int BFS(int v)//对v进行广度优先搜索，达到深度为L即停止，并返回其孩子个数
{
    queue<int> Q;
    bool visited[MAX] = {0};//访问标记数组
    visited[v] = 1;
    Q.push(v);
    int level = 0, cnt = 0, last = v;//last指向该层最后一个节点
    while(!Q.empty() && level < L)
    {
        v = Q.front();
        Q.pop();
        for(int i=1; i<=N; i++)
        {
            if(Graph[v][i] && !visited[i])
            {
                Q.push(i);
                visited[i] = 1;
                cnt++;
            }
        }
        if(last == v)//层数+1
        {
            last = Q.back();
            level++;
        }
    }
    return cnt;
}

int main()
{
    scanf("%d %d", &N, &L);
    for(int i=1, j; i<=N; i++)
    {
        scanf("%d", &M);
        for(j=0; j<M; j++)
        {
            scanf("%d", &userID);
            Graph[userID][i] = 1;
        }
    }
    scanf("%d", &M);
    for(int i=0; i<M; i++)
    {
        scanf("%d", &userID);
        printf("%d\n", BFS(userID));//输出该人的L层以内的潜在粉丝数
    }
    return 0;
}