# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
89304 | 2018-12-11T17:28:33 Z | vvash17 | Triumphal arch (POI13_luk) | C++14 | 2000 ms | 7752 KB |
#include <cstdio> #include <vector> #include <algorithm> #include <map> #include <iostream> #include <set> using namespace std; vector<int> graph[100001]; 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() { 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 = 1; for(int need_num = 1; 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 | 4 ms | 2680 KB | Output is correct |
2 | Correct | 4 ms | 2804 KB | Output is correct |
3 | Correct | 4 ms | 2872 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 2872 KB | Output is correct |
2 | Correct | 4 ms | 2960 KB | Output is correct |
3 | Correct | 4 ms | 2960 KB | Output is correct |
4 | Incorrect | 4 ms | 2960 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 2960 KB | Output is correct |
2 | Correct | 4 ms | 2960 KB | Output is correct |
3 | Correct | 4 ms | 2960 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 2968 KB | Output is correct |
2 | Correct | 5 ms | 2968 KB | Output is correct |
3 | Correct | 5 ms | 2968 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 17 ms | 3324 KB | Output is correct |
2 | Correct | 14 ms | 3436 KB | Output is correct |
3 | Correct | 34 ms | 3436 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 45 ms | 3948 KB | Output is correct |
2 | Correct | 34 ms | 4844 KB | Output is correct |
3 | Correct | 293 ms | 4844 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 213 ms | 6648 KB | Output is correct |
2 | Correct | 128 ms | 7752 KB | Output is correct |
3 | Execution timed out | 2050 ms | 7752 KB | Time limit exceeded |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 7 ms | 7752 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 8 ms | 7752 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 8 ms | 7752 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |