Codeforces Round 1024 (Div. 1)

6 problems from Codeforces Round 1024 (Div. 1) (contest 2101), difficulty 1300-3300. 0/6 solutions verified against sample I/O.

6 items

Codeforces Round 1024 (Div. 1)

Div. 1 | 6 problems | 0/6 verified | Difficulty 1300-3300 | 14m 18s

#	Problem	Rating	Tags	Accepted	Time
A	Mex in the Grid	1300	constructive-algorithms, implementation	13,423	1m 36s
B	Quartet Swapping	1800	brute-force, data-structures, divide-and-conquer	6,822	1m 36s
C	23 Kingdom	2200	binary-search, brute-force, data-structures	2,260	1m 39s
D	Mani and Segments	2500	data-structures, implementation, sortings	1,019	4m 32s
E	Kia Bakes a Cake	3100	data-structures, dp, greedy	273	1m 55s
F	Shoo Shatters the Sunshine	3300	combinatorics, dp, trees	155	3m

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

CF 2101D - Mani and Segments

We are given a permutation and asked to examine every contiguous segment of it. For each segment we compute two classical sequence measures: the length of its longest strictly increasing subsequence and the length of its longest strictly decreasing subsequence.

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

CF 2101F - Shoo Shatters the Sunshine

We are given a tree with n vertices. Each vertex can be colored red, blue, or white. The "coolness" of a coloring is the largest distance between a red and a blue vertex. If there are no red or no blue vertices, the coolness is zero.

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

CF 2101E - Kia Bakes a Cake

We are given a tree on $n$ vertices and a binary marker on each vertex that tells us whether that vertex is “active”. Only active vertices participate in the construction of a second structure: a complete weighted graph formed from these active nodes.

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

CF 2101C - 23 Kingdom

We are asked to maximize the "beauty" of an array derived from a given array a. For each position in a, the new array b must satisfy 1 ≤ bi ≤ ai. The beauty of b is the sum of the largest gaps between repeated occurrences of each value in b.

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

CF 2101B - Quartet Swapping

We are given a permutation, which we can think of as a row of distinct numbered tiles. The only allowed move takes any block of four consecutive positions and swaps the first with the third and the second with the fourth, effectively turning a segment [ai, a{i+1}, a{i+2}…

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

CF 2101A - Mex in the Grid

We are asked to fill an $n times n$ grid with the integers from $0$ to $n^2 - 1$, each used exactly once. Every rectangular subgrid contributes a value equal to the MEX of the numbers inside it, and the objective is to maximize the sum of these MEX values over all possible…