# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
984036 | 2024-05-16T09:29:04 Z | Amaarsaa | Bitaro’s Party (JOI18_bitaro) | C++14 | 224 ms | 18796 KB |
#include<bits/stdc++.h> using namespace std; using ll = int ; using pll = pair < ll, ll >; ll used[100004], cant[100004], dp[100004], c[100004]; vector < ll > adj[100004], radj[100004]; vector < pll > good[100003]; int main() { // freopen("moocast.in", "r", stdin); // freopen("moocast.out", "w", stdout); ios::sync_with_stdio(false); cin.tie(NULL); ll n, m, q, i, ans, x, y, I, I1, i1, t; cin >> n >> m >> q; for (i = 1; i <= m; i ++) { cin >> x >> y; adj[x].push_back(y); radj[y].push_back(x); } for (i = 1; i <= n; i ++) { vector < pll > v; for ( ll I : radj[i]) { i1 = I1 = 0; good[i].push_back({0, i}); used[0] = 1; while ( v.size() < 100 && (i1 < good[i].size() || I1 < good[I].size())) { if (i1 == good[i].size() || (I1 != good[I].size() && good[I][I1].first + 1 >= good[i][i1].first )) { good[I][I1].first ++; v.push_back(good[I][I1]); used[good[I][I1].second] = 1; good[I][I1].first --; I1 ++; } else { v.push_back(good[i][i1]); used[good[i][i1].second] = 1; i1 ++; } while (i1 < good[i].size() && used[good[i][i1].second]) i1 ++; while (I1 < good[I].size() && used[good[I][I1].second]) I1 ++; } good[i].pop_back(); for ( pll A : good[i]) used[A.second] = 0; swap(good[i], v); v.clear(); } } while ( q --) { cin >> t >> m; for ( i = 1; i <= m; i ++) { cin >> c[i]; cant[c[i]] = 1; } ans = -1; if ( m <= 100) { for ( pll &A : good[t]) { if (!cant[A.second]) { ans = A.first; break; } } if (!cant[t]) ans = max(ans, int(0)); } else { for (i = 1; i <= n; i ++) dp[i] = -1; for (i = 1; i <= n; i ++) { if ( cant[i] == 1 && dp[i] == -1) continue; dp[i] = max(int(0), dp[i]); for ( int I : adj[i]) { dp[I] = max(dp[I], dp[i] + 1); } } ans = dp[t]; } for (i =1 ; i <= m; i ++) cant[c[i]] = 0; cout << ans << endl; } /* for (i = 1; i <= n; i ++) { cout << i << " " << good[i].size() << endl; for (pll X : good[i]) { cout << X.first << " " << X.second << endl; } cout << endl; } */ }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 8792 KB | Output is correct |
2 | Correct | 2 ms | 8796 KB | Output is correct |
3 | Correct | 2 ms | 8792 KB | Output is correct |
4 | Correct | 2 ms | 8792 KB | Output is correct |
5 | Correct | 3 ms | 8796 KB | Output is correct |
6 | Correct | 2 ms | 8792 KB | Output is correct |
7 | Correct | 2 ms | 8796 KB | Output is correct |
8 | Correct | 2 ms | 8796 KB | Output is correct |
9 | Correct | 2 ms | 8792 KB | Output is correct |
10 | Correct | 3 ms | 8796 KB | Output is correct |
11 | Correct | 2 ms | 8796 KB | Output is correct |
12 | Correct | 2 ms | 8892 KB | Output is correct |
13 | Correct | 2 ms | 8796 KB | Output is correct |
14 | Correct | 2 ms | 8792 KB | Output is correct |
15 | Correct | 2 ms | 8792 KB | Output is correct |
16 | Correct | 2 ms | 8796 KB | Output is correct |
17 | Correct | 2 ms | 8796 KB | Output is correct |
18 | Correct | 2 ms | 8792 KB | Output is correct |
19 | Correct | 2 ms | 8796 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 8792 KB | Output is correct |
2 | Correct | 2 ms | 8796 KB | Output is correct |
3 | Correct | 2 ms | 8792 KB | Output is correct |
4 | Correct | 2 ms | 8792 KB | Output is correct |
5 | Correct | 3 ms | 8796 KB | Output is correct |
6 | Correct | 2 ms | 8792 KB | Output is correct |
7 | Correct | 2 ms | 8796 KB | Output is correct |
8 | Correct | 2 ms | 8796 KB | Output is correct |
9 | Correct | 2 ms | 8792 KB | Output is correct |
10 | Correct | 3 ms | 8796 KB | Output is correct |
11 | Correct | 2 ms | 8796 KB | Output is correct |
12 | Correct | 2 ms | 8892 KB | Output is correct |
13 | Correct | 2 ms | 8796 KB | Output is correct |
14 | Correct | 2 ms | 8792 KB | Output is correct |
15 | Correct | 2 ms | 8792 KB | Output is correct |
16 | Correct | 2 ms | 8796 KB | Output is correct |
17 | Correct | 2 ms | 8796 KB | Output is correct |
18 | Correct | 2 ms | 8792 KB | Output is correct |
19 | Correct | 2 ms | 8796 KB | Output is correct |
20 | Correct | 27 ms | 11152 KB | Output is correct |
21 | Correct | 27 ms | 11220 KB | Output is correct |
22 | Correct | 27 ms | 11356 KB | Output is correct |
23 | Correct | 27 ms | 11356 KB | Output is correct |
24 | Correct | 91 ms | 17240 KB | Output is correct |
25 | Correct | 73 ms | 17044 KB | Output is correct |
26 | Correct | 68 ms | 17140 KB | Output is correct |
27 | Correct | 70 ms | 18796 KB | Output is correct |
28 | Correct | 69 ms | 18652 KB | Output is correct |
29 | Correct | 68 ms | 18752 KB | Output is correct |
30 | Correct | 64 ms | 18284 KB | Output is correct |
31 | Correct | 72 ms | 18264 KB | Output is correct |
32 | Correct | 68 ms | 18260 KB | Output is correct |
33 | Correct | 79 ms | 17752 KB | Output is correct |
34 | Correct | 69 ms | 17668 KB | Output is correct |
35 | Correct | 85 ms | 17836 KB | Output is correct |
36 | Correct | 80 ms | 18032 KB | Output is correct |
37 | Correct | 67 ms | 18000 KB | Output is correct |
38 | Correct | 96 ms | 18000 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 8792 KB | Output is correct |
2 | Correct | 2 ms | 8796 KB | Output is correct |
3 | Correct | 2 ms | 8792 KB | Output is correct |
4 | Correct | 2 ms | 8792 KB | Output is correct |
5 | Correct | 3 ms | 8796 KB | Output is correct |
6 | Correct | 2 ms | 8792 KB | Output is correct |
7 | Correct | 2 ms | 8796 KB | Output is correct |
8 | Correct | 2 ms | 8796 KB | Output is correct |
9 | Correct | 2 ms | 8792 KB | Output is correct |
10 | Correct | 3 ms | 8796 KB | Output is correct |
11 | Correct | 2 ms | 8796 KB | Output is correct |
12 | Correct | 2 ms | 8892 KB | Output is correct |
13 | Correct | 2 ms | 8796 KB | Output is correct |
14 | Correct | 2 ms | 8792 KB | Output is correct |
15 | Correct | 2 ms | 8792 KB | Output is correct |
16 | Correct | 2 ms | 8796 KB | Output is correct |
17 | Correct | 2 ms | 8796 KB | Output is correct |
18 | Correct | 2 ms | 8792 KB | Output is correct |
19 | Correct | 2 ms | 8796 KB | Output is correct |
20 | Correct | 27 ms | 11152 KB | Output is correct |
21 | Correct | 27 ms | 11220 KB | Output is correct |
22 | Correct | 27 ms | 11356 KB | Output is correct |
23 | Correct | 27 ms | 11356 KB | Output is correct |
24 | Correct | 91 ms | 17240 KB | Output is correct |
25 | Correct | 73 ms | 17044 KB | Output is correct |
26 | Correct | 68 ms | 17140 KB | Output is correct |
27 | Correct | 70 ms | 18796 KB | Output is correct |
28 | Correct | 69 ms | 18652 KB | Output is correct |
29 | Correct | 68 ms | 18752 KB | Output is correct |
30 | Correct | 64 ms | 18284 KB | Output is correct |
31 | Correct | 72 ms | 18264 KB | Output is correct |
32 | Correct | 68 ms | 18260 KB | Output is correct |
33 | Correct | 79 ms | 17752 KB | Output is correct |
34 | Correct | 69 ms | 17668 KB | Output is correct |
35 | Correct | 85 ms | 17836 KB | Output is correct |
36 | Correct | 80 ms | 18032 KB | Output is correct |
37 | Correct | 67 ms | 18000 KB | Output is correct |
38 | Correct | 96 ms | 18000 KB | Output is correct |
39 | Incorrect | 224 ms | 17712 KB | Output isn't correct |
40 | Halted | 0 ms | 0 KB | - |