# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
117038 | 2019-06-14T13:56:56 Z | PeppaPig | Bitaro’s Party (JOI18_bitaro) | C++14 | 2000 ms | 299576 KB |
#include <bits/stdc++.h> #define pii pair<int, int> #define x first #define y second using namespace std; const int N = 1e5+5; const int B = 320; int n, m, q; int dp[N], chk[N]; vector<int> g[N]; void solve(vector<int> &v) { fill_n(dp, N, -1e9); memset(chk, 0, sizeof chk); for(int i : v) chk[i] = true; for(int u = 1; u <= n; u++) { if(!chk[u]) dp[u] = max(dp[u], 0); for(int v : g[u]) if(dp[v] != -1e9) dp[u] = max(dp[u], dp[v] + 1); } } vector<pii> pre[N]; int mx[N], all[N]; void preprocess() { fill_n(mx, N, -1); for(int i = 1; i <= n; i++) { pre[i] = vector<pii>(B, pii(-1, -1)); pre[i][0] = pii(0, i); } for(int u = 1; u <= n; u++) { int ptr = 0; all[++ptr] = u, mx[u] = 0; for(int v : g[u]) for(pii p : pre[v]) if(p.x != -1) { mx[p.y] = max(mx[p.y], p.x + 1); all[++ptr] = p.y; } for(int i = 1; i <= ptr; i++) { pre[u].emplace_back(mx[all[i]], all[i]); mx[all[i]] = -1; } sort(pre[u].begin(), pre[u].end(), greater<pii>()); pre[u].resize(B); } } bitset<N> tchk; int main() { scanf("%d %d %d", &n, &m, &q); for(int i = 1, a, b; i <= m; i++) { scanf("%d %d", &a, &b); if(a > b) swap(a, b); g[b].emplace_back(a); } preprocess(); for(int i = 1, t, y; i <= q; i++) { scanf("%d %d", &t, &y); vector<int> block; for(int i = 1, a; i <= y; i++) { scanf("%d", &a); block.emplace_back(a); } if(y >= B) { solve(block); if(dp[t] != -1e9) printf("%d\n", dp[t]); else printf("-1\n"); } else { bool valid = false; for(int i : block) tchk[i] = true; for(int i = 0; i < B; i++) if(pre[t][i] != pii(-1, -1) && !tchk[pre[t][i].y]) { valid = true; printf("%d\n", pre[t][i].x); break; } if(!valid) printf("-1\n"); for(int i : block) tchk[i] = false; } } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 5376 KB | Output is correct |
2 | Correct | 6 ms | 5504 KB | Output is correct |
3 | Correct | 6 ms | 5504 KB | Output is correct |
4 | Correct | 6 ms | 5504 KB | Output is correct |
5 | Correct | 19 ms | 11264 KB | Output is correct |
6 | Correct | 19 ms | 11256 KB | Output is correct |
7 | Correct | 19 ms | 11264 KB | Output is correct |
8 | Correct | 41 ms | 15224 KB | Output is correct |
9 | Correct | 41 ms | 15352 KB | Output is correct |
10 | Correct | 39 ms | 15352 KB | Output is correct |
11 | Correct | 33 ms | 14456 KB | Output is correct |
12 | Correct | 22 ms | 11776 KB | Output is correct |
13 | Correct | 36 ms | 14200 KB | Output is correct |
14 | Correct | 32 ms | 14080 KB | Output is correct |
15 | Correct | 25 ms | 12524 KB | Output is correct |
16 | Correct | 35 ms | 13948 KB | Output is correct |
17 | Correct | 30 ms | 13816 KB | Output is correct |
18 | Correct | 25 ms | 12160 KB | Output is correct |
19 | Correct | 34 ms | 13560 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 5376 KB | Output is correct |
2 | Correct | 6 ms | 5504 KB | Output is correct |
3 | Correct | 6 ms | 5504 KB | Output is correct |
4 | Correct | 6 ms | 5504 KB | Output is correct |
5 | Correct | 19 ms | 11264 KB | Output is correct |
6 | Correct | 19 ms | 11256 KB | Output is correct |
7 | Correct | 19 ms | 11264 KB | Output is correct |
8 | Correct | 41 ms | 15224 KB | Output is correct |
9 | Correct | 41 ms | 15352 KB | Output is correct |
10 | Correct | 39 ms | 15352 KB | Output is correct |
11 | Correct | 33 ms | 14456 KB | Output is correct |
12 | Correct | 22 ms | 11776 KB | Output is correct |
13 | Correct | 36 ms | 14200 KB | Output is correct |
14 | Correct | 32 ms | 14080 KB | Output is correct |
15 | Correct | 25 ms | 12524 KB | Output is correct |
16 | Correct | 35 ms | 13948 KB | Output is correct |
17 | Correct | 30 ms | 13816 KB | Output is correct |
18 | Correct | 25 ms | 12160 KB | Output is correct |
19 | Correct | 34 ms | 13560 KB | Output is correct |
20 | Execution timed out | 2054 ms | 299576 KB | Time limit exceeded |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 5376 KB | Output is correct |
2 | Correct | 6 ms | 5504 KB | Output is correct |
3 | Correct | 6 ms | 5504 KB | Output is correct |
4 | Correct | 6 ms | 5504 KB | Output is correct |
5 | Correct | 19 ms | 11264 KB | Output is correct |
6 | Correct | 19 ms | 11256 KB | Output is correct |
7 | Correct | 19 ms | 11264 KB | Output is correct |
8 | Correct | 41 ms | 15224 KB | Output is correct |
9 | Correct | 41 ms | 15352 KB | Output is correct |
10 | Correct | 39 ms | 15352 KB | Output is correct |
11 | Correct | 33 ms | 14456 KB | Output is correct |
12 | Correct | 22 ms | 11776 KB | Output is correct |
13 | Correct | 36 ms | 14200 KB | Output is correct |
14 | Correct | 32 ms | 14080 KB | Output is correct |
15 | Correct | 25 ms | 12524 KB | Output is correct |
16 | Correct | 35 ms | 13948 KB | Output is correct |
17 | Correct | 30 ms | 13816 KB | Output is correct |
18 | Correct | 25 ms | 12160 KB | Output is correct |
19 | Correct | 34 ms | 13560 KB | Output is correct |
20 | Execution timed out | 2054 ms | 299576 KB | Time limit exceeded |
21 | Halted | 0 ms | 0 KB | - |