2025 UP ACM Algolympics Final Round

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

13 items

2025 UP ACM Algolympics Final Round

Special | 13 problems | 13/13 verified | Difficulty - | 16m 52s

# Problem Rating Tags Accepted Time ✓
A 3D 1m 37s ✓
B Absorption Game 1m 22s ✓
C Butler's Tea 1m 41s ✓
D Daily Life of Data Visualization Engineers 57s ✓
E Fanceptionception 1m 24s ✓
F The Grand Heist 1m 8s ✓
G Heavy Metal Pipe Jumpscare 1m 10s ✓
H Illusion of Progress 1m 26s ✓
I The Keeper vs The Overwriter 1m ✓
J Knights and Knaves 58s ✓
K Polynomial Construction 1m 30s ✓
L Summoner's Rift 1m 18s ✓
M Trapped 1m 21s ✓
Practice › Codeforces Solutions › 2025 UP ACM Algolympics Final Round ›

CF 105946M - Trapped

We are simulating a constrained survival process where time and oxygen are the same currency in different forms. Each second spent anywhere, digging or operating machinery, reduces the oxygen tank by one.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2025 UP ACM Algolympics Final Round ›

CF 105946L - Summoner's Rift

We are given a square arena with side length $r$, and a set of $n$ points representing heroes placed inside it. A random infinite line is generated in two stages: first a random point inside the square is chosen, then a random direction is chosen uniformly over all angles in…
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2025 UP ACM Algolympics Final Round ›

CF 105946K - Polynomial Construction

We are asked to construct several different integer polynomials. Each polynomial must satisfy three structural constraints at the same time. First, it must be monic, so its highest-degree coefficient is exactly 1.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2025 UP ACM Algolympics Final Round ›

CF 105946H - Illusion of Progress

We are given a connected, simple undirected graph with $n$ districts and $m$ existing roads. District 1 is the starting point for every citizen.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2025 UP ACM Algolympics Final Round ›

CF 105946J - Knights and Knaves

We are given multiple independent scenarios involving three fixed participants: Alice, Bob, and Cindy. Each person is either a truth-teller or a liar.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2025 UP ACM Algolympics Final Round ›

CF 105946G - Heavy Metal Pipe Jumpscare

We are given the first $N = 2 cdot 10^5$ terms of a sequence that is mostly generated by a fixed linear recurrence of order $k le 69$, but with occasional corruption. For the first $k$ positions, the values are arbitrary.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2025 UP ACM Algolympics Final Round ›

CF 105946F - The Grand Heist

We are given a single block of gold with total mass $G$, and a group of $n$ people who contributed different amounts of effort.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2025 UP ACM Algolympics Final Round ›

CF 105946E - Fanceptionception

Each cell of an n by n grid contains a fan that may or may not be active, and every active fan pushes wind only downward. A fan at position (i, j) with strength f influences a triangular region starting from itself and expanding as we go to lower rows.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2025 UP ACM Algolympics Final Round ›

CF 105946C - Butler's Tea

Each test case describes a household where a group of servants must complete a set of chores. Every chore has a required amount of work, and every hour each servant contributes work depending on how they are assigned.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2025 UP ACM Algolympics Final Round ›

CF 105946B - Absorption Game

We are given an array and many operations on subarrays. Each query asks for a value derived from a randomized “absorption” process, and updates replace a whole segment with a fixed pattern.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2025 UP ACM Algolympics Final Round ›

CF 105946D - Daily Life of Data Visualization Engineers

The program described here takes an integer array and performs a simple filtering step before turning it into a vertical bar chart. All non-positive values are discarded, and the remaining values keep their original order.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2025 UP ACM Algolympics Final Round ›

CF 105946I - The Keeper vs The Overwriter

We are given a sequence of write operations applied to a sparse array of size $n$, initially empty. Each operation writes a value $x$ into position $i$. The twist is that two different systems interpret overwrites differently.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 2025 UP ACM Algolympics Final Round ›

CF 105946A - 3D

We are given an array of integers, and we need to count how many ordered triples of distinct indices form an arithmetic relation where the sum of two selected elements equals a third element in the array.
codeforces competitive-programming Jun 21, 2026