Codeforces Round 1011 (Div. 2)

7 problems from Codeforces Round 1011 (Div. 2) (contest 2085), difficulty 900-2900. 0/7 solutions verified against sample I/O.

7 items

Codeforces Round 1011 (Div. 2)

Div. 2 | 7 problems | 0/7 verified | Difficulty 900-2900 | 12m 17s

#	Problem	Rating	Tags	Accepted	Time
A	Serval and String Theory	900	constructive-algorithms, implementation	23,543	1m 36s
B	Serval and Final MEX	1200	constructive-algorithms, implementation	17,094	1m 40s
C	Serval and The Formula	1600	bitmasks, constructive-algorithms, dp	13,556	1m 54s
D	Serval and Kaitenzushi Buffet	2000	data-structures, graph-matchings, greedy	5,304	1m 37s
E	Serval and Modulo	2200	constructive-algorithms, math, number-theory	3,151	1m 49s
F1	Serval and Colorful Array (Easy Version)	2600	data-structures, greedy	782	1m 50s
F2	Serval and Colorful Array (Hard Version)	2900	data-structures, greedy	522	1m 51s

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

CF 2085F2 - Serval and Colorful Array (Hard Version)

We are asked to determine the minimum number of adjacent swaps needed to create at least one "colorful" subarray within a given array. A colorful subarray is exactly length k and contains all integers from 1 to k exactly once.

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

CF 2085F1 - Serval and Colorful Array (Easy Version)

We are given an array of integers where each number from 1 to a given magic number $k$ appears at least once. The goal is to transform this array so that it contains a contiguous subarray of length $k$ in which every number from 1 to $k$ appears exactly once.

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

CF 2085E - Serval and Modulo

We are given two arrays of the same length: the original array a of non-negative integers, and a shuffled array b. The array b is supposedly generated by taking every element of a modulo some unknown integer k, then shuffling the results.

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

CF 2085D - Serval and Kaitenzushi Buffet

The problem is a scheduling and selection problem framed as a sushi-eating scenario. Serval is at a conveyor belt sushi restaurant where each plate contains exactly k pieces of sushi and has an associated deliciousness value di.

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

CF 2085C - Serval and The Formula

We are given two positive integers, x and y, and we are asked to find a non-negative integer k such that when we add k to both numbers, their sum equals their bitwise XOR. In other words, we want (x + k) + (y + k) = (x + k) ⊕ (y + k). If no such k exists, we should return -1.

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

CF 2085B - Serval and Final MEX

We are given an array of non-negative integers. The only allowed move takes a contiguous segment, replaces it with a single number equal to the MEX of that segment, and shortens the array.

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

CF 2085A - Serval and String Theory

We are given a string of lowercase letters and a limit on the number of swaps we can perform. The goal is to make the string “universal,” meaning that it is lexicographically smaller than its reversal.