# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47753 | 2018-05-07T04:36:09 Z | daniel_02 | Bitaro’s Party (JOI18_bitaro) | C++17 | 6 ms | 3044 KB |
#include <bits/stdc++.h> #define pb push_back #define fr first #define sc second using namespace std; const int N = 1e5 + 7; priority_queue<pair<int, int>>q; vector<pair<int, int>>g[N]; bool busy[N], us[N]; int mx; void dfs(int v, int d = 0) { if (us[v])return; if (!busy[v]) mx = max(mx, d); us[v] = 1; for (int i = 0; i < g[v].size(); i++) { int to = g[v][i].fr; dfs(to, d + 1); } } main() { int n, m, Q; cin >> n >> m >> Q; for (int i = 1; i <= m; i ++) { int u, v; scanf("%d%d", &u, &v); g[v].pb({u, 1}); } while (Q--) { int t, k; scanf("%d%d", &t, &k); for (int i = 0; i < k; i++) { int a; scanf("%d", &a); busy[a] = 1; } dfs(t); if (mx == 0) { if (busy[t]) { cout << -1 << endl; continue; } cout << 0 << endl; continue; } cout << mx << endl; memset(us, 0, sizeof(us)); memset(busy, 0, sizeof(busy)); mx = 0; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 2680 KB | Output is correct |
2 | Correct | 6 ms | 2812 KB | Output is correct |
3 | Correct | 4 ms | 2812 KB | Output is correct |
4 | Correct | 4 ms | 2812 KB | Output is correct |
5 | Incorrect | 6 ms | 3044 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 2680 KB | Output is correct |
2 | Correct | 6 ms | 2812 KB | Output is correct |
3 | Correct | 4 ms | 2812 KB | Output is correct |
4 | Correct | 4 ms | 2812 KB | Output is correct |
5 | Incorrect | 6 ms | 3044 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 2680 KB | Output is correct |
2 | Correct | 6 ms | 2812 KB | Output is correct |
3 | Correct | 4 ms | 2812 KB | Output is correct |
4 | Correct | 4 ms | 2812 KB | Output is correct |
5 | Incorrect | 6 ms | 3044 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |