# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
88909 | 2018-12-09T19:00:38 Z | sailormoon | Triumphal arch (POI13_luk) | C++14 | 1056 ms | 39492 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++) { int cur = graph[v][i]; if (!visited[cur]) { num_children++; need_crews += canHandle(cur, crs, visited); } } if (num_children + need_crews - crs <= 0) return 0; return num_children + need_crews - crs; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 25 ms | 23800 KB | Output is correct |
2 | Correct | 25 ms | 23800 KB | Output is correct |
3 | Correct | 22 ms | 23840 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 25 ms | 23864 KB | Output is correct |
2 | Correct | 22 ms | 23888 KB | Output is correct |
3 | Correct | 24 ms | 23936 KB | Output is correct |
4 | Correct | 26 ms | 24120 KB | Output is correct |
5 | Correct | 25 ms | 24120 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 24 ms | 24120 KB | Output is correct |
2 | Correct | 26 ms | 24120 KB | Output is correct |
3 | Correct | 26 ms | 24120 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 22 ms | 24120 KB | Output is correct |
2 | Correct | 23 ms | 24120 KB | Output is correct |
3 | Correct | 22 ms | 24120 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 36 ms | 24340 KB | Output is correct |
2 | Correct | 39 ms | 24516 KB | Output is correct |
3 | Correct | 27 ms | 24516 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 58 ms | 25028 KB | Output is correct |
2 | Correct | 54 ms | 25964 KB | Output is correct |
3 | Correct | 39 ms | 25964 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 180 ms | 27384 KB | Output is correct |
2 | Correct | 189 ms | 29328 KB | Output is correct |
3 | Correct | 89 ms | 29328 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 560 ms | 30892 KB | Output is correct |
2 | Correct | 480 ms | 35384 KB | Output is correct |
3 | Correct | 233 ms | 35384 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1016 ms | 35384 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1056 ms | 35384 KB | Output is correct |
2 | Correct | 931 ms | 39492 KB | Output is correct |
3 | Correct | 398 ms | 39492 KB | Output is correct |