Technocup 2021 - Elimination Round 2

Solutions for Technocup 2021 - Elimination Round 2 (contest 1415). 6/6 problems verified against sample I/O. Difficulty range: 800-2900.

6 items

Technocup 2021 - Elimination Round 2

Type: Special | Problems: 6 | Verified: 6/6 | Rating range: 800-2900 | Time: 15m 13s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Prison Break	800	brute-force, math	1m 23s	✓
B	Repainting Street	1100	brute-force, greedy	1m 53s	✓
C	Bouncing Ball	1400	brute-force, dp, implementation	1m 45s	✓
D	XOR-gun	2000	bitmasks, brute-force, constructive-algorithms	1m 25s	✓
E	New Game Plus!	2200	constructive-algorithms, greedy, math	1m 56s	✓
F	Cakes for Clones	2900	dp	6m 51s	✓

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

CF 1415F - Cakes for Clones

Ah, now the situation is clear. The actual problem here is not a logic error in the algorithm-the traceback tells us Python never even found a function named solve. The testing harness tried to call solve(), but the code provided had no such function defined.

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

CF 1415E - New Game Plus!

Each boss has a value c[i]. When we defeat a boss, we gain the current bonus as score, then that boss changes the bonus by c[i]. If there were no resets, the order of bosses would completely determine how many times each c[i] contributes to future scores.

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

CF 1415D - XOR-gun

We are given a sorted array, and we are allowed to repeatedly compress any adjacent pair into a single value equal to their bitwise XOR. Each compression reduces the length of the array by one, and we are never allowed to reduce below length one.

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

CF 1415B - Repainting Street

We have a row of houses, each painted with some color. In one day, Tom chooses a contiguous segment of exactly k houses. Inside that segment he may repaint any subset of those houses, and each house can be repainted to any color independently.

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

CF 1415C - Bouncing Ball

We have a binary string representing cells in a level. A 1 means a platform already exists, and a 0 means the cell is empty. The ball must start bouncing from position p, then visit positions p + k, p + 2k, and so on. Every one of those positions must contain a platform.

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

CF 1415A - Prison Break

We are given a rectangular prison with $n$ rows and $m$ columns. Each cell contains exactly one prisoner, and there is a single exit tunnel in a cell located at row $r$ and column $c$.