Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2)

9 problems from Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) (contest 2211), difficulty 800-3500. 2/9 solutions verified against sample I/O.

9 items

Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2)

Div. 1+2 | 9 problems | 2/9 verified | Difficulty 800-3500 | 17m 58s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Antimedian Deletion	800	implementation, math	16,006	1m 22s	✓
B	Mickey Mouse Constructive	1100	constructive-algorithms, dp, greedy	11,575	1m 45s	✓
C1	Equal Multisets (Easy Version)	1300	binary-search, brute-force, greedy	9,054	2m 9s
C2	Equal Multisets (Hard Version)	1800	constructive-algorithms, dsu, greedy	3,659	1m 49s
D	AND-array	1900	bitmasks, combinatorics, math	2,884	2m 35s
E	Minimum Path Cover	2500	brute-force, dp, greedy	851	1m 54s
F	Learning Binary Search	2400	combinatorics, divide-and-conquer, dp	913	2m 12s
G	Rational Bubble Sort	2900	constructive-algorithms, geometry, greedy	276	2m 7s
H	Median Deletion	3500		99	2m 5s

Practice › Codeforces Solutions › Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) ›

CF 2211H - Median Deletion

We are given a permutation of integers from 1 to $n$. The problem allows an operation where we select any consecutive three elements and delete the second smallest among them.

Practice › Codeforces Solutions › Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) ›

CF 2211G - Rational Bubble Sort

We are given an array of integers where each element can range from 0 to 10^6. Our allowed operation is to pick any two adjacent elements, compute their average, and then set both elements to that average.

Practice › Codeforces Solutions › Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) ›

CF 2211F - Learning Binary Search

We are working with all nondecreasing arrays of length $n$ whose values lie between $1$ and $m$. Each such array can be thought of as a way to distribute $n$ positions among $m$ distinct values, where each value appears in a contiguous block or not at all.

Practice › Codeforces Solutions › Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) ›

CF 2211D - AND-array

We are given a hidden array a of length n. Instead of seeing a directly, we are provided with a sequence b such that each element bk is the sum of the bitwise ANDs of all k-element subsequences of a, modulo 10^9 + 7.

Practice › Codeforces Solutions › Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) ›

CF 2211E - Minimum Path Cover

We are given a rooted tree where every node carries a large integer value. A valid “vertical path” is simply a downward chain: each node is the child of the previous one.

Practice › Codeforces Solutions › Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) ›

CF 2211C2 - Equal Multisets (Hard Version)

We are given two arrays of length $n$, both indexed from 1 to $n$, and a window size $k$. The first array $a$ is fully fixed, while the second array $b$ is partially unknown because some positions contain $-1$.

Practice › Codeforces Solutions › Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) ›

CF 2211C1 - Equal Multisets (Easy Version)

We are given two arrays, a and b, of length n and a parameter k. The array a is a permutation of numbers from 1 to n, which means every number from 1 to n appears exactly once.

Practice › Codeforces Solutions › Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) ›

CF 2211B - Mickey Mouse Constructive

We are asked to work with arrays built from only two types of elements: 1 and -1. Each test case specifies how many of each we have, x ones and y minus ones. The array can be any permutation of these elements.

Practice › Codeforces Solutions › Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) ›

CF 2211A - Antimedian Deletion

We are given a permutation of size $n$, which is an array containing each integer from $1$ to $n$ exactly once in some order. The only operation allowed is to take any consecutive three elements and remove either the largest or the smallest among them.