“华为杯” 2024 年广东工业大学 ACM 新生程序设计竞赛（决赛）

14 problems from “华为杯” 2024 年广东工业大学 ACM 新生程序设计竞赛（决赛） (contest 105586), difficulty -. 14/14 solutions verified against sample I/O.

14 items

“华为杯” 2024 年广东工业大学 ACM 新生程序设计竞赛（决赛）

Special | 14 problems | 14/14 verified | Difficulty - | 13m 49s

# Problem Rating Tags Accepted Time ✓
A \u6f14\u594f\u6625\u65e5\u5f71 49s ✓
B \u8d85\u5e73\u5766\u68cb\u76d8 52s ✓
C \u4ea4\u901a\u8981\u585e 1m 6s ✓
D \u9b54\u6cd5\u5c11\u5973\u7d20\u4e16\u4e16 1m 11s ✓
E \u9ed1\u5854\u7684\u5947\u7269 53s ✓
F \u5b57\u7b26\u4e32\u7f29\u5199\u592a\u591a\u4e86\uff01 46s ✓
G \u53ef\u4e50\u559d\u96ea\u78a7 1m 20s ✓
H \u96ea\u78a7\u559d\u53ef\u4e50 1m ✓
I \u5c0f P \u7231\u6298\u8dc3 52s ✓
J \u597d\u5f97\u4e0d\u80fd\u518d\u597d\u4e86\uff01\u6cf0\u62c9\u6295\u8d44\u5927\u5e08\u8bfe 55s ✓
K \u8bf4\u91cd\u8bdd\uff01\uff01\uff01 1m 1s ✓
L \u5411\u65e5\u8475\u7684\u5761\u9053 1m 19s ✓
M GLLF \u780d\u6728\u68cd 1m 6s ✓
N \u54e5\u4f26\u6bd4\u4e9a\u5927\u9009 39s ✓
Practice › Codeforces Solutions › “华为杯” 2024 年广东工业大学 ACM 新生程序设计竞赛（决赛） ›

CF 105586H - 雪碧喝可乐

We are given a sequence of values over time, each value being either minus one, zero, or plus one. Each value represents the intrinsic “effect” of a bottle bought on that day.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › “华为杯” 2024 年广东工业大学 ACM 新生程序设计竞赛（决赛） ›

CF 105586K - 说重话！！！

We are given a sequence of days, and on each day we want to compute how many “extra hours of effort” accumulate from a set of scheduled contributions. Each contribution starts at some day $x$ and then affects all days from $x$ to the end $n$.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › “华为杯” 2024 年广东工业大学 ACM 新生程序设计竞赛（决赛） ›

CF 105586C - 交通要塞

We are moving along a straight corridor divided into vertical “lanes” indexed from 0 to n + 1. Time is discrete. At each second, you either stay in your current lane or move exactly one lane to the right.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › “华为杯” 2024 年广东工业大学 ACM 新生程序设计竞赛（决赛） ›

CF 105586E - 黑塔的奇物

We are asked to arrange $n^2$ items on an $n times n$ grid. Each item has a type from $1$ to $n$, and each type appears exactly $n$ times, so the multiset is perfectly uniform.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › “华为杯” 2024 年广东工业大学 ACM 新生程序设计竞赛（决赛） ›

CF 105586L - 向日葵的坡道

We are given a directed bipartite graph whose vertices are split into two equal parts. The left part contains nodes numbered from 1 to n, and the right part contains nodes numbered from n + 1 to 2n. Every existing edge goes strictly from a left node to a right node.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › “华为杯” 2024 年广东工业大学 ACM 新生程序设计竞赛（决赛） ›

CF 105586N - 哥伦比亚大选

We are given a small list of candidates in a presidential election, where each candidate has a name and a number representing how many supporters they have. The task is to determine which candidate has the largest number of supporters and output that candidate’s name.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › “华为杯” 2024 年广东工业大学 ACM 新生程序设计竞赛（决赛） ›

CF 105586G - 可乐喝雪碧

We are given a sequence of numbers, each being −1, 0, or 1. Between every pair of adjacent elements, we are allowed to place either a plus or a multiplication sign, and we are also free to use parentheses implicitly by choosing the evaluation order in the usual way…
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › “华为杯” 2024 年广东工业大学 ACM 新生程序设计竞赛（决赛） ›

CF 105586I - 小 P 爱折跃

We are given a directed structure hidden inside an array. Each city has exactly one outgoing teleport, and every teleport belongs to exactly one city.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › “华为杯” 2024 年广东工业大学 ACM 新生程序设计竞赛（决赛） ›

CF 105586D - 魔法少女素世世

We are given a directed acyclic graph where each node represents a room containing a monster with a fixed power value. The graph has a special structure: every room can eventually reach the final room numbered $n$, and there are no directed cycles.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › “华为杯” 2024 年广东工业大学 ACM 新生程序设计竞赛（决赛） ›

CF 105586A - 演奏春日影

We are given a short playlist of songs represented as strings. Each string is a single program item in an original concert schedule. The task simulates a simple rule applied while reading this schedule from top to bottom.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › “华为杯” 2024 年广东工业大学 ACM 新生程序设计竞赛（决赛） ›

CF 105586M - GLLF 砍木棍

We are given a positive integer $n$, interpreted as the length of a wooden stick. We cut it into a sequence of positive integer-length pieces, and we care about the order of these pieces, because two different cutting positions produce different sequences even if they contain…
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › “华为杯” 2024 年广东工业大学 ACM 新生程序设计竞赛（决赛） ›

CF 105586J - 好得不能再好了！泰拉投资大师课

We are given a repeated experiment where each trial independently results in a win with probability $frac{p}{q}$ and a loss with probability $1 - frac{p}{q}$. We start from zero wins and zero losses, and we keep playing until one of two stopping conditions is reached.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › “华为杯” 2024 年广东工业大学 ACM 新生程序设计竞赛（决赛） ›

CF 105586F - 字符串缩写太多了！

We are given a collection of distinct lowercase strings. From these strings, we can choose any non-empty subset and arrange the chosen strings in any order.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › “华为杯” 2024 年广东工业大学 ACM 新生程序设计竞赛（决赛） ›

CF 105586B - 超平坦棋盘

We are working on an infinite chessboard where every integer coordinate initially contains a knight. At some moment, a single special event happens: the knight at position $(0, 0)$ becomes a “super knight”, and the cell at $(n, m)$ becomes empty because its knight is removed.
codeforces competitive-programming Jun 22, 2026