1076 Forwards on Weibo (30 分)

知识点：图的遍历

用了邻接表我也不知道为啥变慢了，然后本题比较适合使用bfs，如果用dfs的话比较难，考验你的水平，可以尝试，

#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(x) ((int) x.size())
#define all(x) (x).begin(), (x).end()

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;

const int N = 1005;

int tot, n, l, ans;
int head[N], ver[N * 100], Next[N * 100];

void add(int x, int y) {
    ver[++tot] = y;
    Next[tot] = head[x]; head[x] = tot;
}

void bfs(int s) {
    queue<int> q;
    q.push(s);
    int level[N] = {};
    while (!q.empty()) {
        int now = q.front(); q.pop(); ans++;
        for (int i = head[now]; i; i = Next[i]) {
            if (!level[ver[i]] && level[now] < l && ver[i] != s) {
                q.push(ver[i]); level[ver[i]] = level[now] + 1;
            }
        }
    }
}

int main() {
    cin >> n >> l;
    for (int i = 1; i <= n; i++) {
        int m; cin >> m;
        for (int j = 0; j < m; j++) {
            int x; cin >> x; add(x, i);
        }
    }
    int k; cin >> k;
    while (k--) {
        int x; cin >> x;
        ans = 0; bfs(x);
        cout << ans - 1 << endl;
    }
    return 0;
}