2024-2025 ICPC German Collegiate Programming Contest (GCPC 2024)
13 problems from 2024-2025 ICPC German Collegiate Programming Contest (GCPC 2024) (contest 105394), difficulty -. 13/13 solutions verified against sample I/O.
2024-2025 ICPC German Collegiate Programming Contest (GCPC 2024)
ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 14m 1s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Alien Attack 2 | 44s | ✓ | |||
| B | Bookshelf Bottleneck | 46s | ✓ | |||
| C | Copycat Catcher | 1m 2s | ✓ | |||
| D | Dark Alley | 1m | ✓ | |||
| E | Even Odd Game | 1m 12s | ✓ | |||
| F | Fair Fruitcake Fragmenting | 1m 8s | ✓ | |||
| G | Geometric Gridlock | 1m 32s | ✓ | |||
| H | Headline Heat | 48s | ✓ | |||
| I | Interference | 1m 5s | ✓ | |||
| J | Jigsaw Present | 1m 11s | ✓ | |||
| K | Kitten of Chaos | 1m 25s | ✓ | |||
| L | Laundry | 1m 11s | ✓ | |||
| M | Musical Mending | 57s | ✓ |
CF 105394K - Kitten of Chaos
We are given a long string composed only of four characters: b, d, p, and q. This string is printed on a rigid glass object.
CF 105394M - Musical Mending
We are given a sequence of pitch offsets for piano keys relative to the first key. These values describe the current relative tuning, not the absolute frequencies, but they are consistent in the sense that shifting every key by the same constant would represent a valid…
CF 105394I - Interference
We are given a sequence of operations over a very large one-dimensional line, where positions can go up to 1e9. Two types of operations are performed online. The first type inserts a wave.
CF 105394G - Geometric Gridlock
We are asked to fill an $h times w$ grid completely with connected pieces of size five cells. Each piece must be one of the classical pentomino shapes, meaning it is a connected set of five unit squares matching one of the twelve allowed geometric forms up to rotation and…
CF 105394F - Fair Fruitcake Fragmenting
We are given the boundary of a simple polygon that represents a cake. The polygon is described by its vertices in counterclockwise order, and it has a strong structural property: it is invariant under a 180 degree rotation.
CF 105394C - Copycat Catcher
We are given a reference program written as a sequence of tokens, and then multiple query programs. Each program is already tokenized, so we do not deal with raw characters but with a list of strings.
CF 105394L - Laundry
We are given items that must be washed using one of three washing programs, A, B, or C. Each laundry load uses exactly one program and can contain at most $k$ items. Every item does not have a single fixed program, instead it comes with a set of allowed programs.
CF 105394J - Jigsaw Present
We are given a collection of $n$ jigsaw puzzles. Each puzzle has two attributes: the number of pieces it contains and a difficulty value that can be positive or negative. A “gift” is defined as choosing any subset of these puzzles.
CF 105394H - Headline Heat
We are given a collection of university names, a set of rivalries between some pairs of universities, and a sequence of news articles. For each article, we must decide whether it is “balanced enough” or whether it would anger at least one coach.
CF 105394E - Even Odd Game
We are given a finite collection of cards, each card representing a unary operation on a shared integer state. Each move, a player picks an unused card and applies its operation to the current value. The players alternate until all cards are consumed.
CF 105394D - Dark Alley
We are working on a one-dimensional alley of positions from 1 to n. At certain positions we may place or remove lamps, each lamp having a positive brightness value.
CF 105394B - Bookshelf Bottleneck
We are given a collection of cuboid-shaped books, and each book can be freely rotated in 3D before being placed. All books must be placed upright on a shelf in a single horizontal row, meaning each book contributes exactly one rectangular footprint on the shelf surface, and…