# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
88908 | 2018-12-09T18:56:42 Z | sailormoon | Triumphal arch (POI13_luk) | C++14 | 1417 ms | 59000 KB |
#include <string> #include <algorithm> #include <iostream> #include <vector> using namespace std; int canHandle(int v, int crs, bool visited[]); vector<vector<int>> graph (1000001); // size int main() { int n, a, b, start = 0, midpoint, end, cities; // n -> towns, a -> from, b -> to scanf("%d", &n); end = n; // last point for (int i = 1; i < n; i++) { scanf("%d %d", &a, &b); graph[a].push_back(b); graph[b].push_back(a); } // binary search for sufficient amount of crews while (start < end) { bool visited[1000001]; midpoint = (start + end) / 2; for (int i = 1; i <= n; i++) visited[i] = false; // clear array if (canHandle(1, midpoint, visited) == 0) end = midpoint; else start = ++midpoint; } printf("%d\n", start); return 0; } int canHandle(int v, int crs, bool visited[]) { int num_children = 0, need_crews = 0; visited[v] = true; for (int i = 0; i < graph[v].size(); i++) { if (!visited[graph[v][i]]) { num_children++; need_crews += canHandle(graph[v][i], crs, visited); } } if (num_children + need_crews - crs <= 0) return 0; return num_children + need_crews - crs; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 26 ms | 23800 KB | Output is correct |
2 | Correct | 27 ms | 23928 KB | Output is correct |
3 | Correct | 25 ms | 24008 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 26 ms | 24008 KB | Output is correct |
2 | Correct | 23 ms | 24008 KB | Output is correct |
3 | Correct | 22 ms | 24008 KB | Output is correct |
4 | Correct | 22 ms | 24008 KB | Output is correct |
5 | Correct | 22 ms | 24008 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 26 ms | 24008 KB | Output is correct |
2 | Correct | 27 ms | 24008 KB | Output is correct |
3 | Correct | 27 ms | 24068 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 23 ms | 24068 KB | Output is correct |
2 | Correct | 22 ms | 24172 KB | Output is correct |
3 | Correct | 24 ms | 24212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 35 ms | 24500 KB | Output is correct |
2 | Correct | 35 ms | 24976 KB | Output is correct |
3 | Correct | 28 ms | 24976 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 63 ms | 25804 KB | Output is correct |
2 | Correct | 62 ms | 27016 KB | Output is correct |
3 | Correct | 50 ms | 27016 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 190 ms | 30008 KB | Output is correct |
2 | Correct | 256 ms | 32380 KB | Output is correct |
3 | Correct | 103 ms | 32380 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 681 ms | 36776 KB | Output is correct |
2 | Correct | 783 ms | 41924 KB | Output is correct |
3 | Correct | 195 ms | 41924 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1417 ms | 47144 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1263 ms | 51020 KB | Output is correct |
2 | Correct | 1367 ms | 59000 KB | Output is correct |
3 | Correct | 455 ms | 59000 KB | Output is correct |