The 2024 CCPC Online Contest

12 problems from The 2024 CCPC Online Contest (contest 105336), difficulty -. 12/12 solutions verified against sample I/O.

12 items

The 2024 CCPC Online Contest

Special | 12 problems | 12/12 verified | Difficulty - | 13m 52s

#	Problem	Time	✓
A	\u519b\u8bad I	1m 18s	✓
B	\u519b\u8bad II	1m 51s	✓
C	\u79cd\u6811	56s	✓
D	\u7f16\u7801\u5668-\u89e3\u7801\u5668	1m 10s	✓
E	\u968f\u673a\u8fc7\u7a0b	54s	✓
F	\u5305\u5b50\u9e21\u86cb III	1m 15s	✓
G	\u75af\u72c2\u661f\u671f\u516d	57s	✓
H	\u53e6\u4e00\u4e2a\u6e38\u620f	1m 11s	✓
I	\u627e\u884c\u674e	1m 17s	✓
J	\u627e\u6700\u5c0f	1m 15s	✓
K	\u53d6\u6c99\u5b50\u6e38\u620f	1m 6s	✓
L	\u7f51\u7edc\u9884\u9009\u8d5b	42s	✓

Practice › Codeforces Solutions › The 2024 CCPC Online Contest ›

CF 105336L - 网络预选赛

We are given a grid of lowercase letters with $n$ rows and $m$ columns. From this grid, we are interested in selecting any two consecutive rows and any two consecutive columns. Each such choice defines a $2 times 2$ submatrix.

Practice › Codeforces Solutions › The 2024 CCPC Online Contest ›

CF 105336K - 取沙子游戏

There is a pile of $n$ stones and two players who alternate turns, with Alice moving first. On each move a player removes some positive number of stones from the pile. The size of a move is restricted in two ways.

Practice › Codeforces Solutions › The 2024 CCPC Online Contest ›

CF 105336J - 找最小

We are given two binary-like sequences of equal length. Each position contains a 31-bit non-negative integer, and at every index we are allowed to swap the two values in that position any number of times. After performing swaps, we end up with two new sequences.

Practice › Codeforces Solutions › The 2024 CCPC Online Contest ›

CF 105336I - 找行李

We are given two sets of points on a number line. One set represents luggage items, each sitting at some integer position. The other set represents people standing in front of a conveyor belt, also at integer positions.

Practice › Codeforces Solutions › The 2024 CCPC Online Contest ›

CF 105336H - 另一个游戏

We are given a turn-based game with a single evolving state: a combat strength value and a cumulative damage value. Initially the strength is some fixed value $a0$, and damage starts at zero. There are $n$ rounds, and in each round we must choose exactly one of two actions.

Practice › Codeforces Solutions › The 2024 CCPC Online Contest ›

CF 105336G - 疯狂星期六

A group of n people goes to a restaurant, and each person has a personal spending limit. This limit already includes the cost of transportation to the restaurant, and any additional spending inside the restaurant must keep their total expenditure within their limit.

Practice › Codeforces Solutions › The 2024 CCPC Online Contest ›

CF 105336F - 包子鸡蛋 III

We are given a random string of length $n$, built independently character by character from the lowercase alphabet. Each position is assigned letter $i$ with probability $pi$.

Practice › Codeforces Solutions › The 2024 CCPC Online Contest ›

CF 105336E - 随机过程

We are generating $n$ independent random strings, each of length $m$, where every character is chosen uniformly from the 26 lowercase English letters.

Practice › Codeforces Solutions › The 2024 CCPC Online Contest ›

CF 105336B - 军训 II

We are given a list of heights and are allowed to reorder them arbitrarily into a line. For any fixed arrangement, every contiguous segment contributes a cost equal to the difference between the tallest and the shortest person inside that segment.

Practice › Codeforces Solutions › The 2024 CCPC Online Contest ›

CF 105336A - 军训 I

We are given an $n times m$ grid of students standing in a rectangle. Each cell either contains a student or is empty. From this initial configuration, an operation is applied repeatedly, where each operation “compresses” the arrangement according to one of four commands.

Practice › Codeforces Solutions › The 2024 CCPC Online Contest ›

CF 105336D - 编码器-解码器

We are given a string $S$ of length $n$. From this string, a second much larger string is constructed recursively.

Practice › Codeforces Solutions › The 2024 CCPC Online Contest ›

CF 105336C - 种树

We are given a tree with $n$ nodes representing neighborhoods connected by roads. Some of these neighborhoods are already completed, while the rest still need work. Each day, a team of three workers chooses exactly three neighborhoods that form a connected subgraph in the tree.