XXIV Spain Olympiad in Informatics, Day 2

5 problems from XXIV Spain Olympiad in Informatics, Day 2 (contest 105325), difficulty -. 0/5 solutions verified against sample I/O.

5 items

XXIV Spain Olympiad in Informatics, Day 2

Special | 5 problems | 0/5 verified | Difficulty - | 13m 48s

#	Problem	Time
A	Baq and the Distances Between Cities	1m 26s
B	Expensive Transport	6m 30s
C	Brothers	2m 4s
D	Jordan's Castles	1m 33s
E	Game on a Graph	2m 15s

Practice › Codeforces Solutions › XXIV Spain Olympiad in Informatics, Day 2 ›

CF 105325C - Brothers

We are given a row of dominoes placed from left to right at strictly increasing positions. Each domino has a height, and when it falls it can push everything to its right that lies within its reach, where reach means the interval from its position up to its position plus height.

Practice › Codeforces Solutions › XXIV Spain Olympiad in Informatics, Day 2 ›

CF 105325B - Expensive Transport

We are given a directed weighted graph with a distinguished start node, node 0. A traveller moves along edges, but the cost model is not the usual shortest path.

Practice › Codeforces Solutions › XXIV Spain Olympiad in Informatics, Day 2 ›

CF 105325E - Game on a Graph

We are given an undirected graph whose vertices are labeled from 0 to n−1. The graph is split into connected components, and the structure changes as the game progresses because vertices are permanently removed.

Practice › Codeforces Solutions › XXIV Spain Olympiad in Informatics, Day 2 ›

CF 105325D - Jordan's Castles

We are given several independent castles. Each castle is described by a non-increasing sequence of tower heights, where each value represents how many blocks are stacked in a vertical column.

Practice › Codeforces Solutions › XXIV Spain Olympiad in Informatics, Day 2 ›

CF 105325A - Baq and the Distances Between Cities

We are asked to assign weights to every edge of a complete graph on $n$ labeled cities. There are $frac{n(n-1)}{2}$ undirected edges, and we must place each integer from $1$ to $frac{n(n-1)}{2}$ exactly once.