Innopolis Open in Informatics, 2020-2021, the final

5 problems from Innopolis Open in Informatics, 2020-2021, the final (contest 102962), difficulty -. 4/5 solutions verified against sample I/O.

5 items

Innopolis Open in Informatics, 2020-2021, the final

Special | 5 problems | 4/5 verified | Difficulty - | 6m 7s

#	Problem	Time	✓
A	Parking Problem	1m 10s	✓
B	Diamond Hands	2m 24s
C	RPS string	58s	✓
D	Long puzzle	47s	✓
E	Rooted MST	48s	✓

Practice › Codeforces Solutions › Innopolis Open in Informatics, 2020-2021, the final ›

CF 102962B - Diamond Hands

The solution does not address the stated problem at all. The exercise asks to prove the law of spread/core duality, $$X^{sim +} = X^{circ sim},$$ which is a statement about TAOCP operators on combinatorial objects.

Practice › Codeforces Solutions › Innopolis Open in Informatics, 2020-2021, the final ›

CF 102962E - Rooted MST

We are working with a graph that has a special structure. There is a distinguished node labeled 0, and every other node from 1 to n is directly connected to it by an edge whose weight is given initially.

Practice › Codeforces Solutions › Innopolis Open in Informatics, 2020-2021, the final ›

CF 102962D - Long puzzle

We are given a collection of puzzle pieces, each piece behaving like a rigid segment with a fixed length and two labeled endpoints. Each endpoint is one of three types: flat, convex, or concave. Pieces cannot be flipped, so left and right sides are fixed.

Practice › Codeforces Solutions › Innopolis Open in Informatics, 2020-2021, the final ›

CF 102962A - Parking Problem

We are given a one-dimensional parking strip divided into unit cells. Some cells are already blocked, others are free. Over time, a sequence of vehicles arrives. Each vehicle is either a motorcycle that occupies one free cell or a car that occupies two adjacent free cells.

Practice › Codeforces Solutions › Innopolis Open in Informatics, 2020-2021, the final ›

CF 102962C - RPS string

We are given a line of robots, each permanently associated with one of three actions: rock, paper, or scissors. The only operation we can perform is to repeatedly choose two adjacent robots and make them “fight”, after which one of them is removed according to the usual RPS…