제출 #1281143

#제출 시각아이디문제언어결과실행 시간메모리
1281143AishaBitaro’s Party (JOI18_bitaro)C++20
14 / 100
39 ms8328 KiB
#include "bits/stdc++.h"

using namespace std;

#define int long long

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int n, m, q;
    cin >> n >> m >> q;

    vector <vector <int>> g(n + 1);
    for (int i = 1; i <= m; i ++) {
        int u, v;
        cin >> u >> v;
        g[v].push_back(u);
    }

    int begin;
    cin >> begin;

    int t; cin >> t;
    vector <int> ok(n + 1, 1);

    for (int i = 0; i < t; i ++) {
        int x; cin >> x;
        ok[x] = 0;
    }

    vector <int> dis(n + 1, - 2 * n);
    int ans = -1;
    dis[begin] = 0;

    for (int i = begin; i >= 1; i --) {
        for (int x : g[i]) {
            dis[x] = max(dis[x], dis[i] + 1);
        }
        if (!ok[i]) dis[i] = -2 * n;
        ans = max(ans, dis[i]);
    }

    cout << ans << endl;

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...