2019-2020 ICPC Central Europe Regional Contest (CERC 19)

12 problems from 2019-2020 ICPC Central Europe Regional Contest (CERC 19) (contest 104666), difficulty -. 6/12 solutions verified against sample I/O.

12 items

2019-2020 ICPC Central Europe Regional Contest (CERC 19)

ICPC/IOI | 12 problems | 6/12 verified | Difficulty - | 16m

#	Problem	Time	✓
A	ABB	1m 25s
B	Be Geeks!	1m 35s
C	Bob in Wonderland	1m 34s	✓
D	Crimson Sexy Jalape\u00f1os	1m 26s
E	Deep800080	1m 33s	✓
F	Zeldain Garden	1m 4s	✓
G	Light Emitting Hindenburg	1m 17s	✓
H	K==S	1m 7s	✓
I	Ponk Warshall	1m 13s
J	Saba1000kg	1m 23s	✓
K	Screamers in the Storm	2m 4s
L	The Bugs	19s

Practice › Codeforces Solutions › 2019-2020 ICPC Central Europe Regional Contest (CERC 19) ›

CF 104666K - Screamers in the Storm

We are given a building footprint in the plane, described as an axis-aligned simple polygon. Above every point inside this footprint there is a piecewise linear roof surface.

Practice › Codeforces Solutions › 2019-2020 ICPC Central Europe Regional Contest (CERC 19) ›

CF 104666J - Saba1000kg

We are given an undirected graph representing islands and direct influence paths between some pairs of islands. Influence is transitive, meaning if island A can influence B and B can influence C, then A and C are in the same connected environment even without a direct edge.

Practice › Codeforces Solutions › 2019-2020 ICPC Central Europe Regional Contest (CERC 19) ›

CF 104666L - The Bugs

Codeforces 104666L: The Bugs

Practice › Codeforces Solutions › 2019-2020 ICPC Central Europe Regional Contest (CERC 19) ›

CF 104666I - Ponk Warshall

We are given two strings of equal length over the alphabet {A, C, G, T}. The second string is a permutation of the first, meaning both contain exactly the same multiset of characters.

Practice › Codeforces Solutions › 2019-2020 ICPC Central Europe Regional Contest (CERC 19) ›

CF 104666H - K==S

We are asked to count how many sequences of length $N$ can be formed from an alphabet of 26 symbols, while avoiding a set of forbidden substrings.

Practice › Codeforces Solutions › 2019-2020 ICPC Central Europe Regional Contest (CERC 19) ›

CF 104666G - Light Emitting Hindenburg

Each musician can be viewed as a 30-bit mask describing availability across the days of November. For a given day, the corresponding bit is set if the musician is available on that day, and unset otherwise.

Practice › Codeforces Solutions › 2019-2020 ICPC Central Europe Regional Contest (CERC 19) ›

CF 104666F - Zeldain Garden

We are looking at all integers in a range from $N$ to $M$. For each integer $x$ in this range, we define its “variability” as the number of ways to split $x$ identical items into a convoy of identical lorries such that every lorry carries the same number of items and all…

Practice › Codeforces Solutions › 2019-2020 ICPC Central Europe Regional Contest (CERC 19) ›

CF 104666E - Deep800080

We are given a straight pier in the plane, defined by a line passing through the origin and a second point $(A, B)$. We are allowed to choose any point on this infinite line as the location of a barbecue grill.

Practice › Codeforces Solutions › 2019-2020 ICPC Central Europe Regional Contest (CERC 19) ›

CF 104666D - Crimson Sexy Jalapeños

The game is played on a large rectangular grid that behaves like a chocolate bar. Some cells are contaminated. The two players repeatedly cut the current remaining rectangle along grid lines and discard one side of the cut, keeping the other side as the new active region.

Practice › Codeforces Solutions › 2019-2020 ICPC Central Europe Regional Contest (CERC 19) ›

CF 104666B - Be Geeks!

We are given a sequence of positive integers and we consider every contiguous subarray. For each subarray, two values are extracted: the greatest common divisor of all elements inside it and the maximum element inside it.

Practice › Codeforces Solutions › 2019-2020 ICPC Central Europe Regional Contest (CERC 19) ›

CF 104666C - Bob in Wonderland

We are given a connected structure of $N$ labeled nodes, where each pair in the input describes an undirected link between two nodes. This structure is guaranteed to be a tree, so it has exactly $N-1$ edges and no cycles.

Practice › Codeforces Solutions › 2019-2020 ICPC Central Europe Regional Contest (CERC 19) ›

CF 104666A - ABB

We are given a sequence of colored bungalows arranged in a straight line from the lake toward the forest. Each bungalow contributes one character to a string, so the whole street is represented as a string where position 1 is closest to the lake and position N is at the forest…