oj.uz

Submission #89329

# Submission time Handle Problem Language Result Execution time Memory
89329 2018-12-11T18:08:14 Z vvash17 Triumphal arch (POI13_luk) C++14
70 / 100
 2000 ms 26688 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]++;
	int neighbour_size = graph[search_start].size();
	for(int i = 0; i<neighbour_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;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7288 KB Output is correct
2 Correct 8 ms 7328 KB Output is correct
3 Correct 8 ms 7332 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7464 KB Output is correct
2 Correct 9 ms 7464 KB Output is correct
3 Correct 9 ms 7508 KB Output is correct
4 Correct 9 ms 7584 KB Output is correct
5 Correct 8 ms 7584 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7660 KB Output is correct
2 Correct 9 ms 7660 KB Output is correct
3 Correct 8 ms 7660 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7660 KB Output is correct
2 Correct 8 ms 7660 KB Output is correct
3 Correct 9 ms 7660 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 7932 KB Output is correct
2 Correct 20 ms 8444 KB Output is correct
3 Correct 43 ms 8444 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 8700 KB Output is correct
2 Correct 39 ms 10044 KB Output is correct
3 Correct 312 ms 10044 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 210 ms 11364 KB Output is correct
2 Correct 191 ms 14168 KB Output is correct
3 Execution timed out 2005 ms 14168 KB Time limit exceeded

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 582 ms 14972 KB Output is correct
2 Correct 433 ms 22040 KB Output is correct
3 Execution timed out 2081 ms 22040 KB Time limit exceeded

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1095 ms 22040 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 966 ms 22040 KB Output is correct
2 Correct 558 ms 26688 KB Output is correct
3 Execution timed out 2050 ms 26688 KB Time limit exceeded