Codeforces Round 1095 (Div. 2)

7 problems from Codeforces Round 1095 (Div. 2) (contest 2226), difficulty -. 0/7 solutions verified against sample I/O.

7 items

Codeforces Round 1095 (Div. 2)

Div. 2 | 7 problems | 0/7 verified | Difficulty - | 23m 23s

#	Problem	Tags	Accepted	Time
A	Disturbing Distribution	greedy, math	10,744	3m 10s
B	Everything Everywhere	greedy, math, number-theory	9,677	3m 22s
C	Mental Monumental (Easy Version)	binary-search, data-structures, greedy	5,263	6m 17s
D	Reserved Reversals	constructive-algorithms, dp, greedy	2,074	2m 22s
E	Mental Monumental (Hard Version)	data-structures, greedy, math	683	3m 59s
F	Inversion Invasion	math, number-theory	170	1m 41s
G	Stop Spot	implementation, strings, trees	113	2m 32s

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

CF 2226A - Disturbing Distribution

We are given a sequence of positive integers. We repeatedly remove groups of elements until nothing remains. Each group must respect two constraints: if we look at the chosen indices in increasing order, the corresponding values must be nondecreasing, and the indices…

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

CF 2226B - Everything Everywhere

We are given a permutation of the integers from 1 to n. For every contiguous subarray, we look at three quantities: - its maximum value, - its minimum value, - the GCD of all values inside it.

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

CF 2226C - Mental Monumental (Easy Version)

Each array element can be modified independently. For a value $x$, we may choose any positive integer $b$, then replace $x$ by $x bmod b$. The goal is to maximize the MEX of the resulting array.

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

CF 2226D - Reserved Reversals

We are given several test cases, each consisting of an array. The task is to decide whether we can transform each array into a non-decreasing order using a specific operation: we may pick any subarray, compute its minimum and maximum values, and reverse it, but only if the sum…

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

CF 2226E - Mental Monumental (Hard Version)

We are given an array, and we look at it prefix by prefix. For each prefix we are allowed to transform each element independently exactly once using a very permissive operation: pick any integer $bi ge 1$, replace $ai$ with the remainder of dividing it by $bi$.

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

CF 2226F - Inversion Invasion

For every divisor $dmid n$, define $$Gd={vin[1,n]mid gcd(v,n)=d}.$$ The array $a$ gradually fixes some positions. If $ai=dneq 0$, then position $i$ must contain a value from $Gd$. Unfixed positions may contain any remaining values.

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

CF 2226G - Stop Spot

An array $a$ is fixed, and we append to it a permutation $p$ of ${1,2,dots,m}$ to form a longer array $bp$. For each such permutation, we count how many subarrays of $bp$ with even length are palindromes.