The 22nd UESTC Programming Contest - Final

11 problems from The 22nd UESTC Programming Contest - Final (contest 105182), difficulty -. 11/11 solutions verified against sample I/O.

11 items

The 22nd UESTC Programming Contest - Final

Special | 11 problems | 11/11 verified | Difficulty - | 9m 7s

# Problem Rating Tags Accepted Time ✓
A Hanoi Sort 47s ✓
B Card Game 1m 2s ✓
C Add 55s ✓
D Black and White Bead String 42s ✓
E Maximal Substring Flipping 47s ✓
F One Stop to the End 48s ✓
G Typing 40s ✓
H Juice 40s ✓
I Number Game 1m 3s ✓
J 2-Clustering Algorithm 44s ✓
K Sequence Operation 59s ✓
Practice › Codeforces Solutions › The 22nd UESTC Programming Contest - Final ›

CF 105182B - Card Game

We are given a finite collection of card types. Each type is determined by a pair of attributes, a color and a number, both ranging from 1 to n, so there are n² types in total.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd UESTC Programming Contest - Final ›

CF 105182D - Black and White Bead String

We are asked to construct a binary string consisting of zeros and ones, representing white and black beads on a chain. Along with this string, we are given several constraints.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd UESTC Programming Contest - Final ›

CF 105182H - Juice

We are simulating a process where juice is continuously produced over time, and people arrive at specific minutes to take the best available cup that has been prepared so far.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd UESTC Programming Contest - Final ›

CF 105182G - Typing

We are given a rooted trie, where each node corresponds to a string formed by concatenating characters along the path from the root to that node. Each node also carries a demand value, meaning that the string represented by that node must be written a certain number of times.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd UESTC Programming Contest - Final ›

CF 105182C - Add

We start with an array whose i-th position initially contains i. Then we perform a sequence of n − 1 randomized updates.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd UESTC Programming Contest - Final ›

CF 105182K - Sequence Operation

We are given a sequence of integers, and we are allowed to repeatedly apply a very specific kind of operation: pick exactly k positions in the array and multiply all chosen elements by the same nonzero integer. This operation can be repeated any number of times.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd UESTC Programming Contest - Final ›

CF 105182J - 2-Clustering Algorithm

We are given an even number of points in a k-dimensional integer space, exactly 2n points in total. Each point contributes a coordinate vector, and the distance between any two points is Manhattan distance across all k dimensions.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd UESTC Programming Contest - Final ›

CF 105182I - Number Game

We are given a multiset of positive integers representing weights placed in a sequence. Two players alternate turns, and on each turn they either compress the sequence by merging two chosen elements into their sum, or they immediately end the game by selecting one element.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd UESTC Programming Contest - Final ›

CF 105182F - One Stop to the End

We are given a sequence of questions arranged in a rooted structure where every question except the first has exactly one prerequisite, and that prerequisite always has a smaller index.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd UESTC Programming Contest - Final ›

CF 105182E - Maximal Substring Flipping

We are given a binary string, and we repeatedly apply a transformation on it. One operation picks a contiguous block that is as large as possible under the constraint that all characters in the block are identical, and that the block length is greater than 1.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd UESTC Programming Contest - Final ›

CF 105182A - Hanoi Sort

We start with a single stack of distinct disks placed on pillar A. The disks are ordered from bottom to top, and every disk has a unique size, forming a permutation of 1 through n. Two empty pillars B and C are available.
codeforces competitive-programming Jun 27, 2026