PAT 1076 Forwards on Weibo BFS

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
vector<int>v[1050];
queue<int>que;
int q[1050],dis[1050];
int bfs(int u,int l)
{
  int cnt = 0;
  memset(dis,-1,sizeof(dis));
  dis[u] = 0;
  while(!que.empty())que.pop();
  que.push(u);
  while(!que.empty())
  {
      int s = que.front();
    que.pop();
    if(dis[s] == l)break;
    for(int i = 0;i<v[s].size();i++)
    {
      int sv = v[s][i];
      if(dis[sv] == -1)
      {
        dis[sv] = dis[s]+1;
        que.push(sv);
        cnt++;
      }
    }  
  }
  return cnt;
}
int main()
{
    int n,m,l,i,j;
    scanf("%d%d",&n,&l);
    for(i = 1;i<=n;i++)
    {
      int tp,tp2;
      scanf("%d",&tp);
      for(j = 1;j<=tp;j++)
      {
        scanf("%d",&tp2);
        v[tp2].push_back(i);
      }
    }
    scanf("%d",&m);
    for(i = 1;i<=m;i++)
      scanf("%d",&q[i]);
    for(i = 1;i<=m;i++)
    {
      printf("%d",bfs(q[i],l));
      if(i!=m)printf("\n");
    }
  return 0;
}