Technocup 2021 - Elimination Round 3

7 problems from Technocup 2021 - Elimination Round 3 (contest 1411), difficulty 800-3000. 5/7 solutions verified against sample I/O.

7 items

Technocup 2021 - Elimination Round 3

Special | 7 problems | 5/7 verified | Difficulty 800-3000 | 25m 35s

#	Problem	Rating	Tags	Accepted	Time	✓
A	In-game Chat	800	implementation	21,749	1m 23s	✓
B	Fair Numbers	1000	brute-force, number-theory	30,309	1m 26s	✓
C	Peaceful Rooks	1700	dfs-and-similar, dsu, graphs	8,576	8m 35s
D	Grime Zoo	2100	brute-force, greedy, implementation	2,716	9m 23s
E	Poman Numbers	2300	bitmasks, greedy, math	1,829	1m 39s	✓
F	The Thorny Path	3000	greedy, math	436	1m 47s	✓
G	No Game No Life	2700	bitmasks, games, math	890	1m 22s	✓

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

CF 1411D - Grime Zoo

We are given a binary string where some positions are already fixed as 0 or 1, while others are unknown and written as ?. Each ? must be replaced by either 0 or 1, and this choice determines the final string.

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

CF 1411C - Peaceful Rooks

We are given a chessboard where no two rooks initially share a row or a column, so every rook sits in a distinct row and a distinct column.

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

CF 1411F - The Thorny Path

We are asked to work with permutations and cycles. Imagine you have a line of colored stones labeled from 1 to $n$. The monks can perform a "cycle shift" operation determined by a permutation $p$.

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

CF 1411G - No Game No Life

We are asked to calculate the probability that Alice wins a two-player chip-moving game on a directed acyclic graph. Each vertex can hold any number of chips, and players take turns moving a single chip along an outgoing edge.

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

CF 1411E - Poman Numbers

We are given a string of lowercase letters, which we interpret as a number in a strange “poman” numeral system. Each single letter corresponds to a power of two, where a is 2^0 = 1, b is 2^1 = 2, c is 2^2 = 4, and so on up to z = 2^25.

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

CF 1411B - Fair Numbers

We are asked to find the smallest integer greater than or equal to a given number that is divisible by all of its nonzero digits. In other words, a number is fair if, for every digit d in the number that is not zero, the number modulo d equals zero.

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

CF 1411A - In-game Chat

We are given several chat messages. Each message is a string containing lowercase English letters and the character ).