# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
112467 | 2019-05-20T06:17:35 Z | choikiwon | Bitaro’s Party (JOI18_bitaro) | C++17 | 1485 ms | 221692 KB |
#include<bits/stdc++.h> using namespace std; typedef pair<int, int> pii; const int MN = 100010; const int SQ = 300; int N, M, Q; vector<int> adj[MN], radj[MN]; int chk[MN], used[MN]; vector<pii> mrg(vector<pii> &a, vector<pii> &b) { vector<pii> ret; int pos1 = 0, pos2 = 0; while(ret.size() < SQ && pos1 < a.size() && pos2 < b.size()) { if(used[ a[pos1].second ]) pos1++; if(used[ b[pos2].second ]) pos2++; if(a[pos1].first > b[pos2].first + 1) ret.push_back(a[pos1]), used[ a[pos1].second ] = 1, pos1++; else ret.push_back(pii(b[pos2].first + 1, b[pos2].second)), used[ b[pos2].second ] = 1, pos2++; } while(ret.size() < SQ && pos1 < a.size()) { if(used[ a[pos1].second ]) pos1++; ret.push_back(a[pos1]), used[ a[pos1].second ] = 1, pos1++; } while(ret.size() < SQ && pos2 < b.size()) { if(used[ b[pos2].second ]) pos2++; ret.push_back(pii(b[pos2].first + 1, b[pos2].second)), used[ b[pos2].second ] = 1, pos2++; } for(int i = 0; i < ret.size(); i++) used[ ret[i].second ] = 0; return ret; } vector<pii> cc1[MN]; vector<pii> dp1(int u) { vector<pii> &ret = cc1[u]; if(ret.size()) return ret; ret.push_back({0, u}); for(int i = 0; i < radj[u].size(); i++) { int v = radj[u][i]; vector<pii> tmp = dp1(v); ret = mrg(ret, tmp); } return ret; } int X; int cc2[MN]; int dp2(int u) { int &ret = cc2[u]; if(ret != -1) return ret; if(u == X) return ret = 0; ret = -1e9; for(int i = 0; i < adj[u].size(); i++) { int v = adj[u][i]; ret = max(ret, dp2(v) + 1); } return ret; } int main() { scanf("%d %d %d", &N, &M, &Q); for(int i = 0; i < M; i++) { int u, v; scanf("%d %d", &u, &v); u--; v--; adj[u].push_back(v); radj[v].push_back(u); } for(int i = 0; i < Q; i++) { int t, y; scanf("%d %d", &t, &y); t--; vector<int> c(y); for(int j = 0; j < y; j++) { scanf("%d", &c[j]); chk[ --c[j] ] = 1; } if(y > SQ) { memset(cc2, -1, sizeof(cc2)); X = t; int ans = -1; for(int j = 0; j < N; j++) if(!chk[j]) ans = max(ans, dp2(j)); printf("%d\n", ans); } else { vector<pii> tmp = dp1(t); int ans = -1; for(int j = 0; j < tmp.size(); j++) if(!chk[ tmp[j].second ]) { ans = tmp[j].first; break; } printf("%d\n", ans); } for(int j = 0; j < y; j++) chk[ c[j] ] = 0; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 7424 KB | Output is correct |
2 | Correct | 7 ms | 7424 KB | Output is correct |
3 | Correct | 7 ms | 7424 KB | Output is correct |
4 | Correct | 7 ms | 7424 KB | Output is correct |
5 | Correct | 9 ms | 7780 KB | Output is correct |
6 | Correct | 8 ms | 7808 KB | Output is correct |
7 | Correct | 8 ms | 7808 KB | Output is correct |
8 | Correct | 8 ms | 7796 KB | Output is correct |
9 | Correct | 8 ms | 7796 KB | Output is correct |
10 | Correct | 8 ms | 7780 KB | Output is correct |
11 | Correct | 8 ms | 7780 KB | Output is correct |
12 | Correct | 8 ms | 7808 KB | Output is correct |
13 | Correct | 8 ms | 7772 KB | Output is correct |
14 | Correct | 9 ms | 7808 KB | Output is correct |
15 | Correct | 8 ms | 7808 KB | Output is correct |
16 | Correct | 9 ms | 7780 KB | Output is correct |
17 | Correct | 9 ms | 7808 KB | Output is correct |
18 | Correct | 9 ms | 7808 KB | Output is correct |
19 | Correct | 9 ms | 7808 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 7424 KB | Output is correct |
2 | Correct | 7 ms | 7424 KB | Output is correct |
3 | Correct | 7 ms | 7424 KB | Output is correct |
4 | Correct | 7 ms | 7424 KB | Output is correct |
5 | Correct | 9 ms | 7780 KB | Output is correct |
6 | Correct | 8 ms | 7808 KB | Output is correct |
7 | Correct | 8 ms | 7808 KB | Output is correct |
8 | Correct | 8 ms | 7796 KB | Output is correct |
9 | Correct | 8 ms | 7796 KB | Output is correct |
10 | Correct | 8 ms | 7780 KB | Output is correct |
11 | Correct | 8 ms | 7780 KB | Output is correct |
12 | Correct | 8 ms | 7808 KB | Output is correct |
13 | Correct | 8 ms | 7772 KB | Output is correct |
14 | Correct | 9 ms | 7808 KB | Output is correct |
15 | Correct | 8 ms | 7808 KB | Output is correct |
16 | Correct | 9 ms | 7780 KB | Output is correct |
17 | Correct | 9 ms | 7808 KB | Output is correct |
18 | Correct | 9 ms | 7808 KB | Output is correct |
19 | Correct | 9 ms | 7808 KB | Output is correct |
20 | Correct | 54 ms | 10508 KB | Output is correct |
21 | Correct | 51 ms | 10628 KB | Output is correct |
22 | Correct | 59 ms | 10468 KB | Output is correct |
23 | Correct | 57 ms | 10616 KB | Output is correct |
24 | Correct | 176 ms | 13944 KB | Output is correct |
25 | Correct | 181 ms | 13872 KB | Output is correct |
26 | Correct | 154 ms | 13744 KB | Output is correct |
27 | Correct | 139 ms | 18008 KB | Output is correct |
28 | Correct | 133 ms | 18028 KB | Output is correct |
29 | Correct | 130 ms | 16576 KB | Output is correct |
30 | Correct | 148 ms | 14720 KB | Output is correct |
31 | Correct | 152 ms | 14604 KB | Output is correct |
32 | Correct | 132 ms | 14432 KB | Output is correct |
33 | Correct | 138 ms | 15128 KB | Output is correct |
34 | Correct | 151 ms | 14616 KB | Output is correct |
35 | Correct | 136 ms | 15016 KB | Output is correct |
36 | Correct | 139 ms | 15424 KB | Output is correct |
37 | Correct | 146 ms | 14712 KB | Output is correct |
38 | Correct | 131 ms | 14900 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 7424 KB | Output is correct |
2 | Correct | 7 ms | 7424 KB | Output is correct |
3 | Correct | 7 ms | 7424 KB | Output is correct |
4 | Correct | 7 ms | 7424 KB | Output is correct |
5 | Correct | 9 ms | 7780 KB | Output is correct |
6 | Correct | 8 ms | 7808 KB | Output is correct |
7 | Correct | 8 ms | 7808 KB | Output is correct |
8 | Correct | 8 ms | 7796 KB | Output is correct |
9 | Correct | 8 ms | 7796 KB | Output is correct |
10 | Correct | 8 ms | 7780 KB | Output is correct |
11 | Correct | 8 ms | 7780 KB | Output is correct |
12 | Correct | 8 ms | 7808 KB | Output is correct |
13 | Correct | 8 ms | 7772 KB | Output is correct |
14 | Correct | 9 ms | 7808 KB | Output is correct |
15 | Correct | 8 ms | 7808 KB | Output is correct |
16 | Correct | 9 ms | 7780 KB | Output is correct |
17 | Correct | 9 ms | 7808 KB | Output is correct |
18 | Correct | 9 ms | 7808 KB | Output is correct |
19 | Correct | 9 ms | 7808 KB | Output is correct |
20 | Correct | 54 ms | 10508 KB | Output is correct |
21 | Correct | 51 ms | 10628 KB | Output is correct |
22 | Correct | 59 ms | 10468 KB | Output is correct |
23 | Correct | 57 ms | 10616 KB | Output is correct |
24 | Correct | 176 ms | 13944 KB | Output is correct |
25 | Correct | 181 ms | 13872 KB | Output is correct |
26 | Correct | 154 ms | 13744 KB | Output is correct |
27 | Correct | 139 ms | 18008 KB | Output is correct |
28 | Correct | 133 ms | 18028 KB | Output is correct |
29 | Correct | 130 ms | 16576 KB | Output is correct |
30 | Correct | 148 ms | 14720 KB | Output is correct |
31 | Correct | 152 ms | 14604 KB | Output is correct |
32 | Correct | 132 ms | 14432 KB | Output is correct |
33 | Correct | 138 ms | 15128 KB | Output is correct |
34 | Correct | 151 ms | 14616 KB | Output is correct |
35 | Correct | 136 ms | 15016 KB | Output is correct |
36 | Correct | 139 ms | 15424 KB | Output is correct |
37 | Correct | 146 ms | 14712 KB | Output is correct |
38 | Correct | 131 ms | 14900 KB | Output is correct |
39 | Correct | 1167 ms | 221692 KB | Output is correct |
40 | Correct | 590 ms | 104380 KB | Output is correct |
41 | Correct | 298 ms | 38356 KB | Output is correct |
42 | Correct | 1485 ms | 13380 KB | Output is correct |
43 | Correct | 305 ms | 13412 KB | Output is correct |
44 | Incorrect | 674 ms | 13564 KB | Output isn't correct |
45 | Halted | 0 ms | 0 KB | - |