Codeforces Round 823 (Div. 2)

6 problems from Codeforces Round 823 (Div. 2) (contest 1730), difficulty 800-2700. 3/6 solutions verified against sample I/O.

6 items

Codeforces Round 823 (Div. 2)

Div. 2 | 6 problems | 3/6 verified | Difficulty 800-2700 | 20m 53s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Planets	800	data-structures, greedy, sortings	24,813	1m 20s	✓
B	Meeting on the Line	1600	binary-search, geometry, greedy	17,252	1m 35s
C	Minimum Notation	1200	data-structures, greedy, math	17,933	1m 41s	✓
D	Prefixes and Suffixes	2200	constructive-algorithms, strings, two-pointers	3,023	1m 58s
E	Maximums and Minimums	2700	combinatorics, data-structures, divide-and-conquer	767	4m 13s	✓
F	Almost Sorted	2700	bitmasks, data-structures, dp	743	10m 6s

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

CF 1730F - Almost Sorted

We are given a permutation p of size n, and we must construct another permutation q of indices 1..n. The constraint on q is unusual: if we look at the values of p along q, they cannot drop by more than k as we move forward.

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

CF 1730E - Maximums and Minimums

The task is to count how many contiguous subarrays of a given array have a very specific structural property: if you look inside the subarray, take its smallest element and its largest element, the larger one must be an exact multiple of the smaller one.

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

CF 1730D - Prefixes and Suffixes

We are given two strings of equal length. Think of them as two rows of characters, each row having $n$ positions.

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

CF 1730B - Meeting on the Line

We are given a line with people standing at different coordinates. Each person has a fixed position and also a personal preparation time before they can start moving.

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

CF 1730A - Planets

We are given several independent test cases. In each test case there is a multiset of integers, where each integer represents an orbit label of a planet. Planets sharing the same value belong to the same orbit. We have two ways to destroy planets.

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

CF 1730C - Minimum Notation

We are given a string of decimal digits. For any digit, we may remove it from its current position, increase its value by one (capped at 9), and insert the resulting digit anywhere in the string. The operation can be repeated as many times as we want.