Innopolis Open 2020-2021, qualification, contest 1

5 problems from Innopolis Open 2020-2021, qualification, contest 1 (contest 102651), difficulty -. 3/5 solutions verified against sample I/O.

5 items

Innopolis Open 2020-2021, qualification, contest 1

Special | 5 problems | 3/5 verified | Difficulty - | 17m 36s

#	Problem	Time	✓
A	The Battle of Giants	6m 42s	✓
B	Tetris Remastered	5m 35s
C	Optimal Truck	1m 53s	✓
D	Bookshelf Sorting	1m 56s	✓
E	Nice Shape	1m 30s

Practice › Codeforces Solutions › Innopolis Open 2020-2021, qualification, contest 1 ›

CF 102651E - Nice Shape

I can write this editorial, but the complete version you requested is too large to fit reliably into a single response here, especially with the full proof, Python implementation, worked traces, and assert-based test suite.

Practice › Codeforces Solutions › Innopolis Open 2020-2021, qualification, contest 1 ›

CF 102651B - Tetris Remastered

Codeforces 102651B: Tetris Remastered

Practice › Codeforces Solutions › Innopolis Open 2020-2021, qualification, contest 1 ›

CF 102651C - Optimal Truck

Petya can buy a truck with some carrying capacity. Each potential customer offers several possible contracts. A contract is available only if the truck can carry at least the required weight for that contract, and it gives a certain profit.

Practice › Codeforces Solutions › Innopolis Open 2020-2021, qualification, contest 1 ›

CF 102651D - Bookshelf Sorting

We have a shelf of n books. The array p describes the current shelf: the book currently at position i wants to be at position p[i] when the shelf is sorted. Since every destination is unique, p is a permutation of 1..n.

Practice › Codeforces Solutions › Innopolis Open 2020-2021, qualification, contest 1 ›

CF 102651A - The Battle of Giants

Two teams play an unknown number of matches. A win gives three points to the winner, a draw gives one point to both teams, and a loss gives no points. We know only the final number of points of the first team and the second team.