# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
88844 | 2018-12-09T08:25:45 Z | sailormoon | Triumphal arch (POI13_luk) | C++14 | 79 ms | 1892 KB |
#include <map> #include <string> #include <algorithm> #include <iostream> #include <vector> #include <set> using namespace std; vector<vector<int>> graph (10000); // size set<int> visited; int canHandle(int v, int crs) { int num_children = 0, need_crews = 0; visited.insert(v); for (int i = 0; i < graph[v].size(); i++) { if (visited.find(graph[v][i]) == visited.end()) { 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; // n -> towns, a -> from, b -> to scanf("%d", &n); 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; if (canHandle(1, midpoint) == 0) end = midpoint; else start = ++midpoint; visited.clear(); } printf("%d\n", start); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Correct | 2 ms | 756 KB | Output is correct |
3 | Correct | 3 ms | 756 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 756 KB | Output is correct |
2 | Correct | 2 ms | 768 KB | Output is correct |
3 | Correct | 2 ms | 768 KB | Output is correct |
4 | Correct | 2 ms | 796 KB | Output is correct |
5 | Correct | 2 ms | 796 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 796 KB | Output is correct |
2 | Correct | 3 ms | 796 KB | Output is correct |
3 | Correct | 2 ms | 816 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 860 KB | Output is correct |
2 | Correct | 5 ms | 988 KB | Output is correct |
3 | Correct | 5 ms | 988 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 75 ms | 1632 KB | Output is correct |
2 | Correct | 79 ms | 1892 KB | Output is correct |
3 | Correct | 60 ms | 1892 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 1892 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 1892 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 1892 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 1892 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 5 ms | 1892 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |