2022-2023 ACM-ICPC German Collegiate Programming Contest (GCPC 2022)
13 problems from 2022-2023 ACM-ICPC German Collegiate Programming Contest (GCPC 2022) (contest 104059), difficulty -. 12/13 solutions verified against sample I/O.
2022-2023 ACM-ICPC German Collegiate Programming Contest (GCPC 2022)
ICPC/IOI | 13 problems | 12/13 verified | Difficulty - | 13m 10s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Alternative Architecture | 1m 9s | ✓ | |||
| B | Breeding Bugs | 58s | ✓ | |||
| C | Chaotic Construction | 52s | ✓ | |||
| D | Diabolic Doofenshmirtz | 1m 11s | ✓ | |||
| E | Enjoyable Entree | 43s | ✓ | |||
| F | Formula Flatland | 1m 4s | ✓ | |||
| G | Guessing Game | 2m 6s | ||||
| H | Hardcore Hangman | 49s | ✓ | |||
| I | Improving IT | 54s | ✓ | |||
| J | Jesting Jabberwocky | 42s | ✓ | |||
| K | K.O. Kids | 54s | ✓ | |||
| L | Lots of Land | 48s | ✓ | |||
| M | Mirror Madness | 1m | ✓ |
CF 104059M - Mirror Madness
We are given a simple polygon whose edges alternate between horizontal and vertical segments, so the shape is an axis-aligned rectilinear loop. A laser starts from a boundary point and travels inside the polygon along a diagonal direction (1, 1).
CF 104059L - Lots of Land
We are given a rectangular grid with height ℓ and width w, and we need to partition it into exactly n disjoint regions. Each region must consist of whole grid cells, must form a rectangle aligned with the grid, and all n regions must have equal area.
CF 104059G - Guessing Game
All operations are in the family algebra of Exercise 203. For families $f,g$, the quotient is $$f/g = {alpha mid forall beta in g,; alpha cup beta in f ;text{and}; alpha cap beta = varnothing},$$ and the remainder is $$f bmod g = f setminus (g sqcup (f/g)).
CF 104059K - K.O. Kids
A 2 × n bridge is built from n positions, where each position has two possible tiles: left and right. Exactly one of the two is safe at each position, and the safe side for position i is given by a string of length n, where each character tells whether the left or the right…
CF 104059J - Jesting Jabberwocky
We are given a sequence of cards represented as a string, where each character is one of four types corresponding to suits.
CF 104059I - Improving IT
We are planning the lifecycle of a single CPU over a timeline of n months. In each month i, there is a known purchase price for buying a fresh CPU.
CF 104059H - Hardcore Hangman
We are interacting with a hidden string of lowercase English letters whose length can be up to 10,000. Our only way to obtain information is by asking queries of the form “given a set of letters, which positions in the hidden string contain any of these letters”.
CF 104059E - Enjoyable Entree
The canteen starts with two “base soups” that we can think of as two pure ingredients: one is π-tato soup and the other is τ-mato soup. From day to day, the recipe evolves deterministically. On day 1 the soup is entirely π-tato, on day 2 it is entirely τ-mato.
CF 104059F - Formula Flatland
We are given a geometric graph whose vertices are crossings in a flat map and whose edges are road segments. The roads are straight segments between given endpoints, and the crucial geometric guarantee is that any two segments only intersect at shared endpoints, so the drawing…
CF 104059D - Diabolic Doofenshmirtz
We are interacting with an unknown circular track of integer length $L$, where $1 le L le 10^{12}$. Perry starts at position 0 and moves forward at constant speed 1, so at time $t$ his position inside the current lap is exactly $t bmod L$.
CF 104059A - Alternative Architecture
We are given a rectangular LEGO base of size $a times b$. Normally, such a rectangle would only be placed axis-aligned on a grid of studs, but here the rule is different: the rectangle can be rotated freely in the plane.
CF 104059B - Breeding Bugs
We are given a collection of cicadas, each with a positive integer “periodicity” value. We are allowed to discard some of them, and we then consider only the remaining ones.
CF 104059C - Chaotic Construction
We are working with a cyclic street split into $n$ consecutive segments, where segment $i$ is adjacent to $i-1$ and $i+1$, and segment $1$ is also adjacent to segment $n$. Some segments can be closed over time, and a closed segment cannot be traversed.