UDESC Selection Contest 2024-1

15 problems from UDESC Selection Contest 2024-1 (contest 105790), difficulty -. 12/15 solutions verified against sample I/O.

15 items

UDESC Selection Contest 2024-1

Special | 15 problems | 12/15 verified | Difficulty - | 9m 56s

# Problem Rating Tags Accepted Time ✓
A Stellar Year 27s
B Bit Tennis 2 50s ✓
C Song 46s ✓
D Course Deviation 34s ✓
E El Caf\u00e9 35s ✓
F Frogs or Toads? 44s ✓
G Gargantua 44s ✓
H Higgs 24s
I Itwise Bor 43s ✓
J Jugando Fuerte 46s ✓
K Kosmos 48s ✓
L Lango Mocos 36s ✓
M Giant Worms 51s ✓
N Shield Navigation 51s ✓
O Osmos V 17s
Practice › Codeforces Solutions › UDESC Selection Contest 2024-1 ›

CF 105790O - Osmos V

Sure - I can do that. Please send the full Codeforces problem statement (or at least the link / contest + problem letter). If you also have constraints or sample tests, include them too.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2024-1 ›

CF 105790L - Lango Mocos

We have N types of rocks. Some pairs of types are incompatible, meaning the two types cannot be stored in the same bag. Dudu has exactly two bags, and every rock type must be assigned to one of them.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2024-1 ›

CF 105790A - Stellar Year

The statement you provided is effectively empty, so there is no way to reconstruct the intended problem or derive a correct algorithm.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2024-1 ›

CF 105790H - Higgs

The statement you pasted is effectively empty, so there isn’t enough information to reconstruct what “Higgs” is asking or derive any algorithm from it. Right now we only have the title and no input/output description, constraints, or even a hint of the task.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2024-1 ›

CF 105790N - Shield Navigation

We have an $N times M$ grid. Each time a shield is built at position $(x,y)$, it protects every cell in row $x$ and every cell in column $y$. A cell is usable if it is protected by at least one shield. There are two types of operations. A type 1 operation builds a new shield.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2024-1 ›

CF 105790M - Giant Worms

The multiverse forms a rooted directed tree with root universe 1. Every edge points from a universe with more stars to a universe with fewer stars.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2024-1 ›

CF 105790B - Bit Tennis 2

We have a take-away game played on several piles. A move consists of choosing one pile and removing a number of stones equal to a power of two. The allowed removals are 1, 2, 4, 8, and so on, as long as the chosen pile contains enough stones.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2024-1 ›

CF 105790I - Itwise Bor

We have an array of star brightness values. We must split the array into contiguous groups. The beauty of a group is the bitwise OR of all values inside that group. For a partition of the array, we compute the sum of the beauties of all groups.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2024-1 ›

CF 105790D - Course Deviation

A spaceship is approaching a landing strip. Between the ship and the landing strip there are $N$ mountains. The ship moves forward at a constant speed of 1 kilometer per second and simultaneously descends at a constant rate of 1 kilometer per second.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2024-1 ›

CF 105790K - Kosmos

We are given a sequence defined by $$F(0)=1,quad F(1)=2$$ and for every $n ge 2$, $$F(n)=F(n-1)cdot F(n-2).$$ The input contains a single integer $N$, where $N$ can be as large as $10^{18}$. The task is to compute $F(N)$ modulo $998244353$.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2024-1 ›

CF 105790G - Gargantua

The situation describes two astronauts and a relativistic time difference caused by a black hole system. One astronaut, Leo, remains on Earth while the other, Ema, travels to a distant planet where time flows more slowly.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2024-1 ›

CF 105790F - Frogs or Toads?

Eric starts with a laser weapon whose energy is initially zero. For each level, there are two possible actions. The normal route requires killing si mutants.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2024-1 ›

CF 105790J - Jugando Fuerte

The problem describes a sequence of players arranged in a line, where each player owns a string that represents their deck.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2024-1 ›

CF 105790E - El Café

We are maintaining a dynamic collection of positive integers, where each integer represents the quantity of a newly arriving ingredient in a café. The collection changes over time: new values are appended, and occasionally the most recent block of values is removed.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2024-1 ›

CF 105790C - Song

The task “Song” is essentially about reconstructing or evaluating a sequence derived from a structured description of a song.
codeforces competitive-programming Jun 21, 2026