Technocup 2019 - Elimination Round 2

6 problems from Technocup 2019 - Elimination Round 2 (contest 1031), difficulty 800-2800. 1/6 solutions verified against sample I/O.

6 items

Technocup 2019 - Elimination Round 2

Special | 6 problems | 1/6 verified | Difficulty 800-2800 | 1h 4m

#	Problem	Rating	Tags	Accepted	Time	✓
A	Golden Plate	800	implementation, math	13,396	6m 26s	✓
B	Curiosity Has No Limits	1500		4,064	17m 21s
C	Cram Time	1600	greedy	5,608	13m 38s
D	Minimum path	1900	greedy	2,985	6m 46s
E	Triple Flips	2600	constructive-algorithms	571	8m 34s
F	Familiar Operations	2800	brute-force, graphs, math	310	11m 31s

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

CF 1031F - Familiar Operations

Stopped thinking

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

CF 1031E - Triple Flips

We are given a binary array and a single operation that flips exactly three positions, but those three positions must form an arithmetic progression.

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

CF 1031B - Curiosity Has No Limits

We are given two arrays of length $n-1$. Each position $i$ describes a relationship between two unknown consecutive values $ti$ and $t{i+1}$, where each $ti$ is an integer in the range $[0, 3]$, meaning we can treat every value as a 2-bit number.

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

CF 1031C - Cram Time

Lesha has two separate time budgets, one for today and one for tomorrow. Each lecture note has a fixed reading cost equal to its index: note 1 takes 1 hour, note 2 takes 2 hours, and so on.

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

CF 1031D - Minimum path

We are given an $n times n$ grid of lowercase letters. We are allowed to modify at most $k$ cells, changing their letters to any lowercase character we want.

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

CF 1031A - Golden Plate

We are working with a rectangular grid of size $w times h$, where each cell can be thought of as a unit square on a plate. We repeatedly draw “rings” of gilding on this grid. The first ring covers the outer border of the whole rectangle.