2025 Sun Yat-sen University Collegiate Programming Contest, Final
13 problems from 2025 Sun Yat-sen University Collegiate Programming Contest, Final (contest 106114), difficulty -. 11/13 solutions verified against sample I/O.
2025 Sun Yat-sen University Collegiate Programming Contest, Final
Special | 13 problems | 11/13 verified | Difficulty - | 10m 18s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Abacus | 48s | ✓ | |||
| B | Network | 48s | ✓ | |||
| C | Arc Path | 28s | ||||
| D | Perfect Life | 59s | ✓ | |||
| E | Ecosystem | 1m 6s | ✓ | |||
| F | SYSU II | 41s | ✓ | |||
| G | Gray Transform (Weakened) | 50s | ✓ | |||
| H | SYSU III | 50s | ✓ | |||
| I | Sum | 51s | ✓ | |||
| J | Palindrome | 51s | ✓ | |||
| K | Divisor Transformation | 27s | ||||
| L | Larger or Smaller | 49s | ✓ | |||
| M | Road2 | 50s | ✓ |
CF 106114G - Gray Transform (Weakened)
We start with an array of size $2^n$ where each position initially stores its own index, so position $i$ holds value $i$. The index $i$ is also interpreted as an $n$-bit binary number. The only non-query operations repeatedly apply a transformation based on Gray code blocks.
CF 106114C - Arc Path
I don’t have the actual statement for Codeforces 106114C - Arc Path in the prompt, and without it I’d be forced to guess the structure of the problem.
CF 106114K - Divisor Transformation
I can’t write a correct Codeforces-style editorial for this yet because the actual problem content is missing. Right now I only have the title “Divisor Transformation”, but no definition of what a transformation is, what the input/output mean, or what constraints apply.
CF 106114B - Network
The task describes a transmission pipeline that behaves like a layered flow system. A message is split into multiple consecutive chunks, and each chunk must pass through a chain of routers.
CF 106114F - SYSU II
We are given a string and we want to count how many of its substrings are “good” under a very specific structural requirement.
CF 106114M - Road2
We are given an undirected weighted graph with up to 50,000 vertices and 200,000 edges. Each edge has a weight, and the key operation we care about is not shortest paths in the usual sense, but the bottleneck value along a path.
CF 106114J - Palindrome
We are given a string and we are interested in its contiguous substrings. A substring is called valid if it avoids a very strong structural restriction: inside it, there must not exist any nontrivial contiguous palindrome of length at least two.
CF 106114I - Sum
We are given a number $n$ and a bound $R$. For every base $k$ from 2 up to $R$, we write $n$ in base $k$, then compute the sum of its digits. Among all these bases, we want the minimum possible digit sum.
CF 106114E - Ecosystem
We are given a small set of item types, each type having a fixed “weight” or “cost”. We also have several queries, and each query asks the same question: in how many ways can we build a total sum exactly equal to a given value if we are allowed to use these item types…
CF 106114L - Larger or Smaller
We are working with permutations of the numbers from 1 to n. For any such permutation, we look at each position i and compare the value pi with its index i. Some positions satisfy pi < i, some satisfy pi i, and the remaining satisfy pi = i.
CF 106114H - SYSU III
We are given a string over the alphabet {s, y, s, u} and we are interested in extracting as many disjoint subsequences equal to the pattern sysu as possible.
CF 106114D - Perfect Life
We are given a string $S$ and a pattern string $T$. The operation allowed is to choose any substring of $S$ whose length equals $ A key way to reinterpret this is that we are not directly editing characters one by one.
CF 106114A - Abacus
We are given a rectangular arrangement of cells with n rows and m columns. Each row i initially contains a block of ai stones packed on the left side, so in row i, columns 1 through ai are filled, and the remaining cells are empty.