2024-2025 ICPC Northwestern European Regional Programming Contest (NWERC 2024)
13 problems from 2024-2025 ICPC Northwestern European Regional Programming Contest (NWERC 2024) (contest 105562), difficulty -. 13/13 solutions verified against sample I/O.
2024-2025 ICPC Northwestern European Regional Programming Contest (NWERC 2024)
ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 13m 54s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Alphabetical Aristocrats | 52s | ✓ | |||
| B | Binary Search | 1m 5s | ✓ | |||
| C | Connect Five | 1m 3s | ✓ | |||
| D | Dutch Democracy | 1m 7s | ✓ | |||
| E | Evolving Etymology | 52s | ✓ | |||
| F | Flowing Fountain | 46s | ✓ | |||
| G | Glued Grid | 1m 21s | ✓ | |||
| H | Hash Collision | 1m 22s | ✓ | |||
| I | It's a Kind of Magic | 1m 5s | ✓ | |||
| J | Jib Job | 1m 13s | ✓ | |||
| K | Kruidnoten | 55s | ✓ | |||
| L | Limited Library | 42s | ✓ | |||
| M | Mouse Trap | 1m 31s | ✓ |
CF 105562C - Connect Five
We are given five special intersections on an infinite grid of city blocks. Each block is connected by roads that run strictly horizontally or vertically, and every adjacent pair of intersections along a row or column corresponds to one road segment of equal length.
CF 105562M - Mouse Trap
We are given a convex polygon described by its vertices in counterclockwise order. Inside this polygon, we imagine a point chosen uniformly at random.
CF 105562G - Glued Grid
We are given an $h times w$ grid representing a sliding puzzle. Each cell contains a tile label, with the bottom-right cell containing the empty space labeled as $0$.
CF 105562J - Jib Job
Each crane sits at a fixed point on the plane and has a vertical tower height. From the top of each tower, we attach a rotating horizontal beam. The beam length must be a positive integer and cannot exceed the tower height.
CF 105562K - Kruidnoten
We are working on a weighted graph where intersections are nodes and cycleways are undirected edges with positive lengths. Karlijn starts at node 1 and wants to reach node n. Some nodes contain shops.
CF 105562D - Dutch Democracy
We are given a collection of political parties, each with a certain number of seats. A “coalition” is simply a subset of these parties. We want to count how many subsets satisfy a very specific notion of being a valid governing coalition.
CF 105562E - Evolving Etymology
We start with a string of length n and a transformation that builds a new string from a doubled version of itself. Each application takes the current string t, forms t + t, and then keeps characters at positions 0, 2, 4, ... of that doubled string.
CF 105562H - Hash Collision
We are given a hidden function $f$ that maps every integer from $1$ to $n$ back into the same range. We do not see the function directly. Instead, we can ask queries of the form “apply $f$ exactly $c$ times starting from $r$” and receive the resulting value $f^c(r)$.
CF 105562A - Alphabetical Aristocrats
We are given a collection of surnames written as free-form strings. Each surname may contain uppercase letters, lowercase letters, spaces, and apostrophes.
CF 105562L - Limited Library
We are given a library shelving system where each shelf can hold a fixed number of books if it is used purely for books. However, a shelf can optionally also display an art piece, which reduces the effective capacity of that shelf for books.
CF 105562I - It's a Kind of Magic
We are working with a $3 times 3$ grid filled with positive integers. The grid is considered valid when every row, every column, and both diagonals have the same product.
CF 105562F - Flowing Fountain
We are given a vertical stack of bowls, each bowl sitting above the next one. Every bowl has a fixed capacity, and we process two kinds of operations over time. One operation pours some amount of champagne into a chosen bowl.
CF 105562B - Binary Search
We are given an undirected graph where each vertex carries a label, either 0 or 1. A walk is formed by choosing a starting vertex and repeatedly moving along edges, writing down the label of each visited vertex. This produces a binary string.