BdOI 2024 National

4 problems from BdOI 2024 National (contest 106163), difficulty -. 4/4 solutions verified against sample I/O.

4 items

BdOI 2024 National

Special | 4 problems | 4/4 verified | Difficulty - | 4m 2s

#	Problem	Time	✓
A	Circular Land	1m 13s	✓
B	Shortest Path	52s	✓
C	Tom and his tree	55s	✓
D	Prefix Max	1m 2s	✓

Practice › Codeforces Solutions › BdOI 2024 National ›

CF 106163D - Prefix Max

We are given an array and a large number of queries. For each query, we look at a segment of the array and try many different starting points inside that segment. Fix a subarray from index L to R. If we pick a starting position i inside it and look at a[i..

Practice › Codeforces Solutions › BdOI 2024 National ›

CF 106163B - Shortest Path

We are given a complete graph on n cities, where every pair of cities has a direct road. The cost of that direct road is not uniform: it depends on the bitwise AND of the two city values.

Practice › Codeforces Solutions › BdOI 2024 National ›

CF 106163A - Circular Land

We are given a circular arrangement of villages, where each village has a single crop type. A valid “cut” means splitting the circle into two non-empty connected parts.

Practice › Codeforces Solutions › BdOI 2024 National ›

CF 106163C - Tom and his tree

We are given a tree with $n$ nodes, and for each node we know its degree in the tree. Then every degree is decreased by one, so each value $d[i]$ now represents $deg(i) - 1$.