Bangladesh Olympiad in Informatics 2025 National Round Day 1

3 problems from Bangladesh Olympiad in Informatics 2025 National Round Day 1 (contest 105746), difficulty -. 3/3 solutions verified against sample I/O.

3 items

Bangladesh Olympiad in Informatics 2025 National Round Day 1

Special | 3 problems | 3/3 verified | Difficulty - | 3m 10s

#	Problem	Time	✓
A	Cars	1m 3s	✓
B	Home Decoration	1m 5s	✓
C	Travel Agency	1m 2s	✓

Practice › Codeforces Solutions › Bangladesh Olympiad in Informatics 2025 National Round Day 1 ›

CF 105746B - Home Decoration

We are given a tree where every node already has a color, and a desired final color for each node. We are allowed to repaint a node any number in the range from 1 to N, and each repaint counts as one operation.

Practice › Codeforces Solutions › Bangladesh Olympiad in Informatics 2025 National Round Day 1 ›

CF 105746A - Cars

We are tracking a set of cars moving along a straight line. Each car starts at position zero and moves with a constant speed during any query interval. However, the speeds are not fixed globally, they can change over time due to updates.

Practice › Codeforces Solutions › Bangladesh Olympiad in Informatics 2025 National Round Day 1 ›

CF 105746C - Travel Agency

We are given a directed acyclic graph where each city is a node and each road is a directed edge. Traveling along a road costs money, but unlike standard shortest path problems, the cost of each road is not fixed.