ICPC Central Russia Regional Contest - 2020

14 problems from ICPC Central Russia Regional Contest - 2020 (contest 104452), difficulty -. 5/14 solutions verified against sample I/O.

14 items

ICPC Central Russia Regional Contest - 2020

ICPC/IOI | 14 problems | 5/14 verified | Difficulty - | 25m 37s

# Problem Rating Tags Accepted Time ✓
A Motivation problems 1m 32s
B Time to reap the harvest 3m 11s ✓
C Lucky or not? 1m 24s
D Professor R's. Median 1m 31s ✓
E The Highlanders' Tournament 1m 56s
F Square transit 1m 58s
G Progress bar 1m 2s ✓
H Chess knight on the curb stone 1m 28s
I Pharaoh hEx 3m 20s
J Connect and Disconnect 1 2m 8s
K Divide and Connect 2 1m 34s ✓
L Cipher 1m 20s
M Beautiful hockey 1m 6s ✓
N Contest with bug 2m 7s
Practice › Codeforces Solutions › ICPC Central Russia Regional Contest - 2020 ›

CF 104452N - Contest with bug

We are given a fixed contest duration measured in minutes and a small collection of problems, each requiring a known amount of time to solve.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › ICPC Central Russia Regional Contest - 2020 ›

CF 104452M - Beautiful hockey

Each hockey game consists of $n$ independent periods. In every period, the scoreboard shows one of four possible outcomes: neither team scores, the first team scores once, the second team scores once, or both teams score once.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › ICPC Central Russia Regional Contest - 2020 ›

CF 104452L - Cipher

We are given a string whose length is a power of two, say $2^n$, and it is known to be the result of repeatedly applying a very structured transformation. The transformation works in rounds. In the first round, the entire string is reversed.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › ICPC Central Russia Regional Contest - 2020 ›

CF 104452I - Pharaoh hEx

Each test case is: - N - array a of size N - K - then K query values So the structure is strictly: There is no ambiguity, no hidden grouping, no multiple test cases.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › ICPC Central Russia Regional Contest - 2020 ›

CF 104452J - Connect and Disconnect 1

The system we are asked to design is a small flow network made from two types of components. Each component receives some incoming flow and either splits it evenly or combines multiple incoming flows into one outgoing flow.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › ICPC Central Russia Regional Contest - 2020 ›

CF 104452K - Divide and Connect 2

We are given a directed network of devices that manipulate a single continuous flow of items. The system is a rooted structure: a single input flow enters device 1, and the flow is then transformed and routed through a collection of intermediate components until it finally…
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › ICPC Central Russia Regional Contest - 2020 ›

CF 104452H - Chess knight on the curb stone

We are given a chessboard of size $n times m$, where the central rectangle of size $(n-4)times(m-4)$ is removed. What remains is a border strip of width 2 cells all around the outside. The knight starts at the top-left corner cell $(1,1)$.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › ICPC Central Russia Regional Contest - 2020 ›

CF 104452F - Square transit

We are given a planar railway system inside a rectangle. Stations are placed at integer coordinates, and there are straight rail segments connecting pairs of stations.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › ICPC Central Russia Regional Contest - 2020 ›

CF 104452G - Progress bar

We are given two observed states of a progress bar made of identical blocks. There is some hidden total length $n$, and whenever the system shows a progress fraction $p$, it computes $p cdot n$, rounds it to the nearest integer, and displays that many filled blocks.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › ICPC Central Russia Regional Contest - 2020 ›

CF 104452E - The Highlanders' Tournament

We are given a line of fighters, each sitting in a fixed left-to-right order and each having a distinct strength value.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › ICPC Central Russia Regional Contest - 2020 ›

CF 104452B - Time to reap the harvest

We are given a list of plant heights along a line, and a set of queries. Each query gives a cutting height $L$, and we must compute how much material remains above that cut. For each bush with height $ai$, only the portion above $L$ contributes, and only if it is positive.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › ICPC Central Russia Regional Contest - 2020 ›

CF 104452D - Professor R's. Median

We are given a list of integers and we need to select a single element according to a rule that depends on the smallest and largest values in the list.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › ICPC Central Russia Regional Contest - 2020 ›

CF 104452A - Motivation problems

We are given a rooted tree with vertices labeled from 1 to N, where vertex 1 is the root. Each edge represents a direct parent to child relationship, so every node has a unique path upward toward the root.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › ICPC Central Russia Regional Contest - 2020 ›

CF 104452C - Lucky or not?

We are given a network of cities connected by bidirectional postal routes. Each route does not work every day, instead each one is only available on a fixed weekday, from day 1 through day 7.
codeforces competitive-programming Jun 30, 2026