# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
89327 | 2018-12-11T18:04:49 Z | vvash17 | Triumphal arch (POI13_luk) | C++14 | 2000 ms | 25364 KB |
#include <iostream> #include <vector> 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++){ int tmp = graph[search_start][i]; if(been_there[tmp] == 0){ available_neigbours++; sub_tree_res += evaluate_result(tmp,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] = {0}; int start = 1; return evaluate_result(start,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 | 8 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 | 7 ms | 7488 KB | Output is correct |
2 | Correct | 7 ms | 7508 KB | Output is correct |
3 | Correct | 9 ms | 7508 KB | Output is correct |
4 | Correct | 9 ms | 7524 KB | Output is correct |
5 | Correct | 9 ms | 7568 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 7568 KB | Output is correct |
2 | Correct | 8 ms | 7568 KB | Output is correct |
3 | Correct | 8 ms | 7568 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 7628 KB | Output is correct |
2 | Correct | 9 ms | 7756 KB | Output is correct |
3 | Correct | 9 ms | 7756 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 22 ms | 7904 KB | Output is correct |
2 | Correct | 21 ms | 8288 KB | Output is correct |
3 | Correct | 47 ms | 8288 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 58 ms | 8672 KB | Output is correct |
2 | Correct | 43 ms | 9952 KB | Output is correct |
3 | Correct | 365 ms | 9952 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 197 ms | 11304 KB | Output is correct |
2 | Correct | 158 ms | 13664 KB | Output is correct |
3 | Execution timed out | 2027 ms | 13664 KB | Time limit exceeded |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 805 ms | 15076 KB | Output is correct |
2 | Correct | 395 ms | 20832 KB | Output is correct |
3 | Execution timed out | 2035 ms | 20832 KB | Time limit exceeded |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1275 ms | 20832 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1320 ms | 20832 KB | Output is correct |
2 | Correct | 671 ms | 25364 KB | Output is correct |
3 | Execution timed out | 2048 ms | 25364 KB | Time limit exceeded |