2022-2023 ICPC Northwestern European Regional Programming Contest (NWERC 2022)
12 problems from 2022-2023 ICPC Northwestern European Regional Programming Contest (NWERC 2022) (contest 104875), difficulty -. 12/12 solutions verified against sample I/O.
2022-2023 ICPC Northwestern European Regional Programming Contest (NWERC 2022)
ICPC/IOI | 12 problems | 12/12 verified | Difficulty - | 11m 20s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Alternating Algorithm | 52s | ✓ | |||
| B | Bottle Flip | 48s | ✓ | |||
| C | Circular Caramel Cookie | 54s | ✓ | |||
| D | Delft Distance | 55s | ✓ | |||
| E | ETA | 49s | ✓ | |||
| F | Faster Than Light | 1m 9s | ✓ | |||
| G | Going in Circles | 1m 21s | ✓ | |||
| H | High-quality Tree | 45s | ✓ | |||
| I | Interview Question | 1m 3s | ✓ | |||
| J | Justice Served | 57s | ✓ | |||
| K | Kebab Pizza | 47s | ✓ | |||
| L | Last Guess | 1m | ✓ |
CF 104875B - Bottle Flip
We are given a vertical cylindrical bottle of height $h$ and radius $r$. The bottle is partially filled with water up to some height $x$, measured from the bottom. The remaining space above the water is filled with air.
CF 104875G - Going in Circles
We are placed on a cyclic structure of train carriages. Each carriage contains a binary light switch, either 0 or 1. We start in an unknown carriage, and we are allowed to move to adjacent carriages along the cycle or flip the switch in the current carriage.
CF 104875D - Delft Distance
The city is a rectangular grid of size $h times w$. Each cell contains a building occupying most of a $10 times 10$ meter square footprint. Some cells are square buildings, others are circular towers whose footprint is a disk of diameter $10$, so radius $5$.
CF 104875L - Last Guess
We are given a Wordle-like process where several guesses have already been made and each guess comes with full feedback using the usual green, yellow, and black rules, including correct handling of repeated letters.
CF 104875K - Kebab Pizza
We are given a circular pizza split into $n$ slices. Each slice has exactly two toppings assigned by the customer who eats that slice. Across all slices there are $k$ possible topping types.
CF 104875J - Justice Served
Each suspect corresponds to a time interval during which they were in the room. For suspect i, we are given an arrival time a and a duration t, which defines an interval from a to a + t.
CF 104875I - Interview Question
We are given a slice of a FizzBuzz-like sequence, but instead of knowing the rules, we only see the output and must reconstruct the hidden parameters.
CF 104875H - High-quality Tree
We are given an undirected tree rooted at node 1, where each node has at most two children once the root is fixed. The notion of balance is defined locally: for any node, consider the heights of its left and right subtrees.
CF 104875F - Faster Than Light
We are given several axis-aligned rectangles in the plane. Each rectangle represents a “room” of a spaceship, and we are allowed to fire a single infinite straight line beam in any direction.
CF 104875E - ETA
We are asked to construct an undirected connected graph where vertex 1 is treated as the exit. A player starts at a uniformly random vertex and then always moves optimally toward vertex 1, meaning the travel time from a node is simply its shortest-path distance to node 1.
CF 104875C - Circular Caramel Cookie
We are given a configuration of unit squares laid out on an infinite grid. Think of the plane split by integer lattice lines into 1 by 1 cells.
CF 104875A - Alternating Algorithm
We are given an array of length $n+1$, and we repeatedly apply a very specific parallel “adjacent swapping” procedure until the array becomes sorted in non-decreasing order.