# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
89315 | 2018-12-11T17:47:42 Z | vvash17 | Triumphal arch (POI13_luk) | C++14 | 2000 ms | 22224 KB |
#include <cstdio> #include <vector> #include <map> #include <iostream> using namespace std; vector<int> graph[300001]; 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){ int been_there[city_num+1]; for(int i = 0; i<city_num; i++)been_there[i] = 0; return evaluate_result(1,need_num,been_there); } int main() { cin>>city_num; for(int i = 1; i<city_num; i++){ cin>>from>>to; graph[from].push_back(to); graph[to].push_back(from); } int result = 0; for(int need_num = 0; need_num<=city_num; need_num++){ result = search_init(need_num); if(result == 0){ result = need_num; break; } } cout<<result<<endl; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 7416 KB | Output is correct |
2 | Correct | 7 ms | 7420 KB | Output is correct |
3 | Correct | 7 ms | 7496 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 7540 KB | Output is correct |
2 | Correct | 7 ms | 7572 KB | Output is correct |
3 | Correct | 7 ms | 7600 KB | Output is correct |
4 | Incorrect | 8 ms | 7608 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 7648 KB | Output is correct |
2 | Correct | 8 ms | 7648 KB | Output is correct |
3 | Correct | 8 ms | 7648 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 7648 KB | Output is correct |
2 | Correct | 8 ms | 7648 KB | Output is correct |
3 | Correct | 10 ms | 7648 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 20 ms | 8032 KB | Output is correct |
2 | Correct | 17 ms | 8160 KB | Output is correct |
3 | Correct | 37 ms | 8160 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 49 ms | 8720 KB | Output is correct |
2 | Correct | 37 ms | 9592 KB | Output is correct |
3 | Correct | 287 ms | 9592 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 198 ms | 11268 KB | Output is correct |
2 | Correct | 151 ms | 12380 KB | Output is correct |
3 | Execution timed out | 2021 ms | 12380 KB | Time limit exceeded |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 678 ms | 15040 KB | Output is correct |
2 | Correct | 372 ms | 19552 KB | Output is correct |
3 | Execution timed out | 2027 ms | 19552 KB | Time limit exceeded |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1066 ms | 19552 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 931 ms | 19552 KB | Output is correct |
2 | Correct | 534 ms | 22224 KB | Output is correct |
3 | Execution timed out | 2069 ms | 22224 KB | Time limit exceeded |