oj.uz

Submission #89302

# Submission time Handle Problem Language Result Execution time Memory
89302 2018-12-11T17:22:04 Z vvash17 Triumphal arch (POI13_luk) C++14
40 / 100
 2000 ms 35244 KB 

#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
#include <iostream>
#include <set>
using namespace std;

map<int,vector<int> > graph;
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 2 ms 256 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 2 ms 448 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 464 KB Output is correct
2 Correct 2 ms 520 KB Output is correct
3 Correct 2 ms 540 KB Output is correct
4 Incorrect 2 ms 540 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 2 ms 544 KB Output is correct
2 Correct 2 ms 672 KB Output is correct
3 Correct 2 ms 672 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 1768 KB Output is correct
2 Correct 28 ms 2152 KB Output is correct
3 Correct 863 ms 2152 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 348 ms 4092 KB Output is correct
2 Correct 91 ms 5372 KB Output is correct
3 Execution timed out 2007 ms 5372 KB Time limit exceeded

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1664 ms 12192 KB Output is correct
2 Correct 492 ms 13644 KB Output is correct
3 Execution timed out 2054 ms 13644 KB Time limit exceeded

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2058 ms 23644 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2064 ms 35124 KB Time limit exceeded

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2053 ms 35244 KB Time limit exceeded
2 Halted 0 ms 0 KB -