# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
984020 | 2024-05-16T09:12:42 Z | Amaarsaa | Bitaro’s Party (JOI18_bitaro) | C++14 | 82 ms | 26096 KB |
#include<bits/stdc++.h> using namespace std; using ll = int ; using pll = pair < ll, ll >; ll used[100001], cant[100001], c[100001]; vector < ll > adj[100001], radj[100001]; vector < pll > good[100001]; 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 <= m; i ++) { vector < pll > v; for ( ll I : radj[i]) { i1 = I1 = 0; good[i].push_back({0, i}); used[0] = 1; while ( good[i].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); } } 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 { ll dp[n + 2]; 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 | 7260 KB | Output is correct |
2 | Correct | 2 ms | 7260 KB | Output is correct |
3 | Correct | 2 ms | 7260 KB | Output is correct |
4 | Correct | 3 ms | 7480 KB | Output is correct |
5 | Correct | 3 ms | 7516 KB | Output is correct |
6 | Correct | 3 ms | 7516 KB | Output is correct |
7 | Correct | 2 ms | 7516 KB | Output is correct |
8 | Correct | 2 ms | 7516 KB | Output is correct |
9 | Correct | 2 ms | 7516 KB | Output is correct |
10 | Correct | 2 ms | 7516 KB | Output is correct |
11 | Correct | 2 ms | 7516 KB | Output is correct |
12 | Correct | 2 ms | 7516 KB | Output is correct |
13 | Correct | 2 ms | 7516 KB | Output is correct |
14 | Correct | 2 ms | 7516 KB | Output is correct |
15 | Correct | 2 ms | 7516 KB | Output is correct |
16 | Correct | 2 ms | 7516 KB | Output is correct |
17 | Correct | 2 ms | 7516 KB | Output is correct |
18 | Correct | 2 ms | 7512 KB | Output is correct |
19 | Correct | 2 ms | 7516 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 7260 KB | Output is correct |
2 | Correct | 2 ms | 7260 KB | Output is correct |
3 | Correct | 2 ms | 7260 KB | Output is correct |
4 | Correct | 3 ms | 7480 KB | Output is correct |
5 | Correct | 3 ms | 7516 KB | Output is correct |
6 | Correct | 3 ms | 7516 KB | Output is correct |
7 | Correct | 2 ms | 7516 KB | Output is correct |
8 | Correct | 2 ms | 7516 KB | Output is correct |
9 | Correct | 2 ms | 7516 KB | Output is correct |
10 | Correct | 2 ms | 7516 KB | Output is correct |
11 | Correct | 2 ms | 7516 KB | Output is correct |
12 | Correct | 2 ms | 7516 KB | Output is correct |
13 | Correct | 2 ms | 7516 KB | Output is correct |
14 | Correct | 2 ms | 7516 KB | Output is correct |
15 | Correct | 2 ms | 7516 KB | Output is correct |
16 | Correct | 2 ms | 7516 KB | Output is correct |
17 | Correct | 2 ms | 7516 KB | Output is correct |
18 | Correct | 2 ms | 7512 KB | Output is correct |
19 | Correct | 2 ms | 7516 KB | Output is correct |
20 | Runtime error | 82 ms | 26096 KB | Execution killed with signal 11 |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 7260 KB | Output is correct |
2 | Correct | 2 ms | 7260 KB | Output is correct |
3 | Correct | 2 ms | 7260 KB | Output is correct |
4 | Correct | 3 ms | 7480 KB | Output is correct |
5 | Correct | 3 ms | 7516 KB | Output is correct |
6 | Correct | 3 ms | 7516 KB | Output is correct |
7 | Correct | 2 ms | 7516 KB | Output is correct |
8 | Correct | 2 ms | 7516 KB | Output is correct |
9 | Correct | 2 ms | 7516 KB | Output is correct |
10 | Correct | 2 ms | 7516 KB | Output is correct |
11 | Correct | 2 ms | 7516 KB | Output is correct |
12 | Correct | 2 ms | 7516 KB | Output is correct |
13 | Correct | 2 ms | 7516 KB | Output is correct |
14 | Correct | 2 ms | 7516 KB | Output is correct |
15 | Correct | 2 ms | 7516 KB | Output is correct |
16 | Correct | 2 ms | 7516 KB | Output is correct |
17 | Correct | 2 ms | 7516 KB | Output is correct |
18 | Correct | 2 ms | 7512 KB | Output is correct |
19 | Correct | 2 ms | 7516 KB | Output is correct |
20 | Runtime error | 82 ms | 26096 KB | Execution killed with signal 11 |
21 | Halted | 0 ms | 0 KB | - |