oj.uz

Submission #88862

# Submission time Handle Problem Language Result Execution time Memory
88862 2018-12-09T11:47:53 Z 123456 Triumphal arch (POI13_luk) C++14
90 / 100
 1846 ms 22892 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;


vector<vector<int>> graph;
vector<bool> visited;


int check(int currentCity, int k) {
	int childrenSum = 0;

	visited[currentCity] = true;
	
	for (int i = 0; i < graph[currentCity].size(); i++) {
		if (!visited[graph[currentCity][i]]) {
			childrenSum += check(graph[currentCity][i], k);
		}
	}

	int numberOfChildren = graph[currentCity].size() - 1;
	if (currentCity == 0) numberOfChildren++;
	return max(0, numberOfChildren + childrenSum - k);
}

int main() {
	int numberOfTowns;
	cin >> numberOfTowns;
	if (numberOfTowns < 0) {
		return 0;
	}
	visited.resize(numberOfTowns);
	graph.resize(numberOfTowns);
	for (int i = 0; i < numberOfTowns - 1; i++) {
		int a, b;
		cin >> a >> b;
		a--;
		b--;

		graph[a].push_back(b);
		graph[b].push_back(a);
	}

	int start = 1;
	int end = numberOfTowns;

	int currentK;
	while (start < end) {
		for (int i = 0; i < numberOfTowns; i++) {
			visited[i] = false;	
		}
		currentK = (start + end) / 2;
		if (!check(0, currentK)) {
			end = currentK;
		}
		else {
			start = currentK + 1;
		}
	}
	cout << start << endl;
	
	return 0;
}

Compilation message

luk.cpp: In function 'int check(int, int)':
luk.cpp:16:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < graph[currentCity].size(); i++) {
                  ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 528 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 528 KB Output is correct
2 Correct 3 ms 528 KB Output is correct
3 Correct 2 ms 528 KB Output is correct
4 Correct 2 ms 528 KB Output is correct
5 Incorrect 2 ms 532 KB Output isn't correct

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1120 KB Output is correct
2 Correct 19 ms 1376 KB Output is correct
3 Correct 12 ms 1376 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 2400 KB Output is correct
2 Correct 55 ms 3168 KB Output is correct
3 Correct 36 ms 3168 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 223 ms 6240 KB Output is correct
2 Correct 309 ms 8112 KB Output is correct
3 Correct 139 ms 8112 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 834 ms 11948 KB Output is correct
2 Correct 977 ms 16500 KB Output is correct
3 Correct 389 ms 16500 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1386 ms 17512 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1846 ms 17560 KB Output is correct
2 Correct 1722 ms 22892 KB Output is correct
3 Correct 800 ms 22892 KB Output is correct