# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
88867 | 2018-12-09T12:30:06 Z | sailormoon | Triumphal arch (POI13_luk) | C++14 | 1755 ms | 21692 KB |
#include <map> #include <string> #include <algorithm> #include <iostream> #include <vector> #include <unordered_set> using namespace std; vector<vector<int>> graph (300001); // size bool visited[300001]; int canHandle(int v, int crs) { 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); } } return max(0, num_children + need_crews - crs); } int main() { int n, a, b, start = 0, midpoint, end, cities; // n -> towns, a -> from, b -> to scanf("%d", &n); cities = end = n; // last point n--; while (n--) { 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) { midpoint = (start + end) / 2; fill(visited, visited + cities, false); if (canHandle(1, midpoint) == 0) end = midpoint; else start = ++midpoint; } printf("%d\n", start); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 7288 KB | Output is correct |
2 | Correct | 9 ms | 7288 KB | Output is correct |
3 | Correct | 10 ms | 7492 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 7492 KB | Output is correct |
2 | Correct | 9 ms | 7492 KB | Output is correct |
3 | Correct | 10 ms | 7492 KB | Output is correct |
4 | Incorrect | 9 ms | 7492 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 7512 KB | Output is correct |
2 | Correct | 10 ms | 7552 KB | Output is correct |
3 | Correct | 9 ms | 7552 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 7552 KB | Output is correct |
2 | Correct | 10 ms | 7592 KB | Output is correct |
3 | Correct | 10 ms | 7592 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 23 ms | 7848 KB | Output is correct |
2 | Correct | 21 ms | 7976 KB | Output is correct |
3 | Correct | 14 ms | 8100 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 83 ms | 8616 KB | Output is correct |
2 | Correct | 54 ms | 9256 KB | Output is correct |
3 | Correct | 61 ms | 9256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 297 ms | 11052 KB | Output is correct |
2 | Correct | 211 ms | 12348 KB | Output is correct |
3 | Correct | 111 ms | 12348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 915 ms | 14416 KB | Output is correct |
2 | Correct | 1002 ms | 17660 KB | Output is correct |
3 | Correct | 591 ms | 17660 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1755 ms | 17908 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 919 ms | 17908 KB | Output is correct |
2 | Correct | 1578 ms | 21692 KB | Output is correct |
3 | Correct | 417 ms | 21692 KB | Output is correct |