# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
89316 | 2018-12-11T17:48:55 Z | vvash17 | Triumphal arch (POI13_luk) | C++14 | 2000 ms | 23908 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[300001]; 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 7416 KB | Output is correct |
2 | Correct | 9 ms | 7516 KB | Output is correct |
3 | Correct | 9 ms | 7516 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 7552 KB | Output is correct |
2 | Correct | 9 ms | 7588 KB | Output is correct |
3 | Correct | 9 ms | 7632 KB | Output is correct |
4 | Correct | 9 ms | 7632 KB | Output is correct |
5 | Correct | 9 ms | 7632 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 7636 KB | Output is correct |
2 | Correct | 8 ms | 7636 KB | Output is correct |
3 | Correct | 8 ms | 7636 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 7636 KB | Output is correct |
2 | Correct | 9 ms | 7732 KB | Output is correct |
3 | Correct | 9 ms | 7732 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 21 ms | 7908 KB | Output is correct |
2 | Correct | 18 ms | 8164 KB | Output is correct |
3 | Correct | 40 ms | 8164 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 49 ms | 8676 KB | Output is correct |
2 | Correct | 38 ms | 9572 KB | Output is correct |
3 | Correct | 281 ms | 9572 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 164 ms | 11236 KB | Output is correct |
2 | Correct | 132 ms | 13140 KB | Output is correct |
3 | Execution timed out | 2035 ms | 13140 KB | Time limit exceeded |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 690 ms | 14992 KB | Output is correct |
2 | Correct | 371 ms | 19752 KB | Output is correct |
3 | Execution timed out | 2041 ms | 19752 KB | Time limit exceeded |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1132 ms | 19752 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1087 ms | 19752 KB | Output is correct |
2 | Correct | 513 ms | 23908 KB | Output is correct |
3 | Execution timed out | 2062 ms | 23908 KB | Time limit exceeded |