2024-2025 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2024)
11 problems from 2024-2025 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2024) (contest 105431), difficulty -. 11/11 solutions verified against sample I/O.
2024-2025 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2024)
ICPC/IOI | 11 problems | 11/11 verified | Difficulty - | 11m 47s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Avoiding the Abyss | 57s | ✓ | |||
| B | Baseball Court | 1m 5s | ✓ | |||
| C | Composed Rhythms | 57s | ✓ | |||
| D | Double Deck | 1m 5s | ✓ | |||
| E | Elapid Errands | 1m 11s | ✓ | |||
| F | Fence Fee | 56s | ✓ | |||
| G | Guessing Passwords | 1m 6s | ✓ | |||
| H | Hotfix | 1m 24s | ✓ | |||
| I | Infinite Cash | 1m 10s | ✓ | |||
| J | Jungle Game | 1m 8s | ✓ | |||
| K | Knitting Pattern | 48s | ✓ |
CF 105431J - Jungle Game
We are given a list of forbidden “challenge points” in a two-dimensional integer grid. Each challenge is a pair of coordinates $(Pk, Sk)$, where both values lie between 2 and $2N$.
CF 105431K - Knitting Pattern
We are given a circular sweater made of $N$ equally spaced positions. A knitting pattern of length $P$ must be placed repeatedly along this circle.
CF 105431H - Hotfix
We are given a single string consisting of upper and lowercase Latin letters. Conceptually, an earlier problem would enumerate all distinct substrings of this string and output each substring together with how many times it appears in the original string.
CF 105431I - Infinite Cash
We are tracking a person’s cash balance over time under two competing forces. Every day starts with an amount of money, and the person immediately spends half of whatever they currently have, rounding the amount spent upward.
CF 105431G - Guessing Passwords
We are given a compressed “game log” from a Wordle-like system, but the actual guesses are lost. What remains is only the feedback grid: for each guess and each position, we know whether the character was marked gray or yellow.
CF 105431E - Elapid Errands
We are working on an infinite grid where Carl starts at the origin and must physically walk step by step to a sequence of target coordinates, visiting them in the given order. Each move changes the position by exactly one unit in one of the four cardinal directions.
CF 105431D - Double Deck
We are given two sequences representing the order of cards in two face-up decks. Each deck contains exactly $N cdot K$ cards, and the values come from the range $1$ to $N$.
CF 105431F - Fence Fee
We are given a planar drawing formed by straight fence segments. Each segment connects two grid points, and together all segments form a single connected planar graph with no crossings and no redundant edges.
CF 105431B - Baseball Court
We are given a rectangular field divided conceptually into unit grid positions, with dimensions $a times b$. We have exactly $N$ identical unit square tiles, and we must place all of them inside this grid. The placement is restricted in two structural ways.
CF 105431A - Avoiding the Abyss
We are given two distinct points on the integer grid, a start point and a target point. Between them lies an axis-aligned rectangular obstacle whose exact coordinates are unknown.
CF 105431C - Composed Rhythms
The task is to take a single integer $N$, representing a total number of beats in a musical rhythm, and express it as a sum of smaller building blocks. Each building block must have size either 2 or 3, and together they must sum exactly to $N$.