Codeforces Round 1019 (Div. 2)

6 problems from Codeforces Round 1019 (Div. 2) (contest 2103), difficulty 800-2600. 1/6 solutions verified against sample I/O.

6 items

Codeforces Round 1019 (Div. 2)

Div. 2 | 6 problems | 1/6 verified | Difficulty 800-2600 | 9m 19s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Common Multiple	800	brute-force, greedy, implementation	24,942	1m 30s	✓
B	Binary Typewriter	1100	greedy, math	17,700	1m 43s
C	Median Splits	1600	binary-search, greedy, implementation	10,549	2m 2s
D	Local Construction	2000	constructive-algorithms, dfs-and-similar, implementation	3,980	41s
E	Keep the Sum	2600	constructive-algorithms, implementation, two-pointers	600	1m 37s
F	Maximize Nor	2600	bitmasks, data-structures, dp	618	1m 46s

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

CF 2103F - Maximize Nor

We are asked to process an array of integers where each integer fits in k bits. For each position in the array, we must find the maximum value of a "bitwise nor" over all subarrays that include that position.

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

CF 2103E - Keep the Sum

We are given an array of integers a where every element lies between 0 and k. The allowed operation is to pick two distinct indices i and j such that a[i] + a[j] = k, and then redistribute a value x from a[i] to a[j] (or vice versa) while ensuring both elements remain in the…

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

CF 2103D - Local Construction

We are given, for each position in an unknown permutation, the iteration at which the element at that position disappears under a deterministic pruning process.

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

CF 2103C - Median Splits

We are given an array and asked whether we can cut it into three contiguous parts such that a particular condition involving medians holds across the cuts. If we pick two split points, the array is divided into three non-empty segments.

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

CF 2103B - Binary Typewriter

We are given a binary string that we want to type using a very simple typewriter with only two keys, 0 and 1. At any moment, a finger rests on one of these two keys. Pressing the key under the finger outputs that character, while switching keys costs a separate operation.

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

CF 2103A - Common Multiple

We are given an array of positive integers and we want to select as many elements as possible while keeping their original order irrelevant since we are forming a subsequence.