# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
89303 | vvash17 | 새로운 문제 (POI13_luk) | C++14 | 2054 ms | 35304 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
#include <iostream>
#include <set>
using namespace std;
map<int,vector<int> > graph;
int city_num,from,to;
int evaluate_result(int search_start,int need_num,int* been_there){
int available_neigbours = 0;
int sub_tree_res = 0;
been_there[search_start]++;
for(int i = 0; i<graph[search_start].size(); i++){
if(been_there[graph[search_start][i]] == 0){
available_neigbours++;
sub_tree_res += evaluate_result(graph[search_start][i],need_num,been_there);
}
}
int res = available_neigbours-(need_num-sub_tree_res);
if(res <= 0)return 0;
return res;
}
int search_init(int need_num){
if(need_num <= 1)return -1;
if(need_num == 1)return need_num;
int been_there[city_num];
for(int i = 0; i<city_num; i++)been_there[i] = 0;
return evaluate_result(1,need_num,been_there);
}
int main() {
scanf("%d",&city_num);
for(int i = 1; i<city_num; i++){
scanf("%d %d", &from, &to);
graph[from].push_back(to);
graph[to].push_back(from);
}
int result = 1;
for(int need_num = 1; need_num<=city_num; need_num++){
result = search_init(need_num);
if(result == 0){
result = need_num;
break;
}
}
printf("%d \n",&result);
return 0;
}
컴파일 시 표준 에러 (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... |