The 2023 CCPC Online Contest

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

12 items

The 2023 CCPC Online Contest

Special | 12 problems | 6/12 verified | Difficulty - | 14m 49s

#	Problem	Time	✓
A	Almost Prefix Concatenation	1m 13s	✓
B	Palindromic Beads	1m 48s
C	Clique Challenge	2m 6s	✓
D	Discrete Fourier Transform	1m 9s	✓
E	Robot Experiment	1m 39s
F	Flying Ship Story	1m 47s	✓
G	GCD of Pattern Matching	34s
H	Hurricane	20s
I	Monster Generator	40s
J	Find the Gap	31s
K	Sequence Shift	1m 27s	✓
L	Partially Free Meal	1m 35s	✓

Practice › Codeforces Solutions › The 2023 CCPC Online Contest ›

CF 104651L - Partially Free Meal

We are given a collection of dishes, each dish having two independent values. The first value represents its normal cost, and the second value represents an additional “event surcharge” that is not paid per dish but only once per selection, equal to the maximum surcharge…

Practice › Codeforces Solutions › The 2023 CCPC Online Contest ›

CF 104651J - Find the Gap

We are given a set of points in three-dimensional space. The task is to place two parallel planes such that every point lies between them, and the distance between the planes is as small as possible.

Practice › Codeforces Solutions › The 2023 CCPC Online Contest ›

CF 104651B - Palindromic Beads

We are given a tree of rooms, where each room contains exactly one bead with a color label. Each color appears at most twice in the entire tree, which already strongly restricts the structure of identical-color relationships.

Practice › Codeforces Solutions › The 2023 CCPC Online Contest ›

CF 104651E - Robot Experiment

A robot starts at the origin of an infinite integer grid and executes a fixed sequence of movement commands. Each command attempts to move the robot one unit in one of the four cardinal directions.

Practice › Codeforces Solutions › The 2023 CCPC Online Contest ›

CF 104651I - Monster Generator

We are given a fixed set of monsters, and we simulate training over a sequence of days indexed by a parameter $k$. On each day $k$, every monster has two day-dependent values: it costs some amount of HP to defeat, and then it returns some HP reward after being defeated.

Practice › Codeforces Solutions › The 2023 CCPC Online Contest ›

CF 104651H - Hurricane

Codeforces 104651H: Hurricane

Practice › Codeforces Solutions › The 2023 CCPC Online Contest ›

CF 104651G - GCD of Pattern Matching

We are given a base $m$ and a pattern string $P$ over lowercase letters. We interpret any positive integer as an $m$-ary number, written as a sequence of digits.

Practice › Codeforces Solutions › The 2023 CCPC Online Contest ›

CF 104651K - Sequence Shift

We are maintaining two arrays of equal length, where one array stays fixed and the other evolves over time under a very specific sliding operation.

Practice › Codeforces Solutions › The 2023 CCPC Online Contest ›

CF 104651F - Flying Ship Story

We maintain a growing collection of items. Each item belongs to an island and has a type and a price. The system supports two operations: inserting a new item and answering queries that ask for the most expensive item that avoids two forbidden categories simultaneously, a…

Practice › Codeforces Solutions › The 2023 CCPC Online Contest ›

CF 104651D - Discrete Fourier Transform

We are given a length-n integer sequence. From it, we compute its discrete Fourier transform, which produces n complex values. Each frequency t corresponds to a complex sum of all array elements, each multiplied by a unit complex rotation depending on its index and t.

Practice › Codeforces Solutions › The 2023 CCPC Online Contest ›

CF 104651C - Clique Challenge

We are given an undirected graph with up to 1000 vertices and up to 1000 edges. The task is to count how many different non-empty vertex subsets form a clique, meaning every pair of vertices inside the subset must be directly connected by an edge.

Practice › Codeforces Solutions › The 2023 CCPC Online Contest ›

CF 104651A - Almost Prefix Concatenation

We are given two strings, $S$ and $T$. The task is to cut $S$ into a sequence of contiguous non-empty pieces. Each piece must resemble a prefix of $T$, but not necessarily exactly. It is allowed to differ from that corresponding prefix in at most one character position.