oj.uz

Submission #856895

# Submission time Handle Problem Language Result Execution time Memory
856895 2023-10-04T19:20:17 Z MikolajKolek Triumphal arch (POI13_luk) C++17
30 / 100
 175 ms 23124 KB 
#include <bits/stdc++.h>

using namespace std;

void BFS(const vector<vector<int>> &G, vector<bool> &vis, vector<int> &res) {
	//Index, sum, layer
	queue<tuple<int, int, int>> q;
	q.push({0, 0, 0});
	res[0] = 0;

	while(!q.empty()) {
		auto [index, sum, layer] = q.front();
		q.pop();
		vis[index] = true; sum += G[index].size() - 1; layer++;

		int answer = max((sum + layer - 1) / layer, res[index]);
		//int answer = max(ceil(sum / layer), res[index]);
		for(const auto &element : G[index]) {
			if(!vis[element]) {
				q.push({element, sum, layer});
				res[element] = answer;
			}
		}
	}
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int n = *istream_iterator<int>(cin);
	vector<vector<int>> G(n, vector<int>());
	G[0].push_back(0);
	for(int i = 0; i < n - 1; i++) {
		int a = *istream_iterator<int>(cin), b = *istream_iterator<int>(cin); 

		G[a - 1].push_back(b - 1);
		G[b - 1].push_back(a - 1);
	}

	vector<bool> vis(n, false);
	vector<int> res(n);
	BFS(G, vis, res);

	cout << *max_element(res.begin(), res.end());

	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1112 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 2648 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 7772 KB Output is correct
2 Correct 31 ms 7504 KB Output is correct
3 Incorrect 23 ms 9052 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 87 ms 15184 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 175 ms 22864 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 156 ms 23124 KB Output isn't correct
2 Halted 0 ms 0 KB -