GDUT 2025 Monthly competition

14 problems from GDUT 2025 Monthly competition (contest 106130), difficulty -. 13/14 solutions verified against sample I/O.

14 items

GDUT 2025 Monthly competition

Special | 14 problems | 13/14 verified | Difficulty - | 15m 27s

#	Problem	Time	✓
A	\%\%\%\u81ea\u52a8\u673a	40s	✓
B	k-\u51b2\u7a81\u6570\u5bf9	4m 6s
C	\u5e8f\u5217\u91cd\u6784\uff08\u7b80\u5355\u7248\uff09	44s	✓
D	\u5e8f\u5217\u91cd\u6784\uff08\u56f0\u96be\u7248\uff09	54s	✓
E	\u65b0\u7530\u5fcc\u8d5b\u9a6c	44s	✓
F	\u96ea\u8389\u7684\u9884\u8a00	47s	✓
G	\u4fc4\u7f57\u65af\u65b9\u5757\u7684\u535a\u5f08	1m 12s	✓
H	\u6211\u4e0d\u5403\u6c34\u679c	53s	✓
I	\u8fd0\u52a8\u4e16\u754c\u6821\u56ed	53s	✓
J	\u9003\u51fa\u751f\u5929	57s	✓
K	\u6700\u4e0d\u4e0a\u5347\u4e5f\u4e0d\u4e0b\u964d\u5e8f\u5217	38s	✓
L	\u7ffb\u8f6c\u786c\u5e01	48s	✓
M	\u5b57\u7b26\u6d88\u6d88\u4e50	1m 6s	✓
N	\u7f29\u82b1	1m 5s	✓

Practice › Codeforces Solutions › GDUT 2025 Monthly competition ›

CF 106130F - 雪莉的预言

We are maintaining a dynamic multiset of votes over m participants, each participant identified by an index from 0 to m - 1. Every vote increments the count of one participant, and a removal operation decrements it if that participant currently has at least one vote.

Practice › Codeforces Solutions › GDUT 2025 Monthly competition ›

CF 106130A - \%\%\%自动机

The task reduces to constructing a single string based on an input integer. We are given a number $n$, and we must output a line consisting of exactly $n$ identical characters, where each character is the percent symbol %.

Practice › Codeforces Solutions › GDUT 2025 Monthly competition ›

CF 106130I - 运动世界校园

We are given a single probability value p, describing the success rate of one independent attempt to obtain a required result. A student has exactly three independent attempts. Each attempt either succeeds with probability p or fails with probability 1 - p.

Practice › Codeforces Solutions › GDUT 2025 Monthly competition ›

CF 106130K - 最不上升也不下降序列

We are asked to construct a permutation of the numbers from 1 to n. From this permutation we look at two classical subsequence measures: the length of the longest strictly increasing subsequence and the length of the longest strictly decreasing subsequence.

Practice › Codeforces Solutions › GDUT 2025 Monthly competition ›

CF 106130D - 序列重构（困难版）

We are interacting with a hidden permutation of length $n$, and our only way to learn about it is to submit test permutations of the same length. Each query gives a score equal to how many positions match the hidden permutation exactly.

Practice › Codeforces Solutions › GDUT 2025 Monthly competition ›

CF 106130N - 缩花

We are given a tree, and we are allowed to repeatedly perform a very specific restructuring operation. Each operation first picks a node as the temporary root, which defines parent and child relationships for that step. Then we choose a non-root node $u$.

Practice › Codeforces Solutions › GDUT 2025 Monthly competition ›

CF 106130M - 字符消消乐

We are given a lowercase string. Before the game starts, we may rearrange its characters in any order we like. A single elimination operation chooses a contiguous block consisting of the same character, and that block must have length at least 3.

Practice › Codeforces Solutions › GDUT 2025 Monthly competition ›

CF 106130L - 翻转硬币

We are given a binary string representing a row of coins. Each position is either 0 or 1, and the goal is to transform the entire string into all 1s. The only allowed operation is choosing two adjacent positions and flipping both coins simultaneously.

Practice › Codeforces Solutions › GDUT 2025 Monthly competition ›

CF 106130B - k-冲突数对

Thinking

Practice › Codeforces Solutions › GDUT 2025 Monthly competition ›

CF 106130J - 逃出生天

We are given a grid with $n+2$ rows and $m$ columns. The top row and the bottom row are safe, while the $n$ middle rows each contain exactly one stone statue. Each statue sits at a specific column in its row and faces either left or right.

Practice › Codeforces Solutions › GDUT 2025 Monthly competition ›

CF 106130G - 俄罗斯方块的博弈

We are playing a turn-based placement game on a fixed 4 by 4 board, so there are only 16 cells in total. Two kinds of tetromino pieces are available: T-shaped pieces and L-shaped pieces. We are given a limited supply, at most three of each type.

Practice › Codeforces Solutions › GDUT 2025 Monthly competition ›

CF 106130H - 我不吃水果

We have an $n times n$ cake represented as a grid. A cell contains either no fruit (0) or a fruit (1). The piece that Xiao Z cuts must come from the top-left corner of the cake.

Practice › Codeforces Solutions › GDUT 2025 Monthly competition ›

CF 106130E - 新田忌赛马

We are given two descendingly sorted arrays of horse speeds. One belongs to Tian Ji and the other to the King. A match is formed by pairing one unused horse from each side, and the outcome depends on a strict comparison: Tian Ji earns money only when his chosen horse is…

Practice › Codeforces Solutions › GDUT 2025 Monthly competition ›

CF 106130C - 序列重构（简单版）

We are interacting with a hidden permutation of size $n$. The permutation is fixed before any queries, and each query allows us to submit any length-$n$ array. The system responds with how many positions match exactly between our submitted array and the hidden permutation.