2020-2021 ICPC Central Europe Regional Contest (CERC 20)

11 problems from 2020-2021 ICPC Central Europe Regional Contest (CERC 20) (contest 104713), difficulty -. 10/11 solutions verified against sample I/O.

11 items

2020-2021 ICPC Central Europe Regional Contest (CERC 20)

ICPC/IOI | 11 problems | 10/11 verified | Difficulty - | 11m 33s

# Problem Rating Tags Accepted Time ✓
A Art Transaction 1m 7s ✓
B Bank Robbery 33s
C Pizzo Collectors 1m 19s ✓
D Excavation 1m ✓
E Tobacco Growing 48s ✓
F Rescue Mission 49s ✓
G Offices 1m 11s ✓
H Pickpockets 1m 22s ✓
I Storage Problems 1m 16s ✓
J Roof Escape 1m ✓
K Screamers 1m 8s ✓
Practice › Codeforces Solutions › 2020-2021 ICPC Central Europe Regional Contest (CERC 20) ›

CF 104713K - Screamers

We are given a grid that contains several excavators placed on distinct tiles. Each excavator occupies exactly one cell, and we start with one excavator per occupied cell.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020-2021 ICPC Central Europe Regional Contest (CERC 20) ›

CF 104713J - Roof Escape

We are given a grid of building blocks, where each block has a roof height. Each block occupies a square region in the plane, and neighboring blocks touch without any gap. A path starts at the center of one roof and ends at the center of another roof.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020-2021 ICPC Central Europe Regional Contest (CERC 20) ›

CF 104713I - Storage Problems

We are given a sequence of items, each item having a fixed weight. We also have a capacity limit K. The items are considered in a fixed order from 1 to N, and each item is owned by a corresponding gangster. We are not simulating only the real process.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020-2021 ICPC Central Europe Regional Contest (CERC 20) ›

CF 104713H - Pickpockets

We are given a timeline of H days. On each day k, the police effectively “clear” a prefix of stores, meaning all stores labeled from 1 up to Ck are considered clean on that day. If Ck is zero, no store is clean that day.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020-2021 ICPC Central Europe Regional Contest (CERC 20) ›

CF 104713G - Offices

We are maintaining a growing undirected weighted graph of offices. Each office is a node, and between some pairs there are cables of two types. A cable of one type takes time T1 to traverse, the other takes time T2. The graph starts with N offices and M existing cables.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020-2021 ICPC Central Europe Regional Contest (CERC 20) ›

CF 104713F - Rescue Mission

We are given a linear sequence of train coaches, each containing a small number of prisoners (from 0 to 9). Starting from any coach, the squad moves strictly forward and frees every prisoner in each visited coach, stopping only when they decide the mission is complete.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020-2021 ICPC Central Europe Regional Contest (CERC 20) ›

CF 104713E - Tobacco Growing

We are given a target integer $N$. The task is to construct a very specific growth system on an infinite grid so that after a chosen number of days, we can harvest tobacco from at most 10,000 cells and obtain exactly $N$ total quantity.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020-2021 ICPC Central Europe Regional Contest (CERC 20) ›

CF 104713D - Excavation

We are given an undirected graph that is a tree with up to 100 vertices. A small number of “detectives” are placed on vertices. Each day, an attacker announces one vertex they plan to “attack”. After seeing the target, every detective may move along at most one edge.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020-2021 ICPC Central Europe Regional Contest (CERC 20) ›

CF 104713C - Pizzo Collectors

We are given a circular arrangement of $N$ houses. Each house either already has an owner with a fixed category (an uppercase letter) or is empty and can be assigned any category later. Every category has a monetary value.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020-2021 ICPC Central Europe Regional Contest (CERC 20) ›

CF 104713A - Art Transaction

The input is a small grid, at most 50 by 50, where each cell contains either empty space or a specific symbol representing an object such as a sun, house, bird, drake, slope, grill, or chupacabra.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020-2021 ICPC Central Europe Regional Contest (CERC 20) ›

CF 104713B - Bank Robbery

I can’t write a correct editorial for this yet because the actual problem statement for Codeforces 104713B - Bank Robbery is missing from your message.
codeforces competitive-programming Jun 29, 2026