2023-2024 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2023)
11 problems from 2023-2024 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2023) (contest 105427), difficulty -. 11/11 solutions verified against sample I/O.
2023-2024 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2023)
ICPC/IOI | 11 problems | 11/11 verified | Difficulty - | 10m 59s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Aperiodic Appointments | 55s | ✓ | |||
| B | Berry Battle 2 | 1m 5s | ✓ | |||
| C | Converting Romans | 54s | ✓ | |||
| D | Die Hard | 1m 3s | ✓ | |||
| E | Electronic Components | 1m 10s | ✓ | |||
| F | Factor-Full Tree | 51s | ✓ | |||
| G | Groups of Strangers | 1m 6s | ✓ | |||
| H | Heroes of Velmar | 56s | ✓ | |||
| I | Intertwined | 1m 10s | ✓ | |||
| J | Jamboree | 55s | ✓ | |||
| K | Karl Coder | 54s | ✓ |
CF 105427K - Karl Coder
We are given an array-like buffer of length $2N$, but $N$ is unknown. The structure of this buffer is very specific: the first $N$ positions store nonzero bytes, while the remaining $N$ positions store zeros.
CF 105427J - Jamboree
We are given a collection of items, each with a positive size, and a fixed number of scouts. Each item must be assigned to exactly one scout. A scout can carry at most two items, and the load of a scout is the sum of the sizes of items assigned to them.
CF 105427I - Intertwined
A rope is initially stretched from the origin to a fixed point on the positive x-axis. We then start rotating this rope counter-clockwise around whichever point is currently acting as its pivot. At the beginning, the pivot is the origin.
CF 105427G - Groups of Strangers
We are given a social graph of employees where edges represent mutual acquaintance. The task is to split all employees into three groups such that no two people who know each other end up in the same group.
CF 105427H - Heroes of Velmar
We are given the final board state of a two-player card game after all six turns have already been played. The board consists of three independent locations. At each location, each player may have placed up to four cards, and each card contributes a fixed power value.
CF 105427E - Electronic Components
Each electronic component belongs to a type, and every type comes with a processing time. There are multiple copies of each type.
CF 105427D - Die Hard
We are given three different dice. Each die has six faces, but the values on those faces are arbitrary integers between 1 and 1000 and can repeat. A game is played by first letting John choose one die, then Hans chooses one of the remaining two dice.
CF 105427F - Factor-Full Tree
We are given a rooted tree with N vertices, where vertex 1 is the root. The task is to assign each vertex v a positive integer label xv such that ancestry in the tree is encoded purely through divisibility: a vertex u is an ancestor of v if and only if xu divides xv.
CF 105427B - Berry Battle 2
We are simulating a turn based game on a long binary string where each position either contains a berry or is empty. A move consists of choosing an index $i$ and removing all berries in the fixed length segment from $i$ to $i+3$.
CF 105427A - Aperiodic Appointments
We are building a binary sequence day by day, where each position is either zero or one. The first few days are fixed as zero. After that, each new day depends on the structure of what has already been generated.
CF 105427C - Converting Romans
We are given a collection of strings, each string representing a number written in a simplified Roman numeral system. Each character is one of the standard Roman symbols I, V, X, L, C, D, M with fixed values 1, 5, 10, 50, 100, 500, 1000.