# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
841413 | 2023-09-01T15:39:27 Z | model_code | 참나무 (IOI23_beechtree) | C++17 | 2000 ms | 858084 KB |
// correct/sol_db_twoColors-mediumN.cpp #include "beechtree.h" #include <bits/stdc++.h> #define all(x) (x).begin(), (x).end() #define xx first #define yy second using namespace std; typedef pair<int, int> pii; const int N = 2e5 + 1; struct Graph { int cnt[N]; bool con[N]; vector<int> adj[N][2]; vector<pii> srt[N]; } graph; bool check(int v, int u) { for (int c = 0; c < 2; ++c) { if (graph.adj[v][c].empty()) { continue; } if (graph.adj[u][c].empty()) { return false; } if (graph.cnt[graph.adj[v][c][0]] > graph.cnt[graph.adj[u][c][0]]) { return false; } } return true; } int dfs(int u) { graph.cnt[u] = 1; graph.con[u] = true; for (int c = 0; c < 2; ++c) { auto &vec = graph.adj[u][c]; graph.con[u] &= vec.size() <= 1; for (int v : vec) { int cnv = dfs(v); if (cnv == -1) { graph.con[u] = false; } else { graph.cnt[u] += cnv; } for (pii p : graph.srt[v]) { graph.srt[u].push_back(p); } } } graph.srt[u].push_back({graph.cnt[u], u}); sort(all(graph.srt[u])); for (int i = 0; i < graph.srt[u].size() - 1; ++i) { graph.con[u] = graph.con[u] & check(graph.srt[u][i].yy, graph.srt[u][i + 1].yy); } return graph.con[u] ? graph.cnt[u] : -1; } vector<int> beechtree(int n, int m, vector<int> P, vector<int> C) { for (int i = 1; i < n; ++i) { int p = P[i]; int c = C[i]; graph.adj[p][c - 1].push_back(i); } dfs(0); vector<int> ans; for (int i = 0; i < n; ++i) ans.push_back(graph.con[i]); return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 14292 KB | Output is correct |
2 | Incorrect | 7 ms | 14292 KB | 2nd lines differ - on the 2nd token, expected: '1', found: '0' |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 14292 KB | Output is correct |
2 | Correct | 6 ms | 14292 KB | Output is correct |
3 | Incorrect | 7 ms | 14292 KB | 2nd lines differ - on the 2nd token, expected: '1', found: '0' |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 14292 KB | Output is correct |
2 | Correct | 6 ms | 14292 KB | Output is correct |
3 | Incorrect | 7 ms | 14292 KB | 2nd lines differ - on the 2nd token, expected: '1', found: '0' |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 7 ms | 14352 KB | 2nd lines differ - on the 1st token, expected: '0', found: '1' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 14292 KB | Output is correct |
2 | Correct | 6 ms | 14292 KB | Output is correct |
3 | Correct | 6 ms | 14292 KB | Output is correct |
4 | Correct | 6 ms | 14292 KB | Output is correct |
5 | Incorrect | 88 ms | 23796 KB | 2nd lines differ - on the 1st token, expected: '0', found: '1' |
6 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 14292 KB | Output is correct |
2 | Incorrect | 7 ms | 14292 KB | 2nd lines differ - on the 2nd token, expected: '1', found: '0' |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 14292 KB | Output is correct |
2 | Correct | 6 ms | 14292 KB | Output is correct |
3 | Correct | 6 ms | 14292 KB | Output is correct |
4 | Correct | 6 ms | 14292 KB | Output is correct |
5 | Correct | 7 ms | 14320 KB | Output is correct |
6 | Correct | 7 ms | 14292 KB | Output is correct |
7 | Correct | 8 ms | 14384 KB | Output is correct |
8 | Correct | 8 ms | 14408 KB | Output is correct |
9 | Correct | 10 ms | 14340 KB | Output is correct |
10 | Correct | 7 ms | 14292 KB | Output is correct |
11 | Correct | 7 ms | 14292 KB | Output is correct |
12 | Correct | 8 ms | 14336 KB | Output is correct |
13 | Correct | 10 ms | 14308 KB | Output is correct |
14 | Correct | 7 ms | 14292 KB | Output is correct |
15 | Correct | 7 ms | 14376 KB | Output is correct |
16 | Correct | 7 ms | 14300 KB | Output is correct |
17 | Correct | 7 ms | 14292 KB | Output is correct |
18 | Correct | 8 ms | 14324 KB | Output is correct |
19 | Correct | 9 ms | 14292 KB | Output is correct |
20 | Correct | 9 ms | 14292 KB | Output is correct |
21 | Correct | 9 ms | 14292 KB | Output is correct |
22 | Correct | 8 ms | 14292 KB | Output is correct |
23 | Correct | 9 ms | 14348 KB | Output is correct |
24 | Correct | 8 ms | 14292 KB | Output is correct |
25 | Correct | 46 ms | 34784 KB | Output is correct |
26 | Correct | 103 ms | 34828 KB | Output is correct |
27 | Correct | 138 ms | 34848 KB | Output is correct |
28 | Correct | 208 ms | 34900 KB | Output is correct |
29 | Correct | 47 ms | 34892 KB | Output is correct |
30 | Correct | 12 ms | 16596 KB | Output is correct |
31 | Correct | 8 ms | 14688 KB | Output is correct |
32 | Correct | 10 ms | 14760 KB | Output is correct |
33 | Correct | 11 ms | 15060 KB | Output is correct |
34 | Correct | 8 ms | 14676 KB | Output is correct |
35 | Correct | 8 ms | 14676 KB | Output is correct |
36 | Correct | 10 ms | 14548 KB | Output is correct |
37 | Correct | 21 ms | 19792 KB | Output is correct |
38 | Correct | 14 ms | 16836 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 14292 KB | Output is correct |
2 | Incorrect | 7 ms | 14292 KB | 2nd lines differ - on the 2nd token, expected: '1', found: '0' |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 14292 KB | Output is correct |
2 | Correct | 6 ms | 14292 KB | Output is correct |
3 | Correct | 6 ms | 14292 KB | Output is correct |
4 | Correct | 6 ms | 14292 KB | Output is correct |
5 | Correct | 7 ms | 14320 KB | Output is correct |
6 | Correct | 7 ms | 14292 KB | Output is correct |
7 | Correct | 8 ms | 14384 KB | Output is correct |
8 | Correct | 8 ms | 14408 KB | Output is correct |
9 | Correct | 10 ms | 14340 KB | Output is correct |
10 | Correct | 7 ms | 14292 KB | Output is correct |
11 | Correct | 7 ms | 14292 KB | Output is correct |
12 | Correct | 8 ms | 14336 KB | Output is correct |
13 | Correct | 10 ms | 14308 KB | Output is correct |
14 | Correct | 7 ms | 14292 KB | Output is correct |
15 | Correct | 7 ms | 14376 KB | Output is correct |
16 | Correct | 7 ms | 14300 KB | Output is correct |
17 | Correct | 7 ms | 14292 KB | Output is correct |
18 | Correct | 8 ms | 14324 KB | Output is correct |
19 | Correct | 9 ms | 14292 KB | Output is correct |
20 | Correct | 9 ms | 14292 KB | Output is correct |
21 | Correct | 9 ms | 14292 KB | Output is correct |
22 | Correct | 8 ms | 14292 KB | Output is correct |
23 | Correct | 9 ms | 14348 KB | Output is correct |
24 | Correct | 8 ms | 14292 KB | Output is correct |
25 | Correct | 46 ms | 34784 KB | Output is correct |
26 | Correct | 103 ms | 34828 KB | Output is correct |
27 | Correct | 138 ms | 34848 KB | Output is correct |
28 | Correct | 208 ms | 34900 KB | Output is correct |
29 | Correct | 47 ms | 34892 KB | Output is correct |
30 | Correct | 12 ms | 16596 KB | Output is correct |
31 | Correct | 8 ms | 14688 KB | Output is correct |
32 | Correct | 10 ms | 14760 KB | Output is correct |
33 | Correct | 11 ms | 15060 KB | Output is correct |
34 | Correct | 8 ms | 14676 KB | Output is correct |
35 | Correct | 8 ms | 14676 KB | Output is correct |
36 | Correct | 10 ms | 14548 KB | Output is correct |
37 | Correct | 21 ms | 19792 KB | Output is correct |
38 | Correct | 14 ms | 16836 KB | Output is correct |
39 | Execution timed out | 2077 ms | 858084 KB | Time limit exceeded |
40 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 14292 KB | Output is correct |
2 | Incorrect | 7 ms | 14292 KB | 2nd lines differ - on the 2nd token, expected: '1', found: '0' |
3 | Halted | 0 ms | 0 KB | - |