Codeforces Round 1054 (Div. 3)

7 problems from Codeforces Round 1054 (Div. 3) (contest 2149), difficulty 800-2100. 5/7 solutions verified against sample I/O.

7 items

Codeforces Round 1054 (Div. 3)

Div. 3 | 7 problems | 5/7 verified | Difficulty 800-2100 | 10m 5s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Be Positive	800	math	40,875	1m 14s	✓
B	Unconventional Pairs	800	greedy, sortings	33,021	1m 14s	✓
C	MEX rose	900	greedy	28,121	1m 13s	✓
D	A and B	1200	strings	19,331	1m 39s	✓
E	Hidden Knowledge of the Ancients	1500	data-structures, two-pointers	9,263	1m 26s	✓
F	Nezuko in the Clearing	1900	binary-search, math, ternary-search	4,808	1m 41s
G	Buratsuta 3	2100	binary-search, brute-force, data-structures	2,666	1m 38s

Practice › Codeforces Solutions › Codeforces Round 1054 (Div. 3) ›

CF 2149G - Buratsuta 3

We are given an array of integers and many independent range queries. For each query segment, we must identify all values whose frequency inside that segment is strictly greater than one third of the segment length.

Practice › Codeforces Solutions › Codeforces Round 1054 (Div. 3) ›

CF 2149F - Nezuko in the Clearing

Nezuko starts at position 0 on a number line with a certain number of health points, and she wants to reach position d. In each turn, she can either rest to gain one health point or move forward by one.

Practice › Codeforces Solutions › Codeforces Round 1054 (Div. 3) ›

CF 2149D - A and B

We are given a binary string made only of two symbols, a and b. We are allowed to swap adjacent characters, so any operation is essentially a single step of bubble-sorting two neighbors.

Practice › Codeforces Solutions › Codeforces Round 1054 (Div. 3) ›

CF 2149E - Hidden Knowledge of the Ancients

We are given a sequence of integers representing symbols on an ancient tablet. Each test case asks us to count the number of continuous segments (subarrays) of this sequence that satisfy two conditions: the segment contains exactly k distinct numbers, and its length is at…

Practice › Codeforces Solutions › Codeforces Round 1054 (Div. 3) ›

CF 2149A - Be Positive

We are given an array of length $n$ where each element is either $-1$, $0$, or $1$. We are allowed to increment any element by one any number of times. The goal is to make the product of all elements strictly positive while performing the fewest possible operations.

Practice › Codeforces Solutions › Codeforces Round 1054 (Div. 3) ›

CF 2149B - Unconventional Pairs

We are given an even-length array of integers representing participants in a show. The task is to form pairs of participants such that each participant is in exactly one pair, and the difference between the two numbers in a pair is minimized in a global sense.

Practice › Codeforces Solutions › Codeforces Round 1054 (Div. 3) ›

CF 2149C - MEX rose

We are given an array of integers, each between 0 and n, and a target number k. We can replace any element with any integer from 0 to n in a single operation. Our goal is to make the MEX of the array equal to k using the minimum number of replacements.