XXVI Spain Olympiad in Informatics, Day 2

5 problems from XXVI Spain Olympiad in Informatics, Day 2 (contest 103808), difficulty -. 4/5 solutions verified against sample I/O.

5 items

XXVI Spain Olympiad in Informatics, Day 2

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

#	Problem	Time	✓
A	Secuencia	46s	✓
B	Desordenado	2m 4s
C	Comiendo	49s	✓
D	Vasos	47s	✓
E	Reescritura	49s	✓

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

CF 103808E - Reescritura

We are given a rewriting system over strings. Each rule describes how a single character can expand into a two-character string. If a rule says c → ab, then every time we choose a position in the string containing c, we are allowed to replace that character by the pair ab.

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

CF 103808B - Desordenado

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, Day 2 ›

CF 103808D - Vasos

We are given a row of $n$ connected cups. Each adjacent pair of cups is linked by a straw placed at a certain height $Ai$. Water is poured only into the first cup, and then it can propagate through these connections depending on how much water has accumulated.

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

CF 103808C - Comiendo

We are given several independent test cases. In each test case, there are n types of cookies, and the i-th type has a pile size ai. The task is to completely consume all cookies, but the consumption is constrained by a very specific daily rule.

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

CF 103808A - Secuencia

We are building a sequence that depends on a starting value and a rule that keeps “rounding up” to multiples of increasing indices. We choose a positive integer $m$, which becomes the first element $a1$.