2023 Jiangsu Collegiate Programming Contest, 2023 National Invitational of CCPC (Hunan), The 13th Xiangtan Collegiate Programming Contest
12 problems from 2023 Jiangsu Collegiate Programming Contest, 2023 National Invitational of CCPC (Hunan), The 13th Xiangtan Collegiate Programming Contest (contest 104396), difficulty -. 10/12 solutions verified against sample I/O.
2023 Jiangsu Collegiate Programming Contest, 2023 National Invitational of CCPC (Hunan), The 13th Xiangtan Collegiate Programming Contest
Special | 12 problems | 10/12 verified | Difficulty - | 12m 3s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Today's Word | 43s | ||||
| B | Honkai in TAIKULA | 1m 4s | ✓ | |||
| C | GG and YY's Game | 1m 12s | ✓ | |||
| D | Star Rail | 59s | ✓ | |||
| E | LCM Plus GCD | 54s | ✓ | |||
| F | Timaeus | 40s | ||||
| G | Moving Boxes | 55s | ✓ | |||
| H | Neil's Machine | 40s | ✓ | |||
| I | Elevator | 54s | ✓ | |||
| J | Similarity (Easy Version) | 40s | ✓ | |||
| K | Similarity (Hard Version) | 2m 2s | ✓ | |||
| L | Architect | 1m 20s | ✓ |
CF 104396K - Similarity (Hard Version)
We are given a directed graph on $n$ nodes where each node is supposed to end up with exactly one outgoing edge and exactly one incoming edge, so the final structure is a functional graph, which is equivalent to a permutation on $n$ nodes. Some edges are already fixed.
CF 104396G - Moving Boxes
We are given a set of box transfers on a number line. Each box starts at a position $xi$ and must end at a position $yi$, and all starting and ending positions are globally distinct within their respective sets.
CF 104396F - Timaeus
I don't have enough information to write a correct editorial. The problem statement describes the actions and probabilities, but it is missing the crucial detail that determines the dynamic programming state: What exactly happens after each synthesis?
CF 104396C - GG and YY's Game
We are given several independent chains, where each chain is simply a path graph with a specified length. Two players take turns removing nodes from these chains.
CF 104396D - Star Rail
We are given a set of points in the plane. Each point represents a star. For every star $i$, we imagine standing at that star and drawing a straight line that passes through it. This line is required not to pass through any other star.
CF 104396A - Today's Word
I don't have enough information to write a correct editorial and solution for this problem because the problem statement as provided is corrupted. The recurrence defining $Sn$ contains broken indices: This expression is mathematically impossible.
CF 104396L - Architect
We are given a large axis-aligned cuboid that spans from the origin to a fixed point $(W, H, L)$. Inside this container, someone has placed several smaller axis-aligned cuboids.
CF 104396J - Similarity (Easy Version)
We are given several sets of place names, and for each set we want to compare every pair of names. The comparison between two names is defined by how long their longest shared contiguous block of characters is.
CF 104396I - Elevator
There are n people inside an elevator, including yourself. Every person has selected a destination floor. Among all selected destinations, exactly m distinct floors appear.
CF 104396H - Neil's Machine
We are given two strings of equal length. Think of them as two versions of a sequence of characters, where the first string is the starting configuration and the second string is the target configuration.
CF 104396E - LCM Plus GCD
We are asked to count how many ways we can choose a set of exactly k distinct positive integers such that two aggregate values computed from the set satisfy a simple linear condition: the sum of the set’s LCM and GCD equals a given number x.
CF 104396B - Honkai in TAIKULA
We are given a directed graph where each star is a node and each star rail is a directed edge with an integer cost, which may be negative.