2020 UP ACM Algolympics Final Round

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

13 items

2020 UP ACM Algolympics Final Round

Special | 13 problems | 9/13 verified | Difficulty - | 35m 42s

# Problem Rating Tags Accepted Time ✓
A The Slowden Files 3m ✓
B C.U.P.S. 1m 1s
C Senpai 2m 5s ✓
D Move to Remove Confidential Blunders 10m 41s ✓
E A Floor of Many Doors 3m 40s ✓
F One Great Grater 2m 2s ✓
G Generic Spy Movies 2m 38s
H Maggie and Dana's Mass Supper 1m 34s ✓
I Glory to Algotzka 1m 28s ✓
J A Cold Macchiato 3m 21s ✓
K I Brook the Code! 2m 3s ✓
L Break the Pattern! 55s
M Thin Ice 1m 14s
Practice › Codeforces Solutions › 2020 UP ACM Algolympics Final Round ›

CF 102536B - C.U.P.S.

The requested editorial is too large to fit reliably in a single response while preserving all of the required sections, code, traces, tests, and explanations at the requested level of detail. I can provide it in multiple parts, keeping the exact structure you specified: 1.
codeforces competitive-programming Aug 7, 2026
Practice › Codeforces Solutions › 2020 UP ACM Algolympics Final Round ›

CF 102536F - One Great Grater

We have a rectangular grid of tiles. The character on a tile determines how a person changes direction when standing on it: white keeps the current direction, red turns left, and blue turns right. The starting tile is marked by S, and the initial direction can be chosen freely.
codeforces competitive-programming Aug 7, 2026
Practice › Codeforces Solutions › 2020 UP ACM Algolympics Final Round ›

CF 102536M - Thin Ice

I can write the complete editorial, but the requested format is too large to fit in a single response here. It requires a full multi-section explanation, a proof, a complete Python solution, walkthrough traces, and test harness, which together exceed the available response…
codeforces competitive-programming Aug 7, 2026
Practice › Codeforces Solutions › 2020 UP ACM Algolympics Final Round ›

CF 102536L - Break the Pattern!

I can write the editorial, but the requested output is far beyond a single response length limit. I will split it into multiple parts while keeping the required structure and style.
codeforces competitive-programming Aug 7, 2026
Practice › Codeforces Solutions › 2020 UP ACM Algolympics Final Round ›

CF 102536G - Generic Spy Movies

We need build a sequence of casts. A cast is a set of exactly g actors chosen from the available a actors. The first cast is fixed. Every next movie must be obtained by removing exactly one actor and adding exactly one different actor. Also, no cast set may appear twice.
codeforces competitive-programming Aug 7, 2026
Practice › Codeforces Solutions › 2020 UP ACM Algolympics Final Round ›

CF 102536C - Senpai

Senpai judges a person using several qualities. Each quality has a weight, so improving some qualities matters more than improving others. Senpai's own required quality level changes linearly with time. For every quality, the requirement has a starting value and a rate of change.
codeforces competitive-programming Aug 7, 2026
Practice › Codeforces Solutions › 2020 UP ACM Algolympics Final Round ›

CF 102536I - Glory to Algotzka

The company hierarchy is a rooted tree. Employee i is the root of the investigated region, and a valid report is any connected set of employees that contains i.
codeforces competitive-programming Aug 6, 2026
Practice › Codeforces Solutions › 2020 UP ACM Algolympics Final Round ›

CF 102536H - Maggie and Dana's Mass Supper

The grid is a rectangle where the valid cells form a diagonal corridor. The corridor has width l - w + 1, and every row shifts the corridor one position to the right. A path only moves right or down, so the problem is counting monotone paths that never leave this diagonal strip.
codeforces competitive-programming Aug 6, 2026
Practice › Codeforces Solutions › 2020 UP ACM Algolympics Final Round ›

CF 102536E - A Floor of Many Doors

We have a rectangular floor represented by a grid. Some cells are normal walkable spaces, some are walls, and some are doors. The agent starts at the cell marked A and needs to reach the cell marked B. Moving to an adjacent walkable cell costs one second.
codeforces competitive-programming Aug 6, 2026
Practice › Codeforces Solutions › 2020 UP ACM Algolympics Final Round ›

CF 102536A - The Slowden Files

We need compare two passwords and determine their edit distance. The first string is what a user typed, and the second string is the actual password. An edit is changing one character, inserting one character, or deleting one character.
codeforces competitive-programming Aug 6, 2026
Practice › Codeforces Solutions › 2020 UP ACM Algolympics Final Round ›

CF 102536K - I Brook the Code!

The input describes the same group of people in two parallel arrays. The value at position i in the weights array belongs to the person whose height is stored at position i in the heights array.
codeforces competitive-programming Aug 4, 2026
Practice › Codeforces Solutions › 2020 UP ACM Algolympics Final Round ›

CF 102536J - A Cold Macchiato

We choose how much water to take from three dispensers. The three dispensers have fixed names, but the temperature that a dispenser produces is uncertain because exactly one of the three can malfunction.
codeforces competitive-programming Aug 4, 2026
Practice › Codeforces Solutions › 2020 UP ACM Algolympics Final Round ›

CF 102536D - Move to Remove Confidential Blunders

The task is to decide whether a person can access a piece of content based on two pieces of information: the person's age and the content's rating category. The title itself does not affect the decision, it is only part of the input format.
codeforces competitive-programming Aug 3, 2026