2021-2022 ICPC Central Europe Regional Contest (CERC 21)

12 problems from 2021-2022 ICPC Central Europe Regional Contest (CERC 21) (contest 104797), difficulty -. 7/12 solutions verified against sample I/O.

12 items

2021-2022 ICPC Central Europe Regional Contest (CERC 21)

ICPC/IOI | 12 problems | 7/12 verified | Difficulty - | 13m 11s

#	Problem	Time	✓
A	Airline	53s	✓
B	Building on the Moon	5m 25s
C	Cactus cutting	58s	✓
D	DJ Darko	57s	✓
E	Fishing	38s
F	Letters	30s	✓
G	Lines in a grid	48s	✓
H	Radar	31s
I	Regional development	29s
J	Repetitions	48s	✓
K	Single-track railway	23s
L	Systematic salesman	51s	✓

Practice › Codeforces Solutions › 2021-2022 ICPC Central Europe Regional Contest (CERC 21) ›

CF 104797B - Building on the Moon

Codeforces 104797B: Building on the Moon

Practice › Codeforces Solutions › 2021-2022 ICPC Central Europe Regional Contest (CERC 21) ›

CF 104797L - Systematic salesman

We are given a set of points on a plane, each representing a city. The salesman must produce a single path that visits every city exactly once. He is allowed to start anywhere and finish anywhere, so the result is simply a permutation of all cities.

Practice › Codeforces Solutions › 2021-2022 ICPC Central Europe Regional Contest (CERC 21) ›

CF 104797K - Single-track railway

We are given a linear railway consisting of stations connected in a chain. Between each pair of neighboring stations there is a travel time. Two trains depart simultaneously: one starts at station 1 and moves right, the other starts at station n and moves left.

Practice › Codeforces Solutions › 2021-2022 ICPC Central Europe Regional Contest (CERC 21) ›

CF 104797J - Repetitions

We are given a long string made only of lowercase letters and a small number of queries over substrings of this string. Each query focuses on a contiguous segment of the string, and asks us to find a very specific pattern inside that segment.

Practice › Codeforces Solutions › 2021-2022 ICPC Central Europe Regional Contest (CERC 21) ›

CF 104797I - Regional development

We are given a directed graph of villages connected by roads. Each road connects two villages and comes with a prescribed direction in the input, but we are free to assign a final flow of merchants on each road either in the given direction or in the reverse direction.

Practice › Codeforces Solutions › 2021-2022 ICPC Central Europe Regional Contest (CERC 21) ›

CF 104797G - Lines in a grid

We are given an integer grid formed by all lattice points $(i, j)$ where both coordinates range from $0$ to $n-1$. From this set of points, we consider all straight lines in the plane and we want to count how many distinct lines pass through at least two of these grid points.

Practice › Codeforces Solutions › 2021-2022 ICPC Central Europe Regional Contest (CERC 21) ›

CF 104797H - Radar

We are given a radar system that produces a finite set of scanned points in the plane. Each scanned point is formed by choosing a direction and a distance from the origin, then going that distance along that direction.

Practice › Codeforces Solutions › 2021-2022 ICPC Central Europe Regional Contest (CERC 21) ›

CF 104797F - Letters

We are given a rectangular grid that contains lowercase letters and empty cells. Over time, gravity acts on this grid, but not in a fixed direction.

Practice › Codeforces Solutions › 2021-2022 ICPC Central Europe Regional Contest (CERC 21) ›

CF 104797D - DJ Darko

We are given a line of speakers, each speaker has an initial volume and a cost factor that tells us how much energy is needed to change its volume by one unit. Two kinds of operations are performed on contiguous segments of this line.

Practice › Codeforces Solutions › 2021-2022 ICPC Central Europe Regional Contest (CERC 21) ›

CF 104797E - Fishing

We are given a sparse grid of

Practice › Codeforces Solutions › 2021-2022 ICPC Central Europe Regional Contest (CERC 21) ›

CF 104797C - Cactus cutting

We are given an undirected connected graph that has a restricted structure: every edge belongs to at most one simple cycle, so cycles can overlap only at vertices, not through shared edges. This is the standard definition of a cactus graph.

Practice › Codeforces Solutions › 2021-2022 ICPC Central Europe Regional Contest (CERC 21) ›

CF 104797A - Airline

We are given an undirected graph that is already a tree, meaning there are exactly n nodes and n−1 edges and there is exactly one simple path between any two nodes. The distance between two nodes is the number of edges on this unique path.