Technocup 2019 - Elimination Round 3

6 problems from Technocup 2019 - Elimination Round 3 (contest 1032), difficulty 900-2900. 2/6 solutions verified against sample I/O.

6 items

Technocup 2019 - Elimination Round 3

Special | 6 problems | 2/6 verified | Difficulty 900-2900 | 45m 9s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Kitchen Utensils	900		7,335	10m 29s	✓
B	Personalized Cup	1200		5,145	9m 12s	✓
D	Barcelonian Distance	1900	geometry, implementation	2,976	5m 6s
E	The Unbearable Lightness of Weights	2100	dp, math	1,865	3m 25s
F	Vasya and Maximum Matching	2400	dp, trees	1,143	1m 51s
G	Chattering	2900		511	15m 6s

Practice › Codeforces Solutions › Technocup 2019 - Elimination Round 3 ›

CF 1032G - Chattering

We are given a circular arrangement of parrots, where each parrot has a numeric “influence radius” derived from its respect level. If a parrot at position i starts speaking at time 0, then at time 1 all parrots within distance ri to its left and right also start speaking.

Practice › Codeforces Solutions › Technocup 2019 - Elimination Round 3 ›

CF 1032E - The Unbearable Lightness of Weights

We are given a multiset of weights, each weight having an integer mass between 1 and 100, but the weights are indistinguishable to us. We do not know which physical item corresponds to which mass, only the full list of masses exists somewhere in our friend’s knowledge.

Practice › Codeforces Solutions › Technocup 2019 - Elimination Round 3 ›

CF 1032F - Vasya and Maximum Matching

We are given a tree and we are allowed to remove any subset of its edges. After removals, the tree becomes a forest. On this resulting forest, we consider all possible matchings and focus on those that achieve maximum size.

Practice › Codeforces Solutions › Technocup 2019 - Elimination Round 3 ›

CF 1032A - Kitchen Utensils

We are given the multiset of utensils that remained after a banquet and the number of guests who attended. Each guest received several identical “dishes”, and each dish came with a fixed set of utensils.

Practice › Codeforces Solutions › Technocup 2019 - Elimination Round 3 ›

CF 1032B - Personalized Cup

We are given a single string representing the winner’s handle, and we must print it as a rectangular grid. Each cell of the grid contains either a character from the string or an asterisk.

Practice › Codeforces Solutions › Technocup 2019 - Elimination Round 3 ›

CF 1032D - Barcelonian Distance

We are working in a city where movement is allowed only along two types of roads. The first type is the standard integer grid: you can travel freely along any vertical line x = k or horizontal line y = k, and the cost is simply Euclidean distance along those lines, which…