2023 UP ACM Algolympics Final Round

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

13 items

2023 UP ACM Algolympics Final Round

Special | 13 problems | 13/13 verified | Difficulty - | 12m 15s

# Problem Rating Tags Accepted Time ✓
A Alien Gordon Ramsey 52s ✓
B Cult of Wah! 59s ✓
C Dethrone Antares Now 56s ✓
D Eliens Slurs 47s ✓
E Euclidean Travel with Parallel Universes 1m 13s ✓
F Flow Maximal 1m 4s ✓
G Irreversible Events 58s ✓
H Not Just an NP-Hard Problem 1m 8s ✓
I Ominous Acids 43s ✓
J Sensor Logs 1m 2s ✓
K Star Seeker's Socks 48s ✓
L Starquake! 55s ✓
M TheBuzz 50s ✓
Practice › Codeforces Solutions › 2023 UP ACM Algolympics Final Round ›

CF 104435M - TheBuzz

We are given two complete descriptions of relationships among the same set of organizations, but the organizations are named in one description and numbered in the other.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › 2023 UP ACM Algolympics Final Round ›

CF 104435L - Starquake!

We are given a one-dimensional landscape, where each position stores an integer height. From this array, we define connectivity not by adjacency alone, but by a height constraint: two neighboring positions can be traversed only if their heights differ by at most one.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › 2023 UP ACM Algolympics Final Round ›

CF 104435J - Sensor Logs

We are given a building with four rooms labeled A, B, C, and D, connected by exactly three corridors. Each corridor is a physical passage between two rooms, and every time a person moves through a corridor from one room to the other, a log entry is recorded as a pair…
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › 2023 UP ACM Algolympics Final Round ›

CF 104435K - Star Seeker's Socks

We are given a collection of sock types, where each type contains a number of identical socks grouped in pairs. Type i contributes exactly 2·k[i] individual socks, all indistinguishable within that type.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › 2023 UP ACM Algolympics Final Round ›

CF 104435I - Ominous Acids

We are working with shapes formed on an infinite grid using exactly $k$ unit squares. Each shape must be connected through edge-adjacency, meaning we can move between squares only if they share a full side.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › 2023 UP ACM Algolympics Final Round ›

CF 104435H - Not Just an NP-Hard Problem

We are given several sticks, each with an integer length, and we must organize them into a geometric construction that ultimately produces a triangle-like shelter.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › 2023 UP ACM Algolympics Final Round ›

CF 104435E - Euclidean Travel with Parallel Universes

The geometry starts from a fixed parallelogram described by two generating vectors. If we denote the origin as point A, then any point inside the shape can be uniquely written using two parameters along those vectors.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › 2023 UP ACM Algolympics Final Round ›

CF 104435G - Irreversible Events

We are given a directed graph where vertices represent events and directed edges represent allowed time transitions. From an event A, we can reach event B if there is a directed path from A to B.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › 2023 UP ACM Algolympics Final Round ›

CF 104435B - Cult of Wah!

Each test case contains two collections of lowercase words. The first collection is the Wah-List, which contains every word that must appear after the encrypted message has been decoded. The second collection is the encrypted message itself.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › 2023 UP ACM Algolympics Final Round ›

CF 104435A - Alien Gordon Ramsey

We are given an undirected tree, meaning a connected graph with $n$ nodes and exactly $n-1$ edges. Each node represents a restaurant, and each restaurant must be assigned a positive integer label representing a “theme”. The assignment must satisfy two constraints.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › 2023 UP ACM Algolympics Final Round ›

CF 104435D - Eliens Slurs

We are given a long array representing a tweet, where each element is an integer from 1 to 300. We are also given a shorter pattern array called the slur.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › 2023 UP ACM Algolympics Final Round ›

CF 104435F - Flow Maximal

We are given an integer $b$. We consider all integer solutions $(a, c)$ such that $a^2 + b^2 = c^2$ and $0 le a le c$. Each solution corresponds to a circular necklace of $c$ beads, each bead being either “red” (Andromedal) or “blue”.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › 2023 UP ACM Algolympics Final Round ›

CF 104435C - Dethrone Antares Now

We are given an undirected graph of planets connected by bidirectional teleporters. Each teleporter allows instant movement between two planets, and it is the only way to travel. Several commanders start on distinct planets.
codeforces competitive-programming Jun 30, 2026