2023-2024 ICPC Northwestern European Regional Programming Contest (NWERC 2023)
12 problems from 2023-2024 ICPC Northwestern European Regional Programming Contest (NWERC 2023) (contest 105112), difficulty -. 12/12 solutions verified against sample I/O.
2023-2024 ICPC Northwestern European Regional Programming Contest (NWERC 2023)
ICPC/IOI | 12 problems | 12/12 verified | Difficulty - | 12m 55s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Arranging Adapters | 49s | ✓ | |||
| B | Brickwork | 52s | ✓ | |||
| C | Chair Dance | 1m 13s | ✓ | |||
| D | Date Picker | 1m 7s | ✓ | |||
| E | Exponentiation | 58s | ✓ | |||
| F | Fixing Fractions | 1m 13s | ✓ | |||
| G | Galaxy Quest | 58s | ✓ | |||
| H | Higher Arithmetic | 55s | ✓ | |||
| I | Isolated Island | 53s | ✓ | |||
| J | Jogging Tour | 1m 3s | ✓ | |||
| K | Klompendans | 56s | ✓ | |||
| L | Lateral Damage | 1m 58s | ✓ |
CF 105112L - Lateral Damage
We are placed in a hidden 2D grid of size up to 100 by 100. Inside this grid lie at most ten ships, and each ship is always a straight segment of exactly five consecutive cells, either horizontal or vertical. Ships never overlap, but they can touch each other.
CF 105112J - Jogging Tour
We are given a set of points in the plane, each representing a bakery. We are allowed to build a street system that consists of exactly two infinite families of straight, parallel lines that are perpendicular to each other.
CF 105112K - Klompendans
We are placed on the top-left tile of an $n times n$ grid and allowed to walk across the grid using two different “knight-like” movement rules.
CF 105112I - Isolated Island
The island can be seen as a planar drawing of line segments. Each fence is a straight segment, and fences may cross each other, creating a subdivision of the plane into multiple polygonal regions. Each region corresponds to a piece of land owned by one person.
CF 105112H - Higher Arithmetic
We are given a multiset of integers, and we are allowed to build a single arithmetic expression that uses each integer exactly once. The only operations available are addition and multiplication, and we may freely insert parentheses to control evaluation order.
CF 105112G - Galaxy Quest
We are given a fixed network of planets in 3D space, where certain pairs of planets are connected by bidirectional space highways. Each highway is a straight segment with a known length determined by Euclidean distance between its endpoints.
CF 105112F - Fixing Fractions
Two integers are given as strings of digits, forming a numerator and denominator on each side of a fraction equation.
CF 105112D - Date Picker
We are given a weekly calendar encoded as a 7 by 24 grid. Each row corresponds to a day and each column corresponds to an hour. A cell is either free or blocked. Free means you are available at that day and hour, blocked means you are busy.
CF 105112E - Exponentiation
We maintain a collection of variables, all starting from the same base value 2023. Two kinds of operations are applied online. One operation replaces one variable by raising it to the power of another variable.
CF 105112C - Chair Dance
We are simulating a circle of positions numbered from 1 to n, each initially occupied by exactly one player whose label matches the chair number. The system then applies a sequence of global transformations that move every currently alive player at once.
CF 105112B - Brickwork
We are given a set of brick types, each with a fixed length, and we are allowed to use an unlimited number of bricks of each type. The goal is to construct an infinitely tall wall of fixed width w. Each row is a sequence of bricks whose total length is exactly w.