The 2024 International Collegiate Programming Contest in Hubei Province, China
12 problems from The 2024 International Collegiate Programming Contest in Hubei Province, China (contest 105139), difficulty -. 12/12 solutions verified against sample I/O.
The 2024 International Collegiate Programming Contest in Hubei Province, China
Special | 12 problems | 12/12 verified | Difficulty - | 10m 34s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Long Live | 56s | ✓ | |||
| B | Nana Likes Polygons | 49s | ✓ | |||
| C | Lili Likes Polygons | 1m 2s | ✓ | |||
| D | MACARON Likes Happy Endings | 1m 5s | ✓ | |||
| E | Spicy or Grilled? | 36s | ✓ | |||
| F | Enchanted | 49s | ✓ | |||
| G | Genshin Impact Startup Forbidden II | 49s | ✓ | |||
| H | Genshin Impact Startup Forbidden III | 46s | ✓ | |||
| I | Colorful Tree | 1m 1s | ✓ | |||
| J | Points on the Number Axis A | 38s | ✓ | |||
| K | Points on the Number Axis B | 54s | ✓ | |||
| L | LCMs | 1m 9s | ✓ |
CF 105139L - LCMs
We are moving on a graph whose vertices are integers greater than 1. From any integer $u$, we may move to any other integer $v$, and the cost of that move is $mathrm{lcm}(u, v)$.
CF 105139C - Lili Likes Polygons
The input describes a set of axis-aligned rectangles on an infinite grid. After applying all of them, every grid cell covered by at least one rectangle becomes “bare”.
CF 105139K - Points on the Number Axis B
We are given an ordered set of points on a number line. At each step, Bob picks two adjacent points in the current ordering, removes them, and inserts their midpoint.
CF 105139J - Points on the Number Axis A
We are given a multiset of points placed on a number line. At each step, we repeatedly pick any two existing points, remove them, and insert their midpoint. This continues until only one point remains, and the process stops.
CF 105139I - Colorful Tree
We are given a fixed tree, and every vertex starts in one of two states that change over time. Initially, all vertices are white. Each operation selects two vertices and paints every vertex on the unique path between them black. Once a vertex becomes black, it never changes back.
CF 105139H - Genshin Impact Startup Forbidden III
We are given a large grid, but only a small number of cells actually contain fish. Each such cell can contain up to three fish.
CF 105139G - Genshin Impact Startup Forbidden II
We are simulating a simplified Go game on a fixed 19×19 grid, where stones are added one by one and never removed except when they become “dead”.
CF 105139F - Enchanted
We are given an array of integers where each value represents the initial level of an enchanted book. Books are placed in a fixed order, and several types of operations are performed over this array.
CF 105139D - MACARON Likes Happy Endings
We are given a sequence of chapter costs, and we must split this sequence into at most $k$ contiguous segments, where each segment corresponds to a day of reading.
CF 105139E - Spicy or Grilled?
Each test case describes a simple catering plan for a programming contest. There are $n$ contestants in total. Exactly $x$ of them choose a grilled chicken burger set, while the remaining $n - x$ choose a spicy chicken burger set.
CF 105139A - Long Live
We are given two positive integers $x$ and $y$. From these two values we compute their greatest common divisor and least common multiple, and then form a derived quantity that combines them through a square root.
CF 105139B - Nana Likes Polygons
We are given several independent test cases. In each one, we receive up to 100 points on a 2D plane. From these points, we are allowed to choose any subset and look at the convex polygon formed by the chosen points as its vertices.