oj.uz

Submission #89306

# Submission time Handle Problem Language Result Execution time Memory
89306 2018-12-11T17:32:10 Z vvash17 Triumphal arch (POI13_luk) C++14
60 / 100
 2000 ms 22272 KB 

#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
#include <iostream>
#include <set>
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){
	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

luk.cpp: In function 'int evaluate_result(int, int, int*)':
luk.cpp:20:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i<graph[search_start].size(); i++){
                 ~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7416 KB Output is correct
2 Correct 7 ms 7420 KB Output is correct
3 Correct 9 ms 7624 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7624 KB Output is correct
2 Correct 7 ms 7624 KB Output is correct
3 Correct 36 ms 7668 KB Output is correct
4 Incorrect 7 ms 7668 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 7932 KB Output is correct
2 Correct 18 ms 8188 KB Output is correct
3 Correct 39 ms 8188 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 8724 KB Output is correct
2 Correct 39 ms 9652 KB Output is correct
3 Correct 320 ms 9652 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 250 ms 11260 KB Output is correct
2 Correct 139 ms 12328 KB Output is correct
3 Execution timed out 2061 ms 12328 KB Time limit exceeded

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 431 ms 14972 KB Output is correct
2 Correct 276 ms 19608 KB Output is correct
3 Execution timed out 2040 ms 19608 KB Time limit exceeded

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 991 ms 19608 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1089 ms 19608 KB Output is correct
2 Correct 491 ms 22272 KB Output is correct
3 Execution timed out 2039 ms 22272 KB Time limit exceeded