第十三届重庆市大学生程序设计竞赛

12 problems from 第十三届重庆市大学生程序设计竞赛 (contest 105887), difficulty -. 12/12 solutions verified against sample I/O.

12 items

第十三届重庆市大学生程序设计竞赛

Special | 12 problems | 12/12 verified | Difficulty - | 11m 36s

# Problem Rating Tags Accepted Time ✓
A \u9898\u76ee\u80cc\u666f\u662f GPT \u7ed9\u7684 58s ✓
B \u5217\u8f66 54s ✓
C \u533a\u57df\u5212\u5206 1m 23s ✓
D \u9ec4\u91d1\u66ff\u7f6a\u7f8a 52s ✓
E \u5f02\u6216\u95ee\u9898 55s ✓
F \u8d62\u9ebb\u4e86 50s ✓
G LCA \& MST 54s ✓
H \u8fde\u63a5 52s ✓
I \u7b54\u8fa9 1m 2s ✓
J RGB \u6811 49s ✓
K \u6d88\u6d88\u4e50 1m 16s ✓
L \u6808\u4e0e\u91cd\u590d 51s ✓
Practice › Codeforces Solutions › 第十三届重庆市大学生程序设计竞赛 ›

CF 105887G - LCA \& MST

We are given a rooted tree where node 1 is the root. Every node carries a numeric weight. From this tree we define a complete graph on the same nodes, but the edge weight between two nodes is not arbitrary: it is determined entirely by the weight of their lowest common…
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 第十三届重庆市大学生程序设计竞赛 ›

CF 105887E - 异或问题

We are trying to place a fixed-length window of consecutive integers on the number line. We choose a starting value a, forming the segment a, a+1, ..., a+l-1, with all values required to stay within [0, n].
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 第十三届重庆市大学生程序设计竞赛 ›

CF 105887L - 栈与重复

We maintain a stack that starts empty and evolves through a sequence of operations. Each operation either pushes a value onto the stack, pops the top element, or triggers a macro-like action that repeats all previously executed operations once more.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 第十三届重庆市大学生程序设计竞赛 ›

CF 105887I - 答辩

We are given several independent test cases. In each test case there are n students, each belonging to exactly one of m disjoint groups. A directed question network must be constructed between students.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 第十三届重庆市大学生程序设计竞赛 ›

CF 105887D - 黄金替罪羊

We are given a sequence of moves of length $2n$, where each character instructs a step on a number line: left moves decrease position by 1 and right moves increase it by 1. Some positions in the sequence are fixed as L or R, while others are unknown and must be filled.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 第十三届重庆市大学生程序设计竞赛 ›

CF 105887K - 消消乐

We start with an $n times n$ grid where every cell initially contains the value 1. Two arrays $a1 dots an$ and $b1 dots bn$ control a random process that repeatedly deletes either a row or a column until all rows and columns are gone.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 第十三届重庆市大学生程序设计竞赛 ›

CF 105887J - RGB 树

We are given a tree where every node initially carries one of three colors: red, green, or blue. We are allowed to recolor any subset of nodes into white, and white nodes are treated as “removed” in the sense that they no longer participate as red, green, or blue.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 第十三届重庆市大学生程序设计竞赛 ›

CF 105887H - 连接

We are given two rows of balls placed along the boundary of a rectangle. The bottom row contains a fixed permutation of numbers from 1 to n.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 第十三届重庆市大学生程序设计竞赛 ›

CF 105887F - 赢麻了

Each test describes a simple comparison game between three values: Alice’s strength a, Bob’s strength b, and Candy’s strength c. The output is a string chosen by applying a priority rule over these comparisons. The decision process is sequential.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 第十三届重庆市大学生程序设计竞赛 ›

CF 105887C - 区域划分

We are given an $n times n$ grid of unit cells. The task is to assign each cell one label from $1$ to $n$, forming exactly $n$ regions, where a region is simply the set of cells with the same label. Regions do not need to be connected.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 第十三届重庆市大学生程序设计竞赛 ›

CF 105887A - 题目背景是 GPT 给的

We are given a circular array of length $n$, where each position holds an integer value representing some bitmask. The array evolves in discrete rounds.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 第十三届重庆市大学生程序设计竞赛 ›

CF 105887B - 列车

We are given a railway line with stations numbered from 1 to n. There are m trains. Each train starts at a fixed station li, ends at ri, and has a capacity ci.
codeforces competitive-programming Jun 21, 2026