Submission #88852

#	Time	Username	Problem	Language	Result	Execution time	Memory
88852		zviki	Triumphal arch (POI13_luk)	C++14	0 / 100	131 ms	132096 KiB

luk

#include <iostream>
#include <algorithm>
#include <stdio.h> 
#include <string.h>

#define 	avg(a, b) 	((a + b) / 2)
#define 	ARR_SIZE 	10000

using namespace std;

int map_of_cities[ARR_SIZE][ARR_SIZE];

int num_not_satisfy(bool visited_set[], int num_workers, int city)
{	
	int i, child_city, children = map_of_cities[city][0], rec_res = 0, num_children = 0;
	visited_set[city] = true;
	for (i = 1; i <= children; i++) {
		child_city = map_of_cities[city][i];
		if (visited_set[child_city] ==  false) {
			num_children++;
			rec_res += num_not_satisfy(visited_set, num_workers, child_city);
		}	
	}
	if (num_children + rec_res < num_workers) {
		return 0;
	} else {
		return children + rec_res - num_workers;
	}
}

int main() 
{
	int n, i, res, bsearch_start, bsearch_end, bsearch_mid, road_from, road_to; 	
	cin >> n;
	for (i = 0; i < ARR_SIZE; i++) { 
		memset(map_of_cities[i], 0, ARR_SIZE * sizeof(int));
	}
	for (i = 1; i < n; i++) {
		cin >> road_from >> road_to;
		map_of_cities[road_from][++(map_of_cities[road_from][0])] = road_to;
		map_of_cities[road_to][++(map_of_cities[road_to][0])] = road_from;
	}

	for (bsearch_start = 0, bsearch_end = n; bsearch_start < bsearch_end; ) {
		bsearch_mid = avg(bsearch_start, bsearch_end);
		bool visited_set[ARR_SIZE] = { false };
		res = num_not_satisfy(visited_set, bsearch_mid, 1);
		if (res != 0) {
			bsearch_start = bsearch_mid + 1;
		} else {
			bsearch_end = bsearch_mid;
		}
	}

	res = bsearch_start;
	cout << res << endl;
	return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10