2022 China Collegiate Programming Contest (CCPC) Weihai Site

13 problems from 2022 China Collegiate Programming Contest (CCPC) Weihai Site (contest 104023), difficulty -. 13/13 solutions verified against sample I/O.

13 items

2022 China Collegiate Programming Contest (CCPC) Weihai Site

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

#	Problem	Time	✓
A	Dunai	48s	✓
B	Recruitment	46s	✓
C	Grass	1m 2s	✓
D	Sternhalma	1m 1s	✓
E	Python Will be Faster than C++	50s	✓
F	Mooncake Delivery	49s	✓
G	Grade 2	40s	✓
H	Party Animals	1m 16s	✓
I	Dragon Bloodline	1m	✓
J	Eat, Sleep, Repeat	2m 50s	✓
K	I Wanna Maker	1m 15s	✓
L	Novice Magician	51s	✓
M	String Master	45s	✓

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Weihai Site ›

CF 104023J - Eat, Sleep, Repeat

We are given a multiset of integers $a1, a2, dots, an$. Each move consists of choosing one element and decreasing it by $1$. Over time, elements drift downward until they eventually become $0$.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Weihai Site ›

CF 104023M - String Master

We are given a very large infinite binary string built by concatenating binary representations of all non-negative integers in order. It starts as 0, then 1, then 10, 11, 100, 101, and so on, forming a single endless sequence of bits.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Weihai Site ›

CF 104023K - I Wanna Maker

We are asked to count how many integer intervals $[l, r]$ with $1 le l le r$ satisfy a list of conditions. Each condition talks about whether it is possible to pick $k$ distinct integers inside the interval whose sum equals a target value $x$.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Weihai Site ›

CF 104023L - Novice Magician

We are given an array of length $2^n$, initially all zeros, and a target array $b$. The only allowed operation is unusual: in one move we pick exactly $2^{n-1}$ distinct positions and assign them values that form an arithmetic progression with step 2.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Weihai Site ›

CF 104023H - Party Animals

We are given a line of players, each holding one of three possible gestures. The system evolves through two kinds of actions. The first action selects a segment of consecutive players and runs a left to right sequence of matches along the edges inside that segment.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Weihai Site ›

CF 104023I - Dragon Bloodline

Each test gives a collection of essence types and a collection of worker dragons split by levels. Every essence type has a required amount, and every completed dragon egg consumes exactly that amount of each essence type. Worker dragons do not contribute equally.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Weihai Site ›

CF 104023G - Grade 2

We are given a fixed integer $x$, and then many queries, each query describing a segment of integers $[l, r]$. For every integer $k$ in such a segment, we form a value by taking $kx$ and XOR-ing it with $x$, then we check whether this resulting number is coprime with $x$.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Weihai Site ›

CF 104023F - Mooncake Delivery

We are given a weighted undirected graph where nodes represent planets and edges represent tunnels. Each planet has two attributes: a color and a cost. The cost is the amount of power consumed when Melon first lands on that planet.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Weihai Site ›

CF 104023D - Sternhalma

We are given a fixed small board of 19 positions, each position carrying a value. These values can be positive or negative and represent the score obtained when a piece sitting on that cell is removed in a specific way.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Weihai Site ›

CF 104023E - Python Will be Faster than C++

We are given a sequence that represents the runtime of a Python implementation across successive versions. The first $n$ values are known from measurement.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Weihai Site ›

CF 104023C - Grass

We are given a set of points in the plane, and we need to determine whether we can pick one special point A together with four other distinct points B, C, D, E such that the segments from A to each of these four points behave in a very strict geometric way.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Weihai Site ›

CF 104023A - Dunai

We are given a history of champion teams in a five-position competitive game. Each past champion team consists of exactly five named players, one per fixed position from 1 to 5.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Weihai Site ›

CF 104023B - Recruitment

We are given a final sequence of values produced from a process that starts with an expression consisting of n positive integers separated by plus signs. Initially everything is summed.