Codeforces Round 1063 (Div. 2)

6 problems from Codeforces Round 1063 (Div. 2) (contest 2163), difficulty 800-2700. 0/6 solutions verified against sample I/O.

6 items

Codeforces Round 1063 (Div. 2)

Div. 2 | 6 problems | 0/6 verified | Difficulty 800-2700 | 12m 58s

#	Problem	Rating	Tags	Accepted	Time
A	Souvlaki VS. Kalamaki	800	brute-force, greedy, math	19,584	3m 28s
B	Siga ta Kymata	1700	constructive-algorithms, greedy, implementation	9,125	2m 13s
C	Monopati	1500	brute-force, combinatorics, dp	9,016	1m 40s
D1	Diadrash (Easy Version)	2100	binary-search, brute-force, divide-and-conquer	2,728	1m 20s
D2	Diadrash (Hard Version)	2500	binary-search, interactive, math	1,498	1m 26s
E	Plegma	2700	bitmasks, combinatorics, communication	637	2m 51s

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

CF 2163E - Plegma

We are dealing with a two-phase interactive problem. In the first phase, Player A receives a full $n times n$ binary grid, where each cell is either a 0 or a 1, and each test case also specifies whether the grid is fully connected through 1s or not.

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

CF 2163D2 - Diadrash (Hard Version)

We are given a hidden permutation of the integers from 0 to n−1, and a collection of fixed segments of this permutation. For each segment, we are interested in its mex, the smallest non-negative integer that does not appear inside that segment.

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

CF 2163D1 - Diadrash (Easy Version)

We are given a hidden permutation of integers from 0 to n-1, and our task is to find the maximum MEX over a set of ranges. Each range specifies a contiguous segment of the permutation, and the MEX of a range is the smallest non-negative integer missing from that segment.

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

CF 2163A - Souvlaki VS. Kalamaki

We are given a sequence of integers, and two players take turns acting on consecutive pairs of elements. On each turn, the current player may either skip or swap the current element with the next.

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

CF 2163B - Siga ta Kymata

We are given a permutation of integers from 1 to $n$, and a binary string $x$ of the same length. Initially, we have another binary string $s$ of zeros.

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

CF 2163C - Monopati

We are given a 2-row grid with $n$ columns, where each cell contains a distinct integer from $1$ to $2n$. For any interval of integers $[l, r]$, we can generate a binary grid where a cell is marked 1 if its original value falls inside that interval, otherwise 0.