2024 China Collegiate Programming Contest (CCPC) Harbin Onsite (The 3rd Universal Cup. Stage 14: Harbin)
13 problems from 2024 China Collegiate Programming Contest (CCPC) Harbin Onsite (The 3rd Universal Cup. Stage 14: Harbin) (contest 105459), difficulty -. 13/13 solutions verified against sample I/O.
2024 China Collegiate Programming Contest (CCPC) Harbin Onsite (The 3rd Universal Cup. Stage 14: Harbin)
Special | 13 problems | 13/13 verified | Difficulty - | 15m 14s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Build a Computer | 1m 5s | ✓ | |||
| B | Concave Hull | 1m 2s | ✓ | |||
| C | Giving Directions in Harbin | 56s | ✓ | |||
| D | A Simple String Problem | 1m 26s | ✓ | |||
| E | Marble Race | 1m 25s | ✓ | |||
| F | 1D Galaxy | 1m 1s | ✓ | |||
| G | Welcome to Join the Online Meeting! | 1m | ✓ | |||
| H | Subsequence Counting | 1m 25s | ✓ | |||
| I | A Brand New Geometric Problem | 1m 20s | ✓ | |||
| J | New Energy Vehicle | 1m 14s | ✓ | |||
| K | Farm Management | 1m 20s | ✓ | |||
| L | A Game On Tree | 51s | ✓ | |||
| M | Weird Ceiling | 1m 9s | ✓ |
CF 105459L - A Game On Tree
We are given a tree with $n$ nodes. A “move” in this problem is not about edges or nodes directly, but about choosing a simple path between any two nodes in the tree.
CF 105459K - Farm Management
We are deciding how to distribute a fixed working day of length $m$ across $n$ crop types. Each crop $i$ gives a linear profit: every unit of time spent on it contributes $wi$ profit.
CF 105459J - New Energy Vehicle
We are given a vehicle that can consume energy from multiple batteries while moving forward on a number line. Each battery starts fully charged and contributes a fixed amount of usable distance, one unit of charge equals one kilometer.
CF 105459H - Subsequence Counting
We are given a long sequence that is not stored explicitly as an array, but described as runs of equal values. Each run contributes a block of identical elements, so the original sequence can be seen as a compressed array of length $L$, where $L$ can be extremely large.
CF 105459G - Welcome to Join the Online Meeting!
We are given an undirected graph where vertices represent participants and edges represent mutual acquaintance. The goal is to “activate” all participants in an online meeting that starts with exactly one creator and then grows by invitations along acquaintance edges.
CF 105459F - 1D Galaxy
We are given a set of particles on a line. Each particle starts at a coordinate and has a fixed weight, which can be positive or negative.
CF 105459D - A Simple String Problem
We are working with a very thin grid, only two rows and many columns. From any cell, movement is constrained: you can always move to the cell immediately to the right in the same row, and from a cell in the top row you may also drop vertically into the cell directly below it…
CF 105459B - Concave Hull
We are given a set of points in the plane, with the promise that no three lie on a straight line. From these points we may choose any subset and arrange the chosen points in some cyclic order to form a simple polygon.
CF 105459C - Giving Directions in Harbin
We are given a sequence of movement instructions on an infinite grid. Each instruction tells us to move in one of the four absolute directions, north, south, west, or east, and to go a certain number of intersections in that direction.
CF 105459M - Weird Ceiling
We are given a single integer $n$, and we conceptually evaluate a function $f(n, i)$ for every integer $i$ from 1 up to $n$. Each value of $f(n, i)$ is defined by a procedure that scans integers downward from $i$ to 2 and checks divisibility against $n$.
CF 105459I - A Brand New Geometric Problem
We start with a collection of positive integers that represent edge lengths of an $n$-dimensional hyper-rectangle. Two aggregate values matter: the sum of all edge lengths and the product of all edge lengths.
CF 105459E - Marble Race
There are $m$ marbles, each moving on the real line. Each marble first picks one of $n$ fixed starting positions on the negative side of the axis uniformly at random, independently of all others.
CF 105459A - Build a Computer
We are asked to construct a compact representation of all binary numbers in a given inclusive interval $[L, R]$. Instead of listing these numbers directly, we must build a directed acyclic graph with a single source and a single sink, where every valid path from source to sink…