2025 ICPC Wuhan Invitational Contest (The 3rd Universal Cup. Stage 37: Wuhan)
13 problems from 2025 ICPC Wuhan Invitational Contest (The 3rd Universal Cup. Stage 37: Wuhan) (contest 105901), difficulty -. 13/13 solutions verified against sample I/O.
2025 ICPC Wuhan Invitational Contest (The 3rd Universal Cup. Stage 37: Wuhan)
ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 13m 39s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Problem Setting | 57s | ✓ | |||
| B | Black Red Tree | 1m 21s | ✓ | |||
| C | One Must Imagine Sisyphus Happy | 1m 22s | ✓ | |||
| D | Odd and Even | 53s | ✓ | |||
| E | Colorful Graph | 1m 7s | ✓ | |||
| F | Knapsack | 55s | ✓ | |||
| G | Path Summing Problem | 55s | ✓ | |||
| H | WildFire, This Is for You! | 1m 9s | ✓ | |||
| I | Bingo 3 | 1m 20s | ✓ | |||
| J | Dictionary | 48s | ✓ | |||
| K | Las Vegas | 55s | ✓ | |||
| L | Subsequence | 1m 3s | ✓ | |||
| M | Flight Tracker | 54s | ✓ |
CF 105901J - Dictionary
We are given a fixed “dictionary string” S. Every possible word is simply a substring of S. Over q days, we are shown intervals on S. On day i, we take the substring S[li..ri] and consider it as a prefix pattern.
CF 105901I - Bingo 3
We are asked to fill an $n times n$ grid with all integers from $1$ to $n^2$, each used exactly once. So the grid is just a permutation reshaped into a matrix. Now define a property for a threshold value $x$.
CF 105901E - Colorful Graph
We are given an undirected graph with $n$ vertices and $m$ edges. Each edge must be assigned a color, using colors labeled from $1$ to $m$, and colors may be reused across edges.
CF 105901C - One Must Imagine Sisyphus Happy
We are simulating a worker walking back and forth along a line of n cells. In each round, he starts at cell 1, walks to cell n, then immediately returns to cell 1. Every time he steps on a cell, he inspects it and clears weeds if they are present.
CF 105901L - Subsequence
We are given several integer arrays, and for each one we want to build a subsequence with a very specific structural property. Take any chosen subsequence and sort it.
CF 105901K - Las Vegas
We are given several independent test cases. In each test case there are multiple casinos and several existing players. For every casino, each of the existing players has already committed a nonnegative number of dice.
CF 105901G - Path Summing Problem
We are given a grid where each cell contains an integer value, and we consider all monotone paths from the top-left corner to the bottom-right corner, where each move is either right or down.
CF 105901F - Knapsack
We are given several independent test cases. In each test case, there are multiple groups of identical items. Group i contains aᵢ items, and every item in that group has weight exactly 2^{bᵢ}. All items from all groups must be packed into m identical knapsacks.
CF 105901A - Problem Setting
We are given a list of numeric attributes, where each attribute starts with an initial value. Alongside this, there are several constraints.
CF 105901D - Odd and Even
We are given a very long integer sequence, but it is not provided explicitly. Instead, it is given in compressed form as runs of equal values. Each run says that a value v is repeated l times, and adjacent runs always have different values.
CF 105901M - Flight Tracker
Each test case describes a sphere centered at the origin with radius $r$. Three points lie on its surface: your house, the aircraft’s departure point, and its destination.
CF 105901H - WildFire, This Is for You!
We are asked to construct two very large positive integers, call them x and y, with a very specific geometric property. The only operation allowed on a pair of integers is to move in the grid by changing one coordinate by plus or minus one, and each such move costs one unit.
CF 105901B - Black Red Tree
A tree is given with $n$ nodes, and every edge starts out colored black. We then perform $n-1$ operations. In the $i$-th operation, a specific edge is recolored from black to red, so the set of black edges gradually shrinks until the tree has no black edges left.