Innopolis Open 2020-2021, qualification, contest 1

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

2 items

Innopolis Open 2020-2021, qualification, contest 1

Special | 2 problems | 2/2 verified | Difficulty - | 8m 38s

#	Problem	Rating	Tags	Accepted	Time	✓
A	The Battle of Giants				6m 42s	✓
D	Bookshelf Sorting				1m 56s	✓

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.