XXIV Spain Olympiad in Informatics, Online Qualifier 1

5 problems from XXIV Spain Olympiad in Informatics, Online Qualifier 1 (contest 105403), difficulty -. 3/5 solutions verified against sample I/O.

5 items

XXIV Spain Olympiad in Informatics, Online Qualifier 1

Special | 5 problems | 3/5 verified | Difficulty - | 8m 6s

#	Problem	Time	✓
A	Pieces	2m 10s	✓
B	Programming Contest	1m 31s
C	Painting Stones	1m 21s	✓
D	The Route of the 12 Lakes	1m 20s	✓
E	Directing the Roads of Grafolandia	1m 44s

Practice › Codeforces Solutions › XXIV Spain Olympiad in Informatics, Online Qualifier 1 ›

CF 105403A - Pieces

We are given a very short board with only up to three rows and an extremely long number of columns. The task is to cover every cell of this board using rectangular tiles of three possible sizes: single cells, dominoes covering two adjacent cells, and triominoes covering three…

Practice › Codeforces Solutions › XXIV Spain Olympiad in Informatics, Online Qualifier 1 ›

CF 105403E - Directing the Roads of Grafolandia

We start with a connected undirected graph representing cities and bidirectional roads. The government wants to choose exactly k of these roads and assign a direction to each selected road so that, after this operation, every city can still reach every other city using only…

Practice › Codeforces Solutions › XXIV Spain Olympiad in Informatics, Online Qualifier 1 ›

CF 105403D - The Route of the 12 Lakes

We are given a circular structure of lakes, where consecutive lakes are connected by weighted roads. If we walk from lake i to i+1 (and from n back to 1), we pay the corresponding edge cost.

Practice › Codeforces Solutions › XXIV Spain Olympiad in Informatics, Online Qualifier 1 ›

CF 105403B - Programming Contest

Each test case gives two arrays of scores, one belonging to Arturo and one belonging to Benito. For every index we have a pair of values, but the pairing is completely unknown: we are free to assign Arturo’s numbers and Benito’s numbers to different contest problems in any…

Practice › Codeforces Solutions › XXIV Spain Olympiad in Informatics, Online Qualifier 1 ›

CF 105403C - Painting Stones

We are given a line of stones, each stone having either a fixed color already assigned or being unpainted. Our task is to fill in all unpainted stones using a palette of c colors so that no two adjacent stones share the same color.