“规律未来杯”2026 年广东工业大学 ACM 程序设计竞赛

13 problems from “规律未来杯”2026 年广东工业大学 ACM 程序设计竞赛 (contest 106440), difficulty -. 13/13 solutions verified against sample I/O.

13 items

“规律未来杯”2026 年广东工业大学 ACM 程序设计竞赛

Special | 13 problems | 13/13 verified | Difficulty - | 13m 37s

#	Problem	Time	✓
A	\u9b54\u6cd5\u77f3\u6cd5\u9635	1m	✓
B	\u51f8\u5305	59s	✓
C	\u6d88\u5931\u7684\u5143\u7d20	1m 22s	✓
D	\u6536\u7eb3\u6536\u7eb3\u888b	1m 5s	✓
E	\u5468\u957f	53s	✓
F	\u77ad\u671b\u5854	53s	✓
G	fufu \u8d2d\u4e70\u8ba1\u5212	1m 15s	✓
H	\u6b7b\u4ea1\u53d8\u901f	54s	✓
I	\u51f9\u5305	1m 14s	✓
J	\u6700\u8fdc\u7684\u5f7c\u6b64	1m 21s	✓
K	\u5171\u4eab\u5355\u8f66	50s	✓
L	PPIIIGG	49s	✓
M	\u5fae\u8f6f\u5927\u6218\u4ee3\u7801	1m 2s	✓

Practice › Codeforces Solutions › “规律未来杯”2026 年广东工业大学 ACM 程序设计竞赛 ›

CF 106440B - 凸包

We are given a set of distinct points in the plane. The task is to split these points into two non-empty groups, call them A and B, such that the convex hull formed by A and the convex hull formed by B do not touch at all, neither in their interiors nor on their boundaries.

Practice › Codeforces Solutions › “规律未来杯”2026 年广东工业大学 ACM 程序设计竞赛 ›

CF 106440L - PPIIIGG

We are given a string made only of the characters P, I, and G. For each test case, we must count how many subsequences of this string form a very specific structured pattern.

Practice › Codeforces Solutions › “规律未来杯”2026 年广东工业大学 ACM 程序设计竞赛 ›

CF 106440G - fufu 购买计划

We are given a set of coins with values from 1 to n, each value appearing exactly once, so we are really choosing a subset of the integers 1 through n. The goal is to pick a subset whose total sum is exactly m. However, selection is restricted by additional prefix rules.

Practice › Codeforces Solutions › “规律未来杯”2026 年广东工业大学 ACM 程序设计竞赛 ›

CF 106440I - 凹包

We are given a set of points in the plane, where one of the points is fixed at the origin $O = (0,0)$. From these points we may select some subset and connect them in some cyclic order to form a simple polygon, meaning a non self-intersecting closed chain.

Practice › Codeforces Solutions › “规律未来杯”2026 年广东工业大学 ACM 程序设计竞赛 ›

CF 106440M - 微软大战代码

We are given a rooted version tree. Version 1 is the root. Every other version has exactly one parent among earlier versions, and the edge from parent to child carries a character. That character sequence along a root-to-node path defines the “signature string” of a version.

Practice › Codeforces Solutions › “规律未来杯”2026 年广东工业大学 ACM 程序设计竞赛 ›

CF 106440C - 消失的元素

We are given a large universe of integers from 1 to $n+m$, and a hidden set $S$ of size $n$. All elements in $S$ are distinct. Alice can see the full set $S$, but she is only allowed to communicate a slightly smaller set $S'$ obtained by removing exactly one element from $S$.

Practice › Codeforces Solutions › “规律未来杯”2026 年广东工业大学 ACM 程序设计竞赛 ›

CF 106440K - 共享单车

We are simulating a commuter who travels over a sequence of days, where each day requires access to a bike from one or both of two providers.

Practice › Codeforces Solutions › “规律未来杯”2026 年广东工业大学 ACM 程序设计竞赛 ›

CF 106440E - 周长

We are given a weighted grid. Each cell has a positive value, and we want to select a simple closed shape drawn along grid edges. The shape must not self-intersect and must form a single closed loop. The region enclosed by this loop is a connected set of unit cells.

Practice › Codeforces Solutions › “规律未来杯”2026 年广东工业大学 ACM 程序设计竞赛 ›

CF 106440H - 死亡变速

The problem describes a timeline where a rhythm chart switches tempo over time. The chart is measured in beats, while real execution time is measured in seconds. The conversion between these two depends on the current BPM, and the BPM changes at specific beat positions.

Practice › Codeforces Solutions › “规律未来杯”2026 年广东工业大学 ACM 程序设计竞赛 ›

CF 106440D - 收纳收纳袋

We are given a sequence of containers, each container has a base size and a capacity. The twist is that containers can be nested, but with a strict rule: a container can directly hold at most one other container, and it can only do so if the inner container’s effective size…

Practice › Codeforces Solutions › “规律未来杯”2026 年广东工业大学 ACM 程序设计竞赛 ›

CF 106440J - 最远的彼此

We are given a hidden binary grid of size $n times n$. Some cells contain 1, others 0, and at least one cell is guaranteed to be 1. We cannot see the grid directly. Instead, we can ask whether a chosen subrectangle contains at least one 1, receiving a boolean answer.

Practice › Codeforces Solutions › “规律未来杯”2026 年广东工业大学 ACM 程序设计竞赛 ›

CF 106440F - 瞭望塔

We are given several independent scenarios. In each scenario there are multiple watchtowers. Each tower has two attributes: a strength parameter and a height.

Practice › Codeforces Solutions › “规律未来杯”2026 年广东工业大学 ACM 程序设计竞赛 ›

CF 106440A - 魔法石法阵

We are given two groups of vertices. The first group contains $a$ black nodes and the second contains $b$ white nodes. We must construct an undirected simple graph using these $a+b$ vertices. The graph must satisfy two conditions at the same time.