2021-2022 ICPC, Moscow Subregional

15 problems from 2021-2022 ICPC, Moscow Subregional (contest 104848), difficulty -. 11/15 solutions verified against sample I/O.

15 items

2021-2022 ICPC, Moscow Subregional

ICPC/IOI | 15 problems | 11/15 verified | Difficulty - | 12m 26s

# Problem Rating Tags Accepted Time ✓
A A Non-Palindromic Modification 50s ✓
B Gleb and Liteyny Avenue 1m 12s ✓
C Socks Drying 1m 6s ✓
D Christmas Children Circle 28s
E Construct The Integer 46s ✓
F Build the Non-Cactus 56s ✓
G Double Elimination 31s
H Roman Palindromes 31s
I 1\%-Euclidean 53s ✓
J Spectacular Ending 1m 5s ✓
K Efficient Interception 39s
L FoodSberry 53s ✓
M Fine Trip 48s ✓
N Integer Perimeter 56s ✓
O Treeshop 52s ✓
Practice › Codeforces Solutions › 2021-2022 ICPC, Moscow Subregional ›

CF 104848O - Treeshop

We are working with a product space formed by two independent trees. A state is a pair of vertices, one chosen from the first tree and one from the second tree.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2021-2022 ICPC, Moscow Subregional ›

CF 104848N - Integer Perimeter

We are working with a triangle whose three side lengths are not given directly, but are instead constrained through three ratios between them.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2021-2022 ICPC, Moscow Subregional ›

CF 104848M - Fine Trip

We are given a weighted undirected graph representing a road network between intersections. Each road has a physical length, which determines how long it takes to traverse depending on chosen speed, and a cost coefficient that determines a penalty based on how fast we drive on…
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2021-2022 ICPC, Moscow Subregional ›

CF 104848L - FoodSberry

We are given a city with several “dark stores”, each acting like a local service hub, and a sequence of delivery orders appearing over time. Every order is just a point in the plane.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2021-2022 ICPC, Moscow Subregional ›

CF 104848J - Spectacular Ending

We are given a system of states, where each state behaves like a custom dice roll. From a current state, the game “rolls a dice” whose faces are not just uniform outcomes, but a collection of weighted faces with known probabilities.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2021-2022 ICPC, Moscow Subregional ›

CF 104848K - Efficient Interception

The problem statement in your prompt is incomplete and corrupted. The sample input and sample output are truncated, and crucial parts of the statement are missing or malformed.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2021-2022 ICPC, Moscow Subregional ›

CF 104848I - 1\%-Euclidean

We are given a set of points on a 2D plane, and we are asked to compute the sum of Euclidean distances over all unordered pairs of points. For every pair of distinct points, we take the straight-line distance between them and add it to a global total.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2021-2022 ICPC, Moscow Subregional ›

CF 104848H - Roman Palindromes

I don't have enough information to write a correct editorial and solution for this problem. The statement you provided contains the problem description, but it is missing the most important part needed to derive the algorithm: the official definition of what counts as a…
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2021-2022 ICPC, Moscow Subregional ›

CF 104848F - Build the Non-Cactus

We are asked to construct a connected simple undirected graph on vertices numbered from 1 to n. The graph must not be a cactus, meaning it must contain at least two simple cycles that overlap in at least two vertices. Self-loops and multiple edges are forbidden.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2021-2022 ICPC, Moscow Subregional ›

CF 104848E - Construct The Integer

We are given a positive integer $x$. From this number we conceptually generate a family of numbers by permuting its decimal digits in every possible way, then removing any leading zeros that might appear after permutation.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2021-2022 ICPC, Moscow Subregional ›

CF 104848G - Double Elimination

The requested editorial cannot be written correctly because the prompt is missing essential information. The problem statement describes the tournament format, but it does not describe how to reconstruct a team's finishing position from its win/loss string.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2021-2022 ICPC, Moscow Subregional ›

CF 104848D - Christmas Children Circle

I don't have enough information to write a correct editorial and solution because the problem statement in your prompt is corrupted.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2021-2022 ICPC, Moscow Subregional ›

CF 104848B - Gleb and Liteyny Avenue

We are given a straight road segment from position 0 to position L. Gleb walks from 0 toward L at speed 1 meter per second, and at certain integer positions there are pedestrian crossings where he may cross to the other side of the avenue.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2021-2022 ICPC, Moscow Subregional ›

CF 104848C - Socks Drying

We are simulating a randomized “sock pairing” process after a wash. All socks are grouped by color, and within each color the socks are indistinguishable. The process repeatedly removes a random sock from the machine.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2021-2022 ICPC, Moscow Subregional ›

CF 104848A - A Non-Palindromic Modification

We are given an integer array. We must increase exactly one element by 1 and then check whether the resulting array is not a palindrome. The task is to decide whether such a choice of position exists. An array is palindromic when every element matches its mirrored counterpart.
codeforces competitive-programming Jun 28, 2026