The 19th Southeast University Programming Contest (Summer)

12 problems from The 19th Southeast University Programming Contest (Summer) (contest 105013), difficulty -. 10/12 solutions verified against sample I/O.

12 items

The 19th Southeast University Programming Contest (Summer)

Special | 12 problems | 10/12 verified | Difficulty - | 15m 15s

# Problem Rating Tags Accepted Time ✓
A \u7834\u6653\u72c2\u60f3\u66f2 51s ✓
B Infinite Binary String 1m 6s ✓
C \u732b\u72d7\u5927\u6218 46s ✓
D It's not Ashamed to Feel Sad 1m 2s ✓
E \u5f31\u8005\u90fd\u662f\u7fa4\u5c45\u8005 36s
F Bracket Distance 53s ✓
G Dingding and His Favorite Finite Binary String 53s ✓
H \u77f3\u5934\u526a\u5200\u5e03 48s ✓
I YiYi and Her Unsorted Array 1m 4s ✓
J \u5c0fQ\u7684\u673a\u5668 5m 24s
K Going to Find Your Love 48s ✓
L \u806a\u660e\u7684\u5c0f\u9ad8 1m 4s ✓
Practice › Codeforces Solutions › The 19th Southeast University Programming Contest (Summer) ›

CF 105013J - 小Q的机器

Codeforces 105013J: 小Q的机器
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 19th Southeast University Programming Contest (Summer) ›

CF 105013F - Bracket Distance

We are given a binary string consisting only of opening and closing brackets. On this string, we must process a sequence of point updates where a single character is changed, and after each update we must compute a value derived from the current configuration of brackets.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 19th Southeast University Programming Contest (Summer) ›

CF 105013E - 弱者都是群居者

I can’t produce a correct or meaningful editorial from what you’ve provided, because the actual problem statement is missing.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 19th Southeast University Programming Contest (Summer) ›

CF 105013G - Dingding and His Favorite Finite Binary String

The input describes a binary string that is processed in fixed-size chunks of length k. You can think of splitting the string into consecutive blocks, each block being treated independently first, and then interacting with its neighbors later.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 19th Southeast University Programming Contest (Summer) ›

CF 105013D - It's not Ashamed to Feel Sad

We are given a tree with n nodes, where each node carries a lowercase letter. Every node also has an implicit depth from the root. After building the tree, we receive q queries.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 19th Southeast University Programming Contest (Summer) ›

CF 105013L - 聪明的小高

There are four players, and each player holds exactly two cards. Each card has a rank and a suit. In every game, each player ultimately plays exactly one of their two cards in the first round, and the remaining cards form the second round. The play proceeds in two tricks.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 19th Southeast University Programming Contest (Summer) ›

CF 105013K - Going to Find Your Love

The task can be understood as a shortest path problem on a directed weighted graph, but with an extra layer of state tracking. Each node in the graph can be visited multiple times depending on how many special “bad” nodes have been passed so far.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 19th Southeast University Programming Contest (Summer) ›

CF 105013I - YiYi and Her Unsorted Array

We are given an array where some positions are “locked” in the sense that elements at those indices are fixed barriers. These locked indices split the array into consecutive regions.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 19th Southeast University Programming Contest (Summer) ›

CF 105013H - 石头剪刀布

We are given two players, each of whom distributes a fixed number of Rock, Paper, and Scissors tokens. One player has counts for Rock, Paper, and Scissors, and the other player has their own counts of the same three types.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 19th Southeast University Programming Contest (Summer) ›

CF 105013B - Infinite Binary String

We are maintaining an infinite binary string indexed by positive integers. Initially, every position behaves as if it contains a zero, and then we are allowed to repeatedly overwrite segments of this infinite string.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 19th Southeast University Programming Contest (Summer) ›

CF 105013A - 破晓狂想曲

We are given multiple queries, each query provides two positive integers, which we can think of as the dimensions of a rectangle grid or two independent ranges.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 19th Southeast University Programming Contest (Summer) ›

CF 105013C - 猫狗大战

We are given a number of test cases. For each test case, we receive a string of length $n$. The task is to transform the string in a very specific way and decide which of three fixed outputs it matches after processing. The processing rule is simple but strict.
codeforces competitive-programming Jun 28, 2026