Codeforces Round 754 (Div. 2)

Solutions for Codeforces Round 754 (Div. 2) (contest 1605). 3/6 problems verified against sample I/O. Difficulty range: 800-2900.

6 items

Codeforces Round 754 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 3/6 | Rating range: 800-2900 | Time: 21m 30s

Problem	Name	Rating	Tags	Solve Time	Verified
A	A.M. Deviation	800	math, number-theory	1m 49s	✗
B	Reverse Sort	1000	greedy, sortings	13m 13s	✗
C	Dominant Character	1400	brute-force, greedy, implementation	1m 55s	✓
D	Treelabeling	2100	bitmasks, constructive-algorithms, dfs-and-similar	1m 47s	✗
E	Array Equalizer	2400	binary-search, greedy, implementation	1m 29s	✓
F	PalindORme	2900	combinatorics, dp	1m 17s	✓

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

CF 1605B - Reverse Sort

We are given a binary string and want to transform it into sorted order, which for a binary string means that all 0s appear before all 1s. One operation allows us to choose a subsequence whose values are non-increasing.

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

CF 1605F - PalindORme

We are asked to count arrays of length n with elements from 0 to 2^k - 1 that can be reordered to form a “PalindORme.

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

CF 1605D - Treelabeling

We are asked to relabel the nodes of a tree so that the first player, Eikooc, can maximize her number of guaranteed winning starting positions.

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

CF 1605E - Array Equalizer

We are given an initial array a and a target array b of length n, but the first value of b is unknown and will be supplied separately for each query. For every query value x, we temporarily set b[1] = x and want to transform a into this fully specified b.

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

CF 1605C - Dominant Character

We are given a string composed only of the letters 'a', 'b', and 'c', and we are asked to find the length of the smallest contiguous substring in which the letter 'a' occurs strictly more times than both 'b' and 'c'. The substring must have a minimum length of two.

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

CF 1605A - A.M. Deviation

We are given three integers, which we can think of as points on the number line: $a1$, $a2$, and $a3$. The goal is to make the middle number $a2$ as close as possible to being the arithmetic mean of the other two, using the following operation any number of times: choose two…