oj.uz

답안 #88895

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
88895 2018-12-09T18:39:03 Z zviki Triumphal arch (POI13_luk) C++14
100 / 100
 1652 ms 25332 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <unordered_set>

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

using namespace std;
	
int 
num_not_satisfy(int visited_set[], int num_workers, int city, vector<vector<int>> & map_of_cities)
{	
	int i, child_city, children, rec_res, num_children;
	for (i = 0, rec_res = 0, visited_set[city] = 1, children = map_of_cities[city].size(), num_children = 0; i < children; i++) {
		child_city = map_of_cities[city][i];
		if (visited_set[child_city] !=  0) {
			goto nextiteration;
		}
		num_children++;
		rec_res += num_not_satisfy(visited_set, num_workers, child_city, map_of_cities);
		nextiteration: ;
	}
	return ((num_children + rec_res - num_workers <= 0) ? 0 : (num_children + rec_res - num_workers));
}
	
int 
main(int argc, char * argv[]) 
{
	int n, i, res, bsearch_start, bsearch_end, bsearch_mid, road_from, road_to; 	
	cin >> n;
	vector<vector<int>> map_of_cities;
	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);
	}
	for (bsearch_start = 0, bsearch_end = n; bsearch_start < bsearch_end; ) {
		bsearch_mid = avg(bsearch_start, bsearch_end);
		int visited_set[n + 5] = { 0 };
		res = num_not_satisfy(visited_set, bsearch_mid, 0, map_of_cities);
		((res != 0) ? (bsearch_start = bsearch_mid + 1) : (bsearch_end = bsearch_mid));
	}
	
	res = bsearch_start;
	cout << res << endl;
	return 0;

}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 516 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 516 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 2 ms 600 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 2 ms 600 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 616 KB Output is correct
2 Correct 3 ms 616 KB Output is correct
3 Correct 3 ms 616 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 1124 KB Output is correct
2 Correct 16 ms 1380 KB Output is correct
3 Correct 12 ms 1380 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 2364 KB Output is correct
2 Correct 55 ms 3444 KB Output is correct
3 Correct 40 ms 3444 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 210 ms 6632 KB Output is correct
2 Correct 244 ms 9044 KB Output is correct
3 Correct 120 ms 9044 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 587 ms 12836 KB Output is correct
2 Correct 598 ms 18536 KB Output is correct
3 Correct 374 ms 18536 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1489 ms 18832 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1652 ms 18832 KB Output is correct
2 Correct 1599 ms 25332 KB Output is correct
3 Correct 508 ms 25332 KB Output is correct