2023-2024 ICPC Central Europe Regional Contest (CERC 23)

12 problems from 2023-2024 ICPC Central Europe Regional Contest (CERC 23) (contest 104871), difficulty -. 4/12 solutions verified against sample I/O.

12 items

2023-2024 ICPC Central Europe Regional Contest (CERC 23)

ICPC/IOI | 12 problems | 4/12 verified | Difficulty - | 8m 28s

# Problem Rating Tags Accepted Time ✓
A Attendance 25s
B Ball Passing 39s
C Cakes 1m ✓
D Drying Laundry 58s ✓
E Equal Schedules 34s
F Phylogenetics 39s
G Going to the Moon 1m 4s ✓
H Human Resources 39s
I Interactive Reconstruction 1m 10s ✓
J Jumbled Stacks 28s
K Keys 25s
L Labelled Paths 27s
Practice › Codeforces Solutions › 2023-2024 ICPC Central Europe Regional Contest (CERC 23) ›

CF 104871A - Attendance

I can’t write a correct Codeforces editorial from that prompt because the actual problem statement is missing. Right now I only see: - Title: “Attendance” - A broken page excerpt (“Page 14 of 26”) - No definition of input, output, or task That’s not enough to…
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023-2024 ICPC Central Europe Regional Contest (CERC 23) ›

CF 104871L - Labelled Paths

We are given a directed acyclic graph where each edge carries a string label. A path’s label is formed by concatenating edge labels in traversal order.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023-2024 ICPC Central Europe Regional Contest (CERC 23) ›

CF 104871I - Interactive Reconstruction

We are given a hidden tree with $N$ labelled vertices. The structure is unknown, but we are allowed to interrogate it using a special operation. In one query, we send a binary string of length $N$. This string assigns a value of 0 or 1 to each node.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023-2024 ICPC Central Europe Regional Contest (CERC 23) ›

CF 104871K - Keys

We are given a graph whose vertices are rooms in a mansion and whose edges are doors. Each door connects two rooms and is labeled by a unique key index. To traverse a door, a person must currently hold its key.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023-2024 ICPC Central Europe Regional Contest (CERC 23) ›

CF 104871J - Jumbled Stacks

We
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023-2024 ICPC Central Europe Regional Contest (CERC 23) ›

CF 104871H - Human Resources

We are given a company hierarchy that forms a rooted tree. Every employee except one has exactly one manager, and each manager has an ordered list of direct reports ranked from most to least preferred.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023-2024 ICPC Central Europe Regional Contest (CERC 23) ›

CF 104871G - Going to the Moon

We are given two points in the plane, Alice at $A$ and Bob at $B$, and a circle representing the Moon with center $C$ and radius $r$.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023-2024 ICPC Central Europe Regional Contest (CERC 23) ›

CF 104871F - Phylogenetics

We are given a special graph construction. The base object is a tree, embedded in the plane, with its leaves arranged in circular order. After that, every pair of consecutive leaves in this circular order is additionally connected, forming a cycle on the leaves.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023-2024 ICPC Central Europe Regional Contest (CERC 23) ›

CF 104871D - Drying Laundry

We are given a fixed collection of laundry items, each item having a physical width and a drying profile. Across multiple weeks, Harry has two parallel clotheslines of equal length, and in each week the available length changes.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023-2024 ICPC Central Europe Regional Contest (CERC 23) ›

CF 104871E - Equal Schedules

We are given two complete schedules that describe continuous on-call coverage over a timeline that starts at time 0. Each schedule is a partition of the interval into consecutive, non-overlapping segments.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023-2024 ICPC Central Europe Regional Contest (CERC 23) ›

CF 104871C - Cakes

We are given a bakery that can produce several types of cakes. Each cake recipe consumes some amount of ingredients and requires a set of reusable tools. Every ingredient and every tool has a cost, and each cake also has a selling price.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023-2024 ICPC Central Europe Regional Contest (CERC 23) ›

CF 104871B - Ball Passing

I can’t write a correct editorial from this as-is because the actual problem statement for “104871B - Ball Passing” is missing.
codeforces competitive-programming Jun 28, 2026