2021 Hubei Provincial Collegiate Programming Contest

11 problems from 2021 Hubei Provincial Collegiate Programming Contest (contest 103104), difficulty -. 9/11 solutions verified against sample I/O.

11 items

2021 Hubei Provincial Collegiate Programming Contest

Special | 11 problems | 9/11 verified | Difficulty - | 11m 44s

#	Problem	Time	✓
A	CRC Test	2m 40s
B	Mr.X and Reviewing Location	53s	✓
C	Data structure	55s	✓
D	Fragmentation merging	51s	✓
E	Revue	50s	✓
F	Battery	49s	✓
G	Crossword Puzzle	55s	✓
H	Information Transmission	1m 8s	✓
I	Sequence	1m 6s
J	Similar Triangles	48s	✓
K	Chtholly and World-End Battle	49s	✓

Practice › Codeforces Solutions › 2021 Hubei Provincial Collegiate Programming Contest ›

CF 103104K - Chtholly and World-End Battle

We are given a static array of integers and a sequence of queries. Each query specifies a subarray range and an initial value. To process a query, we start from the given value v and scan the array elements from left to right within the range [l, r].

Practice › Codeforces Solutions › 2021 Hubei Provincial Collegiate Programming Contest ›

CF 103104I - Sequence

Connection interrupted. Waiting for the complete answer

Practice › Codeforces Solutions › 2021 Hubei Provincial Collegiate Programming Contest ›

CF 103104H - Information Transmission

We are given a directed communication network of stations. Each station can forward a message to some other stations along directed links. A message starts at station 1 and is repeatedly relayed until it possibly reaches other stations.

Practice › Codeforces Solutions › 2021 Hubei Provincial Collegiate Programming Contest ›

CF 103104J - Similar Triangles

We are given a triangle with integer coordinates in the plane. The task is not to compute any property of this triangle directly, but instead to construct a different triangle, also with integer coordinates, that is similar to the given one while having the smallest possible…

Practice › Codeforces Solutions › 2021 Hubei Provincial Collegiate Programming Contest ›

CF 103104G - Crossword Puzzle

We are given a crossword grid drawn as a large ASCII picture. Each logical cell of the crossword is a 5×5 block in the input, where borders are shared between neighboring cells.

Practice › Codeforces Solutions › 2021 Hubei Provincial Collegiate Programming Contest ›

CF 103104A - CRC Test

Fix an integer $t ge 1$. Let $N ge 0$ be given. Define $kappat N$ in the discrete sense (as in earlier parts of Section 7.2.1.3) as the unique integer $m ge t-1$ such that $$binom{m}{t} le N < binom{m+1}{t},$$ and set $$kappat N = binom{m}{t-1}.

Practice › Codeforces Solutions › 2021 Hubei Provincial Collegiate Programming Contest ›

CF 103104F - Battery

We are given a collection of batteries and a collection of shooting locations. Each battery has a fixed amount of energy, and each location requires a fixed amount of energy to complete one recording session.

Practice › Codeforces Solutions › 2021 Hubei Provincial Collegiate Programming Contest ›

CF 103104E - Revue

We are given a sequence of interactions between numbered participants, each participant starting with some unknown but distinct “radiance” value.

Practice › Codeforces Solutions › 2021 Hubei Provincial Collegiate Programming Contest ›

CF 103104D - Fragmentation merging

We are given a permutation of length $n$, and we interpret any pair of indices $(l, r)$ as a “fragmentation” that corresponds to the set of values in the segment $al, a{l+1}, dots, ar$ if $l le r$. If $l r$, that fragmentation represents an empty set.

Practice › Codeforces Solutions › 2021 Hubei Provincial Collegiate Programming Contest ›

CF 103104C - Data structure

We are given two independent structures that interact through a color-mapping rule. On one side, we have a Huffman tree built from the first $K$ Fibonacci weights.

Practice › Codeforces Solutions › 2021 Hubei Provincial Collegiate Programming Contest ›

CF 103104B - Mr.X and Reviewing Location

We are given a circular hall centered at the origin with radius $R$, and $n$ existing people inside it. Each person occupies a point in the plane, and we are guaranteed that every pair of existing people is at least 2 units apart.