2024 UP ACM Algolympics Final Round

13 problems from 2024 UP ACM Algolympics Final Round (contest 105093), difficulty -. 11/13 solutions verified against sample I/O.

13 items

2024 UP ACM Algolympics Final Round

Special | 13 problems | 11/13 verified | Difficulty - | 9m 54s

#	Problem	Time	✓
A	4 \u2666	28s
B	BNA	59s	✓
C	Deal Breaker	53s	✓
D	Look, Up in the Sky!	33s
E	Minimum Cost Spanning Subgraph	49s	✓
F	Meta Sudoku	47s	✓
G	Pandemic	34s	✓
H	Rainbow Energy	36s	✓
I	Ready Player Juan	1m 18s	✓
J	Reservoir Doggos	36s	✓
K	Space Colonizers	36s	✓
L	SwapSwap++++	52s	✓
M	Yet Another Arbitrary Polynomial Problem	53s	✓

Practice › Codeforces Solutions › 2024 UP ACM Algolympics Final Round ›

CF 105093M - Yet Another Arbitrary Polynomial Problem

We are asked to output a large number of triples of positive integers $(a, b, c)$, each bounded by $10^{18}$, with the additional requirement that every triple must satisfy a fixed cubic polynomial identity in three variables.

Practice › Codeforces Solutions › 2024 UP ACM Algolympics Final Round ›

CF 105093L - SwapSwap++++

We are given an initial array and a sequence of swap operations that act on it. Each operation exchanges the values at two positions, and applying the full sequence produces a final arrangement of the array. The twist is that we are not executing the swaps in the given order.

Practice › Codeforces Solutions › 2024 UP ACM Algolympics Final Round ›

CF 105093I - Ready Player Juan

We are given a sequence of bosses fought in a fixed order. For each boss, there are two ways to handle the fight.

Practice › Codeforces Solutions › 2024 UP ACM Algolympics Final Round ›

CF 105093K - Space Colonizers

We are given a rectangular grid where each cell contains a strength value. One special cell is the starting position of the player, and another is the destination cell containing the Unobtanium mine.

Practice › Codeforces Solutions › 2024 UP ACM Algolympics Final Round ›

CF 105093J - Reservoir Doggos

A pack of dogs is fixing a sequence of holes in a damaged reservoir on Titan. Each hole leaks oil at a constant rate until it is fully repaired.

Practice › Codeforces Solutions › 2024 UP ACM Algolympics Final Round ›

CF 105093H - Rainbow Energy

We are given several independent test cases. In each one, there is a collection of crystals, each crystal having a color and a radiation value.

Practice › Codeforces Solutions › 2024 UP ACM Algolympics Final Round ›

CF 105093F - Meta Sudoku

We are working with a fixed 4 by 4 Sudoku variant. Each cell contains a digit from 1 to 4, and validity means three simultaneous constraints: every row contains no repeated digit, every column contains no repeated digit, and each of the four 2 by 2 blocks also contains no…

Practice › Codeforces Solutions › 2024 UP ACM Algolympics Final Round ›

CF 105093E - Minimum Cost Spanning Subgraph

We are given several independent scenarios. In each scenario, there are $n$ countries, and each country has a single integer value representing its technology level.

Practice › Codeforces Solutions › 2024 UP ACM Algolympics Final Round ›

CF 105093G - Pandemic

We are given a complete system of players where every unordered pair must eventually interact exactly once. Some interactions have already happened, and we know their order.

Practice › Codeforces Solutions › 2024 UP ACM Algolympics Final Round ›

CF 105093D - Look, Up in the Sky!

Working

Practice › Codeforces Solutions › 2024 UP ACM Algolympics Final Round ›

CF 105093B - BNA

We are maintaining a string that represents a sequence of nucleotides, where each position holds a single uppercase letter. The string changes over time through two kinds of operations.

Practice › Codeforces Solutions › 2024 UP ACM Algolympics Final Round ›

CF 105093C - Deal Breaker

We are given a fixed set of at most 20 possible flaws. Each applicant selects some subset of these flaws and is assigned a desirability score.

Practice › Codeforces Solutions › 2024 UP ACM Algolympics Final Round ›

CF 105093A - 4 ♦

We are given a complete record of a single execution of a classic three-switch, three-bulb deduction puzzle. Three switches A, B, and C each control exactly one of the bulbs 1, 2, and 3, but the mapping is unknown. All switches start in the off state.