B1076 Forwards on Weibo (BFS)

B1076 Forwards on Weibo (30分)

//这题bfs还是很友好的，记录次bfs的深度，达到最大深度时候返回。

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <stack>
#define lowbit(i)((i)&(-i))
using namespace std;
typedef long long ll;
const int MAX=1e3+20;
const int INF=0x3f3f3f3f;
const int MOD=1000000007;
const int SQR=632;//633块，632个
int n,maxlevel,qnum,q,num;
vector<int>edge[MAX];
int book[MAX];
int height[MAX];
void bfs(int start)
{
    memset(book,0,sizeof(book));
    queue<int>q;
    book[start]=1;
    height[start]=1;
    q.push(start);
    while(!q.empty())
    {
        int top=q.front();
        q.pop();
        if(height[top]>maxlevel)
            return ;
        for(int i=0;i<edge[top].size();i++)
        {
            if(book[edge[top][i]]==0)
            {
                height[edge[top][i]]=height[top]+1;
                q.push(edge[top][i]);
                book[edge[top][i]]=1;
                num++;
            }
        }
    }
}
int main()
{
    scanf("%d%d",&n,&maxlevel);
    for(int i=1;i<=n;i++)
    {
        int x;
        scanf("%d",&x);
        for(int j=0;j<x;j++)
        {
            int y;
            scanf("%d",&y);
            edge[y].push_back(i);
        }
    }
    scanf("%d",&qnum);
    for(int i=0;i<qnum;i++)
    {
        scanf("%d",&q);
        num=0;
        bfs(q);
        printf("%d\n",num);
    }
    return 0;
}