2019 China Collegiate Programming Contest Qinhuangdao Onsite

12 problems from 2019 China Collegiate Programming Contest Qinhuangdao Onsite (contest 102361), difficulty -. 12/12 solutions verified against sample I/O.

12 items

2019 China Collegiate Programming Contest Qinhuangdao Onsite

Special | 12 problems | 12/12 verified | Difficulty - | 29m 14s

#	Problem	Time	✓
A	Angle Beats	1m 55s	✓
B	The Tree of Haruhi Suzumiya	4m 6s	✓
C	Sakurada Reset	2m 23s	✓
D	Decimal	49s	✓
E	Escape	3m 46s	✓
F	Forest Program	1m 24s	✓
G	Game on Chessboard	3m 9s	✓
H	Houraisan Kaguya	1m 38s	✓
I	Invoker	1m 15s	✓
J	MUV LUV EXTRA	1m 35s	✓
K	MUV LUV UNLIMITED	2m 30s	✓
L	MUV LUV ALTERNATIVE	4m 44s	✓

Practice › Codeforces Solutions › 2019 China Collegiate Programming Contest Qinhuangdao Onsite ›

CF 102361G - Game on Chessboard

We have an (ntimes n) board containing at most one chess piece in each cell. Every piece is either white or black and has a positive removal value. A white and a black piece may be removed together if both are currently exposed from the bottom-left direction.

Practice › Codeforces Solutions › 2019 China Collegiate Programming Contest Qinhuangdao Onsite ›

CF 102361A - Angle Beats

For each query point (A), we have to choose two distinct original points (Pu) and (Pv). The three points must form a non-degenerate triangle with one angle equal to (90^circ). The output for that query is the number of such unordered pairs of original points.

Practice › Codeforces Solutions › 2019 China Collegiate Programming Contest Qinhuangdao Onsite ›

CF 102361H - Houraisan Kaguya

We have a prime modulus (p) and an array (a1,ldots,an), where every array value is nonzero modulo (p). For two nonzero residues (a,b), we need the smallest positive exponent (u) such that (a^u) belongs to the cyclic subgroup generated by (b). Call that value (f(a,b)).

Practice › Codeforces Solutions › 2019 China Collegiate Programming Contest Qinhuangdao Onsite ›

CF 102361C - Sakurada Reset

Asai Kei chooses a non-empty subsequence of a, while the director chooses a non-empty subsequence of b. A chosen sequence such as (2, 1, 2) is interpreted as a base-1000 number, so its value is 2 1000^2 + 1 1000 + 2.

Practice › Codeforces Solutions › 2019 China Collegiate Programming Contest Qinhuangdao Onsite ›

CF 102361L - MUV LUV ALTERNATIVE

The cabin is a rectangular grid, but most cells are not equally useful. There are two vertical corridors, each one cell wide. The first corridor is immediately after the left seated zone, and the second corridor is immediately after the middle seated zone.

Practice › Codeforces Solutions › 2019 China Collegiate Programming Contest Qinhuangdao Onsite ›

CF 102361K - MUV LUV UNLIMITED

We have a rooted tree with vertex 1 as the root. A move consists of deleting any nonempty set of current leaves, where a leaf is a vertex with no remaining children. Removing several leaves at once is allowed, and their parents may become leaves for the next move.

Practice › Codeforces Solutions › 2019 China Collegiate Programming Contest Qinhuangdao Onsite ›

CF 102361J - MUV LUV EXTRA

Only the digits after the decimal point matter. Let that fractional part have length (n). A candidate repeating part must be a suffix of the observed fractional digits, because the repetition has to be continuing at the very end of what Sumika measured.

Practice › Codeforces Solutions › 2019 China Collegiate Programming Contest Qinhuangdao Onsite ›

CF 102361I - Invoker

Invoker maintains a sequence of at most three elements. Pressing Q, W, or E appends that element to the sequence. If there are already three elements, the oldest one disappears first.

Practice › Codeforces Solutions › 2019 China Collegiate Programming Contest Qinhuangdao Onsite ›

CF 102361F - Forest Program

We have an undirected graph whose connected components are all cacti. We may choose any set of edges to remove. After the removals, every connected component must be a tree, which is equivalent to saying that the remaining graph must contain no cycle.

Practice › Codeforces Solutions › 2019 China Collegiate Programming Contest Qinhuangdao Onsite ›

CF 102361E - Escape

We have an n × m grid containing empty cells and blocked cells. Each robot starts immediately above the grid in a distinct column and initially moves downward. Each exit is immediately below the grid in a distinct column. A robot normally continues straight.

Practice › Codeforces Solutions › 2019 China Collegiate Programming Contest Qinhuangdao Onsite ›

CF 102361D - Decimal

For each test case, we are given a positive integer (n), and we need to decide whether the decimal representation of the fraction (1/n) eventually ends.

Practice › Codeforces Solutions › 2019 China Collegiate Programming Contest Qinhuangdao Onsite ›

CF 102361B - The Tree of Haruhi Suzumiya

We have a rooted tree whose root is vertex 1. Every vertex has an integer weight, and its depth is its distance from the root.