Innopolis Open 2024. Final round

5 problems from Innopolis Open 2024. Final round (contest 104985), difficulty -. 4/5 solutions verified against sample I/O.

5 items

Innopolis Open 2024. Final round

Special | 5 problems | 4/5 verified | Difficulty - | 4m 6s

#	Problem	Time	✓
A	Episodes	56s	✓
B	Board Game	1m	✓
C	Helicopter	56s	✓
D	Bill Restoration	25s
E	Innopolis Data Center	49s	✓

Practice › Codeforces Solutions › Innopolis Open 2024. Final round ›

CF 104985E - Innopolis Data Center

We are given a tree of servers where every edge has unit length. Each query specifies a vertex $ui$ and a distance limit $d$.

Practice › Codeforces Solutions › Innopolis Open 2024. Final round ›

CF 104985B - Board Game

We are given a set of players, and each player must independently choose one of three available options. Each option is described by two values: a resource cost and a score gain. For player i, option j contributes a cost ai,j and a score ci,j.

Practice › Codeforces Solutions › Innopolis Open 2024. Final round ›

CF 104985D - Bill Restoration

Codeforces 104985D: Bill Restoration

Practice › Codeforces Solutions › Innopolis Open 2024. Final round ›

CF 104985A - Episodes

We are given several episodes to download, and each episode comes with two parameters: a nominal download speed and a target download time if that speed stayed constant.

Practice › Codeforces Solutions › Innopolis Open 2024. Final round ›

CF 104985C - Helicopter

We are given a grid where each cell has a terrain value that can be interpreted as a required altitude to safely operate in that location. A helicopter starts at some cell and must move across the grid, changing cells in four directions.