Codeforces Round 462 (Div. 1)

3 problems from Codeforces Round 462 (Div. 1) (contest 933), difficulty 1800-3200. 3/3 solutions verified against sample I/O.

3 items

Codeforces Round 462 (Div. 1)

Div. 1 | 3 problems | 3/3 verified | Difficulty 1800-3200 | 3m 54s

#	Problem	Rating	Tags	Accepted	Time	✓
A	A Twisty Movement	1800	dp	5,400	1m 15s	✓
B	A Determined Cleanup	2000	math	2,054	1m 10s	✓
E	A Preponderant Reunion	3200	constructive-algorithms, dp	288	1m 29s	✓

Practice › Codeforces Solutions › Codeforces Round 462 (Div. 1) ›

CF 933E - A Preponderant Reunion

We are given a sequence of non-negative integers. The only allowed operation is to pick a pair of adjacent positions where both values are still positive, subtract the smaller value from both, and pay a cost equal to that smaller value.

Practice › Codeforces Solutions › Codeforces Round 462 (Div. 1) ›

CF 933A - A Twisty Movement

We are given a sequence made only of two values, 1 and 2, arranged in a line. We are allowed to choose a single contiguous segment of this sequence, reverse it, and then we want to measure how long a non-decreasing subsequence becomes after this operation.

Practice › Codeforces Solutions › Codeforces Round 462 (Div. 1) ›

CF 933B - A Determined Cleanup

We are asked to construct a polynomial whose coefficients are non-negative integers strictly less than a given base $k$, such that when this polynomial is divided by $x + k$, the remainder is exactly the constant polynomial $p$.