TheForces Round #32 (2^5-Forces, TheForces Rated, Prizes!)

5 problems from TheForces Round #32 (2^5-Forces, TheForces Rated, Prizes!) (contest 105270), difficulty -. 0/5 solutions verified against sample I/O.

5 items

TheForces Round #32 (2^5-Forces, TheForces Rated, Prizes!)

Special | 5 problems | 0/5 verified | Difficulty - | 11m 33s

#	Problem	Time
A	Short Query	1m 27s
B	Minimum MEX	1m 27s
C	Range Contradiction	3m 25s
D	Eleven	2m 32s
E	Not a Segment Tree	2m 42s

Practice › Codeforces Solutions › TheForces Round #32 (2^5-Forces, TheForces Rated, Prizes!) ›

CF 105270A - Short Query

We are given an array of integers. In one move, we are allowed to pick two different elements. If their sum is even, we remove both and append their sum back into the array, so the array size decreases by exactly one.

Practice › Codeforces Solutions › TheForces Round #32 (2^5-Forces, TheForces Rated, Prizes!) ›

CF 105270E - Not a Segment Tree

We are given a circular array and a second target array of the same length. One operation lets us pick an index and overwrite that position with the sum of a symmetric window around it, extending k steps to both sides on the circle.

Practice › Codeforces Solutions › TheForces Round #32 (2^5-Forces, TheForces Rated, Prizes!) ›

CF 105270D - Eleven

We are given a binary string and we are allowed to modify it using a second binary string that has exactly $m$ ones. Each position where this second string has a 1 flips the corresponding bit of the original string. After all flips, we obtain a new string $T$.

Practice › Codeforces Solutions › TheForces Round #32 (2^5-Forces, TheForces Rated, Prizes!) ›

CF 105270B - Minimum MEX

We are given an array and we are allowed to look at any contiguous segment of it. For every such segment we compute its MEX, the smallest non-negative integer that does not appear inside the segment. Among all segments, we first care about those whose MEX is as large as possible.

Practice › Codeforces Solutions › TheForces Round #32 (2^5-Forces, TheForces Rated, Prizes!) ›

CF 105270C - Range Contradiction

We are given an array of even length, and we are allowed to freely reorder its elements using swaps, so in effect we can permute it arbitrarily.