The 2019 China Collegiate Programming Contest Harbin Site

12 problems from The 2019 China Collegiate Programming Contest Harbin Site (contest 102394), difficulty -. 12/12 solutions verified against sample I/O.

12 items

The 2019 China Collegiate Programming Contest Harbin Site

Special | 12 problems | 12/12 verified | Difficulty - | 33m 58s

#	Problem	Time	✓
A	Artful Paintings	5m 52s	✓
B	Binary Numbers	2m 29s	✓
C	Competition in Swiss-system	2m 17s	✓
D	Driverless Car	3m 7s	✓
E	Exchanging Gifts	1m 36s	✓
F	Fixing Banners	1m 21s	✓
G	Game Store	2m 57s	✓
H	Highway Buses	7m 37s	✓
I	Interesting Permutation	1m 37s	✓
J	Justifying the Conjecture	1m 27s	✓
K	Keeping Rabbits	1m	✓
L	LRU Algorithm	2m 38s	✓

Practice › Codeforces Solutions › The 2019 China Collegiate Programming Contest Harbin Site ›

CF 102394A - Artful Paintings

We have a row of (N) cubes, and each cube is either painted or left untouched. A type 1 rule requires at least (K) painted cubes inside a particular interval ([L,R]). A type 2 rule requires at least (K) painted cubes outside that interval.

Practice › Codeforces Solutions › The 2019 China Collegiate Programming Contest Harbin Site ›

CF 102394I - Interesting Permutation

We have a permutation (a) containing every integer from (1) to (n) exactly once. For every prefix (a1,ldots,ai), consider its largest and smallest values. Their difference is (hi).

Practice › Codeforces Solutions › The 2019 China Collegiate Programming Contest Harbin Site ›

CF 102394C - Competition in Swiss-system

There are (n) players and (m) rounds. In every round, a player either participates in one match or receives a bye. A match contains either two or three games, and the input directly gives how many games each player won and how many were drawn.

Practice › Codeforces Solutions › The 2019 China Collegiate Programming Contest Harbin Site ›

CF 102394H - Highway Buses

There are (n) bus stations connected by an undirected, connected graph. Every highway has unit length, so the distance between two stations is their ordinary shortest path length in the graph.

Practice › Codeforces Solutions › The 2019 China Collegiate Programming Contest Harbin Site ›

CF 102394L - LRU Algorithm

We have an access sequence a[1..n]. For a chosen cache capacity m, the LRU cache maintains its items from most recently used to least recently used. Whenever an item is accessed, it becomes the first item in the list.

Practice › Codeforces Solutions › The 2019 China Collegiate Programming Contest Harbin Site ›

CF 102394K - Keeping Rabbits

We have (n) rabbits with initial weights (w1,w2,ldots,wn). On each of (k) mornings, exactly one rabbit receives one additional unit of weight.

Practice › Codeforces Solutions › The 2019 China Collegiate Programming Contest Harbin Site ›

CF 102394J - Justifying the Conjecture

For each test case, we need to split the integer n into two positive integers x and y such that x is prime, y is composite, and x + y = n. The two numbers must both be strictly smaller than n. If no such split exists, we print -1.

Practice › Codeforces Solutions › The 2019 China Collegiate Programming Contest Harbin Site ›

CF 102394G - Game Store

On each day, one new rental set becomes available. A set is identified by two values: (ai), the size of each of its two equal piles, and (bi), the amount Alice pays to rent that set.

Practice › Codeforces Solutions › The 2019 China Collegiate Programming Contest Harbin Site ›

CF 102394F - Fixing Banners

We have exactly six old banners. From each banner, we must choose exactly one character, giving us exactly six characters in total. We may reorder those six characters freely, and the final word must be harbin.

Practice › Codeforces Solutions › The 2019 China Collegiate Programming Contest Harbin Site ›

CF 102394E - Exchanging Gifts

We start with a very long array of gift types. Position (i) initially contains (gi). We may arbitrarily exchange gifts between contestants, so the final array can be any permutation of the original multiset of gift types.

Practice › Codeforces Solutions › The 2019 China Collegiate Programming Contest Harbin Site ›

CF 102394D - Driverless Car

We have an axis-aligned rectangular field and two disjoint line segments strictly inside it. The car is a point, and every point of its route must be equally distant from the two segments.

Practice › Codeforces Solutions › The 2019 China Collegiate Programming Contest Harbin Site ›

CF 102394B - Binary Numbers

Every integer from (0) through (2^m-1) can be viewed as an (m)-bit binary string, padding leading zeroes when necessary. The function (F{m-1}(a,b)) counts how many consecutive bits from the most significant side are equal before the first mismatch.