2025 Wuhan University of Technology Programming Contest

13 problems from 2025 Wuhan University of Technology Programming Contest (contest 105986), difficulty -. 12/13 solutions verified against sample I/O.

13 items

2025 Wuhan University of Technology Programming Contest

Special | 13 problems | 12/13 verified | Difficulty - | 18m 8s

# Problem Rating Tags Accepted Time ✓
A \u81ea\u52a8\u88c5\u914d\u673a\u81ea\u52a8\u88c5\u914d\u81ea\u52a8\u673a 53s ✓
B \u6700\u77ed\u8def\u56fe 1m 32s ✓
C \u603b\u8f96\u4e4b\u613f 57s ✓
D \u604b\u604b\u7684\u5fc3\u8df3\u5927\u5192\u9669 \u2162 1m 31s ✓
E \u602f\u6218\u8725\u8734 VI 52s ✓
F Major 55s ✓
G \u795e\u5723\u6124\u6012 5m 19s
H \u6700\u5927\u8282\u70b9\u548c 1m 29s ✓
I \u561f\u5495\u565c\u4e4b\u738b 52s ✓
J \u83b2\u7684\u7b80\u5355\u9898 48s ✓
K Capoo's stack 1m ✓
L \u7b49\u4ef7\u4ea4\u6362 1m 2s ✓
M Maximize the total of maximum 58s ✓
Practice › Codeforces Solutions › 2025 Wuhan University of Technology Programming Contest ›

CF 105986L - 等价交换

We are given a system of items, where each item can eventually become “energized” if it is either directly chosen at the start or can be produced through recipes.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2025 Wuhan University of Technology Programming Contest ›

CF 105986K - Capoo's stack

We are given multiple independent test cases. In each test case there are several Capoo, each with a positive strength value. We want to choose some of them and arrange them into a vertical stack. The stack has a constraint that only the top Capoo is unrestricted.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2025 Wuhan University of Technology Programming Contest ›

CF 105986B - 最短路图

We are given a set of nodes where node 1 is the source of all distances, and we are also given a multiset of weighted edges whose endpoints are completely flexible.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2025 Wuhan University of Technology Programming Contest ›

CF 105986D - 恋恋的心跳大冒险 Ⅲ

The tree describes a rooted structure where every node carries an integer label, interpreted as a “gem energy level”. For any node $u$, if we choose $u$ as a starting point, we look at all nodes in its subtree and consider the multiset of their energy values.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2025 Wuhan University of Technology Programming Contest ›

CF 105986H - 最大节点和

We are given a perfect full binary tree of height $n$. This means the tree has $n$ levels, the root is at level $n$, each internal node has exactly two children, and all leaves are at level $1$. Every leaf is assigned either $0$ or $1$.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2025 Wuhan University of Technology Programming Contest ›

CF 105986M - Maximize the total of maximum

We are given a sequence and a constant threshold value. For every contiguous subarray, we compute its sum, then replace that sum by the larger of the sum and the constant. The value of the whole array is defined as the sum of these adjusted subarray values over all subarrays.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 2025 Wuhan University of Technology Programming Contest ›

CF 105986J - 莲的简单题

We are asked to construct an array a of length n, where each position i contains a positive integer not exceeding $10^9$.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 2025 Wuhan University of Technology Programming Contest ›

CF 105986I - 嘟咕噜之王

We are controlling a single creature whose “state” is an integer value from 0 up to n. We start at state 0 and want to eventually reach state n. There is a shop that sells helper creatures. Buying a helper of value i costs ai, and there is unlimited supply for every i.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 2025 Wuhan University of Technology Programming Contest ›

CF 105986F - Major

We are given a fully specified deterministic tournament between 16 teams. Every pair of teams has a fixed outcome encoded in the input: for any initial seed positions i and j, exactly one of them wins if they ever meet, and this result never changes.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 2025 Wuhan University of Technology Programming Contest ›

CF 105986E - 怯战蜥蜴 VI

We are given a tree with n nodes. Each node independently contains an enemy with probability pi, given as a fraction ai / bi modulo a large prime. For any choice of a target node x, the protagonist starts from some leaf node and walks along the unique simple path to x.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 2025 Wuhan University of Technology Programming Contest ›

CF 105986C - 总辖之愿

We are given a rectangular grid with dimensions $n times m$. On this grid, there are $k$ mineral fields. Each mineral field is defined by a center cell $(xi, yi)$ and a Chebyshev radius $disi$, meaning it occupies every grid cell whose row and column are both within $disi$ of…
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 2025 Wuhan University of Technology Programming Contest ›

CF 105986A - 自动装配机自动装配自动机

We are building a small team with a limited number of slots, and we want to maximize total attack power. There are two types of units. One type is a basic unit, which always contributes a fixed attack value $a$.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 2025 Wuhan University of Technology Programming Contest ›

CF 105986G - 神圣愤怒

Codeforces 105986G: 神圣愤怒
codeforces competitive-programming Jun 21, 2026