Western European Olympiad in Informatics 2024 Mirror

4 problems from Western European Olympiad in Informatics 2024 Mirror (contest 105259), difficulty -. 1/4 solutions verified against sample I/O.

4 items

Western European Olympiad in Informatics 2024 Mirror

Special | 4 problems | 1/4 verified | Difficulty - | 6m 50s

#	Problem	Time	✓
A	Make All Equal	53s	✓
B	Mazes	1m 38s
C	Parcel Post	2m 20s
D	Double Agents	1m 59s

Practice › Codeforces Solutions › Western European Olympiad in Informatics 2024 Mirror ›

CF 105259B - Mazes

The task asks us to construct a grid-based maze where movement is restricted to only going right or down, starting from the top-left cell and ending at the bottom-right cell. Some cells are empty and usable, while others contain hedges that block passage.

Practice › Codeforces Solutions › Western European Olympiad in Informatics 2024 Mirror ›

CF 105259D - Double Agents

We are given a tree representing an organization. Each node is an employee, and edges represent direct communication links. We need to choose a non-empty subset of nodes such that no two chosen nodes are allowed to have another chosen node on the unique simple path between them.

Practice › Codeforces Solutions › Western European Olympiad in Informatics 2024 Mirror ›

CF 105259C - Parcel Post

The network is a tree of routing stations, so between any two stations there is exactly one simple path. A parcel must always move along that unique path when going from a source to a destination, but at every station it can be moved in two different ways.

Practice › Codeforces Solutions › Western European Olympiad in Informatics 2024 Mirror ›

CF 105259A - Make All Equal

We are given a hidden configuration of $N$ piles of stones arranged in a line, where $N$ is a power of two. Each pile has a height, and these heights are initially sorted in non-decreasing order.