Innopolis Open 2021-2022. Final round

5 problems from Innopolis Open 2021-2022. Final round (contest 103575), difficulty -. 4/5 solutions verified against sample I/O.

5 items

Innopolis Open 2021-2022. Final round

Special | 5 problems | 4/5 verified | Difficulty - | 5m 58s

#	Problem	Time	✓
A	Designing a New Logo	51s	✓
B	Even Tree	2m 38s
C	Primle	49s	✓
D	Add and Multiply	49s	✓
E	Draft Laws	51s	✓

Practice › Codeforces Solutions › Innopolis Open 2021-2022. Final round ›

CF 103575B - Even Tree

Let the alphabet be ${x1 < x2 < cdots < xt}$ with multiplicities $n1,ldots,nt$ and $sum{i=1}^t ni = n$. Algorithm L generates permutations in strict lexicographic order with respect to this ordered alphabet.

Practice › Codeforces Solutions › Innopolis Open 2021-2022. Final round ›

CF 103575E - Draft Laws

We are given a tree with $n$ vertices, and a palette of $k$ colors. Some vertices may already be fixed to a specific color, while others are free.

Practice › Codeforces Solutions › Innopolis Open 2021-2022. Final round ›

CF 103575D - Add and Multiply

We are given two arrays of the same length. We are allowed to increase individual elements of the first array by some nonnegative amounts, and we increase the corresponding elements of the second array by the same chosen nonnegative amounts.

Practice › Codeforces Solutions › Innopolis Open 2021-2022. Final round ›

CF 103575A - Designing a New Logo

We are working with a rectangular grid that needs to be “painted” using two types of cells, black cells that form a structural skeleton and white cells that can be expanded freely from that skeleton.

Practice › Codeforces Solutions › Innopolis Open 2021-2022. Final round ›

CF 103575C - Primle

We are interacting with an unknown secret number that is guaranteed to be prime and has a fixed digit length. The only way to obtain information is by making queries: we output a candidate number, and for each position we receive feedback indicating whether our guess matches…