2019 USP Try-outs

11 problems from 2019 USP Try-outs (contest 102299), difficulty -. 11/11 solutions verified against sample I/O.

11 items

2019 USP Try-outs

Special | 11 problems | 11/11 verified | Difficulty - | 28m 16s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Kolkhozy				1m 58s	✓
B	Russo's Russian				8m 20s	✓
C	Crystal Matryoshkas				2m 27s	✓
D	Buildings and rockets				2m 4s	✓
E	Lenin's great dream				4m 18s	✓
F	Forbechenko v Rodvsky				1m 13s	✓
G	Hunting leshys				53s	✓
H	Course recommendation				1m 51s	✓
I	Sobytiynyy Proyekt Casino				1m 49s	✓
J	MasterCodeChef Russia				1m 11s	✓
K	Poor Folk				2m 12s	✓

Practice › Codeforces Solutions › 2019 USP Try-outs ›

CF 102299C - Crystal Matryoshkas

We maintain a collection of matryoshkas. Every doll has a positive integer weight and a unique identifier. A doll can contain several smaller dolls, but the total weight of everything directly or indirectly inside an outer doll must not exceed the outer doll's weight.

Practice › Codeforces Solutions › 2019 USP Try-outs ›

CF 102299B - Russo's Russian

We need to decide whether one input line can be generated from the nonterminal M of the given grammar. The line contains digits, whitespace, and the punctuation characters :, The grammar describes three layers. T is either a digit sequence or a complete { M } expression.

Practice › Codeforces Solutions › 2019 USP Try-outs ›

CF 102299I - Sobytiynyy Proyekt Casino

We have (N) pairs ((pi,fi)). When a pair is reached, the player receives (pi) rubles and can stop immediately, paying (fi) rubles. If (fi) is negative, paying it means receiving additional money. If the player reaches the final pair, stopping is mandatory there.

Practice › Codeforces Solutions › 2019 USP Try-outs ›

CF 102299H - Course recommendation

Each student has taken some subset of the available courses, and for every course they took we know their grade. For a particular student, we must find the other student whose grades are most similar on the courses they have both taken.

Practice › Codeforces Solutions › 2019 USP Try-outs ›

CF 102299K - Poor Folk

We have an array of positive chapter prices. Whenever a debt is due, Dostoyevskiy may sell any subset of the already written chapters, and the debt can be paid exactly when its value equals the sum of that subset.

Practice › Codeforces Solutions › 2019 USP Try-outs ›

CF 102299J - MasterCodeChef Russia

The problem asks us to choose a point (p=(pt,pi)) that represents the parameters we want to use, together with the smallest possible value of (t).

Practice › Codeforces Solutions › 2019 USP Try-outs ›

CF 102299G - Hunting leshys

We have n leshys, each with a fixed power. At the beginning, every leshy is the root of its own hierarchy, so there are n separate trees. A meeting operation + i j says that leshy j becomes subordinate to leshy i.

Practice › Codeforces Solutions › 2019 USP Try-outs ›

CF 102299F - Forbechenko v Rodvsky

We are given two positive integers (A) and (B), representing the fraction (A/B). We may choose any integer base (beta ge 2), and we want the smallest base in which this fraction has a finite representation after the radix point.

Practice › Codeforces Solutions › 2019 USP Try-outs ›

CF 102299E - Lenin's great dream

We have trees (T2,T3,ldots,TN), where tree (Ti) contains exactly (i) cities. Every tree is connected and has exactly (i-1) streets. All but at most two of these trees are stars centered at city 1.

Practice › Codeforces Solutions › 2019 USP Try-outs ›

CF 102299D - Buildings and rockets

The city is modeled by line segments in the plane. A building is represented by a segment with an associated height, and a rocket trajectory is another segment. Whenever a rocket trajectory intersects a building segment, that building is a possible collision.

Practice › Codeforces Solutions › 2019 USP Try-outs ›

CF 102299A - Kolkhozy

Each collective farm produces k[i] bags of grain. For a query (l, r, x, m), we consider only farms from l through r. If a farm supplies m families, the number of bags left after giving every family the same integer number of bags is exactly k[i] mod m.