2025 ICPC Nanchang Invitational and Jiangxi Provincial Collegiate Programming Contest
13 problems from 2025 ICPC Nanchang Invitational and Jiangxi Provincial Collegiate Programming Contest (contest 105911), difficulty -. 12/13 solutions verified against sample I/O.
2025 ICPC Nanchang Invitational and Jiangxi Provincial Collegiate Programming Contest
ICPC/IOI | 13 problems | 12/13 verified | Difficulty - | 15m 40s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Nezha Naohai | 48s | ✓ | |||
| B | LEGO-complete | 1m 9s | ✓ | |||
| C | Osiris | 50s | ✓ | |||
| D | Virtuous Pope | 48s | ✓ | |||
| E | God's String on This Wonderful World | 55s | ✓ | |||
| F | Caloric Difference | 51s | ✓ | |||
| G | Exploration | 1m 1s | ✓ | |||
| H | Bingo Game | 5m 19s | ||||
| I | Dating Day | 50s | ✓ | |||
| J | Hot Pepper | 55s | ✓ | |||
| K | Rotation | 42s | ✓ | |||
| L | Regnaissance | 50s | ✓ | |||
| M | Divide coins | 42s | ✓ |
CF 105911E - God's String on This Wonderful World
We are given a long string of lowercase letters and a fixed integer $k$. For any substring, we are asked whether its letters can be rearranged so that the substring becomes exactly $k$ identical blocks concatenated together.
CF 105911C - Osiris
We are given Jotaro’s initial poker hand of five cards drawn from a standard 52-card deck. Each card has a rank from 1 to 13 (Ace through King), and each rank appears exactly four times in the deck.
CF 105911H - Bingo Game
Codeforces 105911H: Bingo Game
CF 105911M - Divide coins
We start with $n$ identical coins, all initially showing heads. Another player secretly flips exactly $k$ of them to tails, and we do not know which subset was chosen.
CF 105911L - Regnaissance
We are given a tree with nodes labeled from 1 to n. The structure of the tree is fixed. Each query provides three values l, r, and x, and asks for a single node: if we consider only the nodes in the contiguous label range from l to r, and treat x as the root of the tree, we…
CF 105911K - Rotation
We are given a row of statues, each initially pointing in one of four directions arranged in a cycle: front, right, back, left, and then back to front again after a full rotation.
CF 105911I - Dating Day
We are given a binary string representing a schedule over n time slots. Each position is either 1, meaning TreeQwQ is currently on a date, or 0, meaning free time.
CF 105911G - Exploration
We are given a directed graph where each cave is a node and each one-way passage is a directed edge with a weight called difficulty. Alice starts at a specified node with an initial integer stamina.
CF 105911B - LEGO-complete
We are given a grid where some cells are marked as occupied and all occupied cells form one connected region if we move in four directions.
CF 105911D - Virtuous Pope
We are given several line segments inside a rectangular box aligned with the coordinate axes. Each segment has both endpoints on the surface of the box, so every segment “lives” entirely within or on the boundary of the cuboid.
CF 105911J - Hot Pepper
We are given several points on an infinite grid. Each point represents a pepper placed at a specific coordinate, and each pepper has a fixed type. One type interacts along its column, meaning it “cares” about other peppers sharing the same x-coordinate.
CF 105911F - Caloric Difference
We are given a sequence of days. On each day we choose a nonnegative real number $ri$, interpreted as caloric intake, but it is restricted to lie in a fixed interval $[L, R]$.
CF 105911A - Nezha Naohai
We are given three independent events that represent how long Nezha spends causing disturbances in the sea. Each event has a duration measured in hours, and during every hour of disturbance, a fixed number of complaints is generated.