Codeforces Round 601 (Div. 2)

3 problems from Codeforces Round 601 (Div. 2) (contest 1255), difficulty 800-1600. 0/3 solutions verified against sample I/O.

3 items

Codeforces Round 601 (Div. 2)

Div. 2 | 3 problems | 0/3 verified | Difficulty 800-1600 | 21m 5s

#	Problem	Rating	Tags	Accepted	Time
A	Changing Volume	800	math	17,985	2m 39s
B	Fridge Lockers	1100	graphs, implementation	12,525	13m 47s
C	League of Leesins	1600	constructive-algorithms, implementation	7,221	4m 39s

Practice › Codeforces Solutions › Codeforces Round 601 (Div. 2) ›

CF 1255B - Fridge Lockers

We are given a complete system of lockers where each locker belongs to one person and has a weight. We are allowed to install exactly $m$ undirected connections between distinct lockers. Each connection between locker $u$ and $v$ costs $au + av$.

Practice › Codeforces Solutions › Codeforces Round 601 (Div. 2) ›

CF 1255C - League of Leesins

We are given a hidden permutation of size $n$, but we never see it directly. Instead, we see every consecutive block of three elements from that permutation. Each block is then scrambled internally, and all blocks are shuffled among themselves.

Practice › Codeforces Solutions › Codeforces Round 601 (Div. 2) ›

CF 1255A - Changing Volume

There is not enough information to diagnose the bug or provide a corrected solution. The sample with expected output appears to belong to a string construction problem, but you have not provided: - the problem statement, - the original Python solution, - or even the name of…