XXVI Spain Olympiad in Informatics, Online Qualifier

6 problems from XXVI Spain Olympiad in Informatics, Online Qualifier (contest 103809), difficulty -. 5/6 solutions verified against sample I/O.

6 items

XXVI Spain Olympiad in Informatics, Online Qualifier

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

#	Problem	Time	✓
A	Alineaciones	52s	✓
B	Divisibilidad	2m 7s
C	Secuencias	59s	✓
D	Diagonales	57s	✓
E	Pareja	49s	✓
F	Molinos	1m 10s	✓

Practice › Codeforces Solutions › XXVI Spain Olympiad in Informatics, Online Qualifier ›

CF 103809F - Molinos

We are given a set of points in the plane. Each point behaves like a source that emits a ray. Initially every ray points straight down. Over time, all rays rotate counterclockwise at the same constant speed.

Practice › Codeforces Solutions › XXVI Spain Olympiad in Informatics, Online Qualifier ›

CF 103809B - Divisibilidad

Let $f(x1,dots,xn)$ be represented by an ordered reduced BDD with root node $r$. For each node $k$ in the BDD, write $V(k)$ for its variable index, and write $mathrm{LO}(k)$ and $mathrm{HI}(k)$ for its two successors. The sinks are $bot$ and $top$.

Practice › Codeforces Solutions › XXVI Spain Olympiad in Informatics, Online Qualifier ›

CF 103809D - Diagonales

We are given a grid where each cell either contains one diagonal segment or is blocked. A diagonal connects two opposite corners of a cell, so every non-blocked cell contributes a single edge between two grid vertices.

Practice › Codeforces Solutions › XXVI Spain Olympiad in Informatics, Online Qualifier ›

CF 103809E - Pareja

We are given a collection of sets, each set containing some elements from a universe whose size is also bounded by the number of sets. Each set also has an associated cost, which can be negative or positive. We are allowed to pick any subset of these sets, possibly empty.

Practice › Codeforces Solutions › XXVI Spain Olympiad in Informatics, Online Qualifier ›

CF 103809C - Secuencias

We are given an integer array and we are allowed to modify it using a very specific operation: in one move we pick a non-negative integer m and a positive increment k, and then we add k either to a prefix of length m+1 or to a suffix of length m+1.

Practice › Codeforces Solutions › XXVI Spain Olympiad in Informatics, Online Qualifier ›

CF 103809A - Alineaciones

Each test case describes a football squad split into four fixed groups: goalkeepers, defenders, midfielders, and forwards. Every player has a fixed skill value.