oj.uz

Submission #89320

# Submission time Handle Problem Language Result Execution time Memory
89320 2018-12-11T17:55:32 Z vvash17 Triumphal arch (POI13_luk) C++14
70 / 100
 2000 ms 24048 KB 

#include <cstdio>
#include <vector>
#include <map>
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){
	int been_there[city_num+1] = {0};
	return evaluate_result(1,need_num,been_there);
}
int main() {
	scanf("%d",&city_num);
	for(int i = 1; i<city_num; i++){
		scanf("%d %d",&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;
		}
	}
	
	printf("%d",result);
    return 0;
}

Compilation message

luk.cpp: In function 'int evaluate_result(int, int&, int*)':
luk.cpp:17:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i<graph[search_start].size(); i++){
                 ~^~~~~~~~~~~~~~~~~~~~~~~~~~~
luk.cpp: In function 'int main()':
luk.cpp:33:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&city_num);
  ~~~~~^~~~~~~~~~~~~~~~
luk.cpp:35:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&from,&to);
   ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7292 KB Output is correct
2 Correct 8 ms 7412 KB Output is correct
3 Correct 8 ms 7488 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7488 KB Output is correct
2 Correct 8 ms 7488 KB Output is correct
3 Correct 8 ms 7692 KB Output is correct
4 Correct 8 ms 7692 KB Output is correct
5 Correct 8 ms 7692 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 7900 KB Output is correct
2 Correct 15 ms 8284 KB Output is correct
3 Correct 35 ms 8284 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 8796 KB Output is correct
2 Correct 29 ms 9568 KB Output is correct
3 Correct 300 ms 9568 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 11408 KB Output is correct
2 Correct 122 ms 13152 KB Output is correct
3 Execution timed out 2021 ms 13152 KB Time limit exceeded

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 414 ms 15028 KB Output is correct
2 Correct 218 ms 19608 KB Output is correct
3 Execution timed out 2032 ms 19608 KB Time limit exceeded

Subtask #9
10.0 / 10.0

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

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 767 ms 19608 KB Output is correct
2 Correct 383 ms 24048 KB Output is correct
3 Execution timed out 2045 ms 24048 KB Time limit exceeded