# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
89323 | 2018-12-11T17:59:51 Z | vvash17 | Triumphal arch (POI13_luk) | C++14 | 2000 ms | 23900 KB |
#include <iostream> #include <vector> #include <map> 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 main() { scanf("%d",&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++){ int been_there[city_num+1] = {0}; result = evaluate_result(1,need_num,been_there); if(result == 0){ result = need_num; break; } } cout<<result<<endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 7288 KB | Output is correct |
2 | Correct | 9 ms | 7412 KB | Output is correct |
3 | Correct | 8 ms | 7488 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 7504 KB | Output is correct |
2 | Correct | 8 ms | 7560 KB | Output is correct |
3 | Correct | 8 ms | 7560 KB | Output is correct |
4 | Correct | 9 ms | 7636 KB | Output is correct |
5 | Correct | 8 ms | 7640 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 7640 KB | Output is correct |
2 | Correct | 8 ms | 7640 KB | Output is correct |
3 | Correct | 8 ms | 7656 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 7676 KB | Output is correct |
2 | Correct | 9 ms | 7676 KB | Output is correct |
3 | Correct | 9 ms | 7676 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 20 ms | 7932 KB | Output is correct |
2 | Correct | 19 ms | 8188 KB | Output is correct |
3 | Correct | 39 ms | 8188 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 52 ms | 8740 KB | Output is correct |
2 | Correct | 39 ms | 9596 KB | Output is correct |
3 | Correct | 295 ms | 9596 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 158 ms | 11260 KB | Output is correct |
2 | Correct | 127 ms | 13092 KB | Output is correct |
3 | Execution timed out | 2097 ms | 13092 KB | Time limit exceeded |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 652 ms | 15100 KB | Output is correct |
2 | Correct | 343 ms | 19560 KB | Output is correct |
3 | Execution timed out | 2033 ms | 19560 KB | Time limit exceeded |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 991 ms | 19560 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 999 ms | 19560 KB | Output is correct |
2 | Correct | 581 ms | 23900 KB | Output is correct |
3 | Execution timed out | 2039 ms | 23900 KB | Time limit exceeded |