GPC 2024

13 problems from GPC 2024 (contest 105638), difficulty -. 13/13 solutions verified against sample I/O.

13 items

GPC 2024

Special | 13 problems | 13/13 verified | Difficulty - | 11m 41s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Reborn and HearthStone				51s	✓
B	Hile and Fx				56s	✓
C	Reborn and SegmentTree				52s	✓
D	Piza Removes the Letters				1m	✓
E	Piza Removes Nothing				53s	✓
F	Reborn and TFT				59s	✓
G	Geos Likes Shopping				1m 2s	✓
H	Kyooma Loves Tree				47s	✓
I	Hile and Array				46s	✓
J	Boboge and Card Shuffle				1m 4s	✓
K	Hile counts the Qi				57s	✓
L	Kyooma Loves Numbers				46s	✓
M	Kyooma Loves Numbers \u2161				48s	✓

Practice › Codeforces Solutions › GPC 2024 ›

CF 105638H - Kyooma Loves Tree

We are given a complete k-ary tree of fixed depth, meaning every internal node has exactly k children and all leaves lie at the same depth. Each edge in this tree is independently removed with a given probability p (modulo a prime), so each edge either survives or disappears.

Practice › Codeforces Solutions › GPC 2024 ›

CF 105638C - Reborn and SegmentTree

We are given an array and a segment tree that was built over it for range minimum queries. The tree is standard: every node represents a segment of the array, and stores the minimum value on that segment.

Practice › Codeforces Solutions › GPC 2024 ›

CF 105638K - Hile counts the Qi

The board is a grid containing three types of cells: black stones, white stones, and empty intersections. Stones of the same color that touch orthogonally form a single connected group.

Practice › Codeforces Solutions › GPC 2024 ›

CF 105638M - Kyooma Loves Numbers Ⅱ

We are given a single integer per test case, and for each one we must construct five positive integers such that all five are at most that given limit and they satisfy a hidden arithmetic condition.

Practice › Codeforces Solutions › GPC 2024 ›

CF 105638G - Geos Likes Shopping

We are given several item types. Each type has a limited supply, and we must pick exactly a fixed number of items in total across all types. The twist is that the profit from a type is not constant per item.

Practice › Codeforces Solutions › GPC 2024 ›

CF 105638D - Piza Removes the Letters

We are given a lowercase string. The process applied to it has two stages. First, we delete one contiguous segment of fixed length.

Practice › Codeforces Solutions › GPC 2024 ›

CF 105638L - Kyooma Loves Numbers

We are given a number written in base 15, where digits can be 0-9 and A-E representing values 10-14. We are allowed to perform at most one swap between two positions in the digit string.

Practice › Codeforces Solutions › GPC 2024 ›

CF 105638J - Boboge and Card Shuffle

We are given a sequence of cards. Each card has a suit among four types and a number. Inside each suit, numbers are unique and come from the same range, so every suit behaves like a permutation of the same value set.

Practice › Codeforces Solutions › GPC 2024 ›

CF 105638I - Hile and Array

We are given a fixed sequence of operations applied to a single running value. Each operation in the sequence is one of three types: addition by a constant, subtraction by a constant, or multiplication by a constant. The sequence is applied in order from left to right.

Practice › Codeforces Solutions › GPC 2024 ›

CF 105638F - Reborn and TFT

We are given a pool of champions, each champion being described by a binary string over a fixed set of traits. A 1 at position j means that champion possesses trait j.

Practice › Codeforces Solutions › GPC 2024 ›

CF 105638E - Piza Removes Nothing

We are given a tree where each edge carries a weight that can be positive or negative. Between any two nodes there is exactly one simple path, so the “shortest path between two nodes” is not a choice among multiple routes, it is simply that unique tree path.

Practice › Codeforces Solutions › GPC 2024 ›

CF 105638B - Hile and Fx

We are given a target number for each test case, and we need to decide whether it can be represented as a sum of a carefully constructed integer and the sum of its digits.

Practice › Codeforces Solutions › GPC 2024 ›

CF 105638A - Reborn and HearthStone

We are given a one-on-one fight between two minions. Each minion has health and attack. The fight proceeds in discrete rounds. In each round, Reborn’s minion strikes first, reducing the enemy’s health by its attack value.