Technocup 2019 - Elimination Round 4

7 problems from Technocup 2019 - Elimination Round 4 (contest 1085), difficulty 800-2900. 5/7 solutions verified against sample I/O.

7 items

Technocup 2019 - Elimination Round 4

Special | 7 problems | 5/7 verified | Difficulty 800-2900 | 23m 43s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Right-Left Cipher	800	implementation, strings	12,697	3m 55s	✓
B	Div Times Mod	1100	math	10,086	1m 45s	✓
C	Connect Three	1600	implementation, math	5,643	2m 25s	✓
D	Minimum Diameter Tree	1700	constructive-algorithms, implementation, trees	5,907	2m 20s
E	Vasya and Templates	2300	greedy, implementation, strings	1,122	2m 19s	✓
F	Rock-Paper-Scissors Champion	2500		710	7m 56s
G	Beautiful Matrix	2900	combinatorics, data-structures, dp	709	3m 3s	✓

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

CF 1085F - Rock-Paper-Scissors Champion

We are given a line of players, each permanently assigned one of three Rock-Paper-Scissors moves. A tournament proceeds by repeatedly picking two adjacent players, playing a match, and removing the loser.

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

CF 1085A - Right-Left Cipher

We are given a string that is the final result of repeatedly building another hidden string by alternately appending characters to the right and inserting characters to the left.

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

CF 1085D - Minimum Diameter Tree

We are given a tree and a fixed total amount of “weight budget” $s$. Every edge must be assigned a non-negative real weight, and the sum over all edges must equal exactly $s$.

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

CF 1085G - Beautiful Matrix

We are given an $n times n$ matrix where every entry is an integer from $1$ to $n$. The matrix is constrained in two ways: each row contains no repeated values, and vertically adjacent cells in the same column are also distinct.

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

CF 1085E - Vasya and Templates

We are given three strings over an alphabet of size $k$. Think of the letters $a, b, c, dots$ but only the first $k$ of them are used.

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

CF 1085B - Div Times Mod

We are given two integers, a target value built from a multiplication expression, and a fixed base parameter that controls how we split any positive integer into a quotient and a remainder.

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

CF 1085C - Connect Three

We are given three distinct cells on an infinite grid, each representing a square plot of land. Initially everything is blocked, and we are allowed to “clear” any cells we want.