2024 ICPC National Invitational Collegiate Programming Contest, Wuhan Site
13 problems from 2024 ICPC National Invitational Collegiate Programming Contest, Wuhan Site (contest 105143), difficulty -. 13/13 solutions verified against sample I/O.
2024 ICPC National Invitational Collegiate Programming Contest, Wuhan Site
ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 13m 26s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Shaking Trees | 1m 23s | ✓ | |||
| B | Countless Me | 1m 6s | ✓ | |||
| C | TreeBag and LIS | 55s | ✓ | |||
| D | ICPC | 1m 16s | ✓ | |||
| E | Boomerang | 1m 25s | ✓ | |||
| F | Custom-Made Clothes | 45s | ✓ | |||
| G | Pack | 1m | ✓ | |||
| H | Wings of Crystals | 57s | ✓ | |||
| I | Cyclic Apple Strings | 1m 2s | ✓ | |||
| J | Gensokyo Autobahn | 57s | ✓ | |||
| K | Party Games | 48s | ✓ | |||
| L | Magic Fairies | 1m 2s | ✓ | |||
| M | Merge | 50s | ✓ |
CF 105143H - Wings of Crystals
We are given a tree with n vertices, each vertex carrying a non-negative weight. We need to split the vertices into disjoint groups, where each group must form a simple path in the tree, and no vertex can belong to more than one group.
CF 105143M - Merge
We are given a multiset of positive integer weights representing soldiers. The only operation allowed is to take two soldiers whose strengths differ by exactly one and replace them with a single soldier whose strength is their sum.
CF 105143K - Party Games
We are given a sequence of integers from 1 to n placed in a row. Two players alternate moves, starting with the first player.
CF 105143J - Gensokyo Autobahn
We are given a directed graph with $n$ nodes and $m$ unit-length edges. We also have $k$ independent construction teams.
CF 105143L - Magic Fairies
We are given a row of vertical pillars of width 1, each with a distinct height. At both ends of the row there are imaginary pillars of infinite height, which act like absolute walls. For each query, water is dropped from infinitely high above a chosen pillar.
CF 105143I - Cyclic Apple Strings
We are given a binary string and allowed to repeatedly perform a very flexible operation: pick any contiguous segment and rotate it cyclically.
CF 105143G - Pack
We are given two types of items. There are n items of type A, each contributing value a, and m items of type B, each contributing value b. We want to repeatedly assemble identical “products”.
CF 105143F - Custom-Made Clothes
We are given a hidden $n times n$ grid filled with positive integers in the range $[1, n^2]$. The grid is not arbitrary: values are monotone in both directions, meaning they never decrease as we move right or down.
CF 105143E - Boomerang
We are given a tree where a “fake message” starts at a fixed node $r$ and spreads outward one edge per unit time. At time $t$, every node within distance at most $t$ from $r$ has received it, so the infected set is exactly a metric ball centered at $r$.
CF 105143D - ICPC
We are standing on a line of seats, each seat holding a non-negative value. From a chosen starting seat, we may move left, right, or stay in place once per second. Whenever we land on a seat for the first time, we collect its value. Re-visiting a seat later gives nothing new.
CF 105143A - Shaking Trees
We are given a rooted tree with node 1 as the root. Each move lets us pick a node $u$, detach it from its parent, and then perform a “leaf pruning” process inside the component rooted at $u$.
CF 105143B - Countless Me
We are given an array of non-negative integers and a very flexible operation that allows us to move any amount of value from one position to another, as long as no element becomes negative.
CF 105143C - TreeBag and LIS
We are asked to construct a string of decimal digits whose length does not exceed one hundred thousand, but the string is not arbitrary. The requirement is tied to all longest strictly increasing subsequences of that string.