Submission #426461

#	Time	Username	Problem	Language	Result	Execution time	Memory
426461		tengiz05	Bitaro’s Party (JOI18_bitaro)	C++17	0 / 100	1 ms	204 KiB

bitaro

#include <bits/stdc++.h>
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int n, m, q;
    std::cin >> n >> m >> q;
    std::vector<std::vector<int>> e(n);
    for (int i = 0; i < m; i++) {
        int u, v;
        std::cin >> u >> v;
        u--;
        v--;
        e[v].push_back(u);
    }
    while (q--) {
        int t, k;
        std::cin >> t >> k;
        t--;
        std::vector<int> bad(n);
        bad[t] = true;
        for (int i = 0, x; i < k; i++) {
            std::cin >> x;
            bad[--x] = true;
        }
        std::priority_queue<std::pair<int, int>> q;
        std::vector<int> dist(n, -1);
        dist[t] = 0;
        q.emplace(0, t);
        while (!q.empty()) {
            auto [d, u] = q.top();
            q.pop();
            if (d < dist[u]) {
                continue;
            }
            for (auto v : e[u]) {
                if (dist[v] < d + 1) {
                    dist[v] = d + 1;
                    q.emplace(dist[v], v);
                }
            }
        }
        int ans = -1;
        for (int i = 0; i < n; i++) {
            if (!bad[i]) {
                ans = std::max(ans, dist[i]);
            }
        }
        std::cout << ans << "\n";
    }
    return 0;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 7
• Subtask 3: 0 / 86