oj.uz

Submission #88839

# Submission time Handle Problem Language Result Execution time Memory
88839 2018-12-09T07:40:35 Z zviki Triumphal arch (POI13_luk) C++14
70 / 100
 2000 ms 34896 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>

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

using namespace std;

vector<vector<int>> map_of_cities;

int num_not_satisfy(set<int> & visited_set, int num_workers, int city)
{	
	int i, child_city, children = map_of_cities[city].size(), rec_res, num_children = 0;
	visited_set.insert(city);
	for (i = 0, rec_res = 0; i < children; i++) {
		child_city = map_of_cities[city][i];
		if (visited_set.find(child_city) ==  visited_set.end()) {
			num_children++;
			rec_res += num_not_satisfy(visited_set, num_workers, child_city);
		}	
	}
	if (num_children + rec_res < num_workers) {
		return 0;
	} else {
		return num_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 < n; i++) { 
		vector<int> temp;
		map_of_cities.push_back(temp);
	}
	for (i = 1; i < n; i++) {
		cin >> road_from >> road_to;
		map_of_cities[road_from - 1].push_back(road_to - 1);
		map_of_cities[road_to - 1].push_back(road_from - 1);
	}

	bsearch_start = 0, bsearch_end = n;

	for (; bsearch_start < bsearch_end; ) {
		bsearch_mid = avg(bsearch_start, bsearch_end);
		set<int> visited_set;
		res = num_not_satisfy(visited_set, bsearch_mid, 0);
		if (res != 0) {
			bsearch_start = bsearch_mid + 1;
		} else {
			bsearch_end = bsearch_mid;
		}
	}

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

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 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 500 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 2 ms 520 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 580 KB Output is correct
2 Correct 6 ms 584 KB Output is correct
3 Correct 5 ms 588 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 1612 KB Output is correct
2 Correct 81 ms 2028 KB Output is correct
3 Correct 68 ms 2028 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 367 ms 3928 KB Output is correct
2 Correct 351 ms 5368 KB Output is correct
3 Correct 249 ms 5368 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1760 ms 11856 KB Output is correct
2 Correct 1831 ms 15356 KB Output is correct
3 Correct 1295 ms 15356 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2052 ms 24520 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 2086 ms 34872 KB Time limit exceeded

Subtask #10
0 / 10.0

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