# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
88900 | sailormoon | 새로운 문제 (POI13_luk) | C++14 | 17 ms | 3940 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <string>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int canHandle(int v, int crs, bool visited[]);
vector<vector<int>> graph (30001); // size
int main() {
int n, a, b, start = 0, midpoint, end, cities; // n -> towns, a -> from, b -> to
scanf("%d", &n);
cities = n; // for further usage
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;
bool visited[3001] = { false };
if (canHandle(1, midpoint, visited) == 0)
end = midpoint;
else
start = midpoint + 1;
}
// if (start == 1) start = 0;
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(crs, graph[v][i], visited);
}
}
if (num_children + need_crews - crs <= 0)
return 0;
return num_children + need_crews - crs;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |