XXIV Spain Olympiad in Informatics, Day 1

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

5 items

XXIV Spain Olympiad in Informatics, Day 1

Special | 5 problems | 0/5 verified | Difficulty - | 8m 11s

#	Problem	Time
A	DDoS Attacks	1m 33s
B	Covering Holes	1m 35s
C	VonitA Sequences	1m 34s
D	Pok\u00e9mon Tazos	1m 43s
E	Painting Stones 2	1m 46s

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

CF 105263E - Painting Stones 2

We are given a line of $n$ stones, and each stone must be painted using one of $c$ available colors. The only restriction is about runs of identical colors: we are not allowed to have any block of length $k$ or more where all stones share the same color.

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

CF 105263D - Pokémon Tazos

We are given a directed functional graph over friends. Each friend starts with a pile of identical items, and each item has a type equal to its owner. So friend $i$ initially holds $ni$ copies of type $i$. The process runs in rounds.

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

CF 105263A - DDoS Attacks

We are processing a live stream of network events. Each event is either a configuration update or a packet arrival. A packet carries three pieces of information: the sender IP address, a timestamp, and the number of bytes in the packet.

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

CF 105263B - Covering Holes

We are given several disjoint segments on a number line, where each segment represents a hole that must be covered by wood. Each hole is already separated from the next one, so there is no overlap between any two segments and also no touching endpoints.

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

CF 105263C - VonitA Sequences

We are given several sequences of integers, and for each one we want to minimally modify elements so that the resulting sequence has a single “turning point” in a very specific sense.