Submission #656090

#	Time	Username	Problem	Language	Result	Execution time	Memory
656090		Kahou	Bitaro’s Party (JOI18_bitaro)	C++14	14 / 100	67 ms	6520 KiB

bitaro

#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int N = 1e5 + 50;
int n, m, q, d[N], dp[N];
vector<int> adj[N];
int T, Y;

void solve() {
        cin >> n >> m >> q;
        for (int i = 1; i <= m; i++) {
                int u, v;
                cin >> u >> v;
                adj[u].push_back(v);
        }
        cin >> T >> Y;
        for (int i = 1; i <= Y; i++) {
                int C;
                cin >> C;
                dp[C] = -1e9;
        }

        for (int u = 1; u <= n; u++) {
                for (int v:adj[u]) {
                        dp[v] = max(dp[v], dp[u]+1);
                }
        }
        cout << (dp[T] < 0? -1: dp[T]) << endl;
}

int main() {
        ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        solve();
        return 0;
}

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