Codeforces Round 1026 (Div. 2)

6 problems from Codeforces Round 1026 (Div. 2) (contest 2110), difficulty 800-2400. 2/6 solutions verified against sample I/O.

6 items

Codeforces Round 1026 (Div. 2)

Div. 2 | 6 problems | 2/6 verified | Difficulty 800-2400 | 8m 44s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Fashionable Array	800	implementation, sortings	29,802	1m 9s	✓
B	Down with Brackets	900	strings	27,339	1m 8s	✓
C	Racing	1400	constructive-algorithms, greedy	15,821	1m 47s
D	Fewer Batteries	1700	binary-search, dfs-and-similar, dp	8,604	1m 42s
E	Melody	2300	dfs-and-similar, graphs, implementation	2,713	1m 28s
F	Faculty	2400	brute-force, greedy, math	1,914	1m 30s

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

CF 2110F - Faculty

We are given an array of positive integers, and for each prefix of the array we are asked to compute its "beauty." The beauty of an array is defined as the maximum value of the function $f(x, y) = (x bmod y) + (y bmod x)$ over all pairs of elements $x, y$ in the prefix.

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

CF 2110D - Fewer Batteries

We are asked to guide a robot through a series of checkpoints. Each checkpoint has a certain number of batteries that the robot can collect, and there are one-way passages connecting some checkpoints.

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

CF 2110E - Melody

We are asked to arrange a set of sounds, each defined by a volume and pitch, into a sequence that is simultaneously beautiful and non-boring.

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

CF 2110C - Racing

We are asked to plan a drone flight through a sequence of obstacles, where each obstacle defines an allowable height range.

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

CF 2110A - Fashionable Array

We are given an array of integers, and we define it as fashionable if the sum of its minimum and maximum elements is even. Our task is to determine the minimum number of elements that must be removed so that the array becomes fashionable.

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

CF 2110B - Down with Brackets

We are given a string representing a balanced sequence of parentheses, and we need to decide whether it is possible to remove exactly one opening bracket and exactly one closing bracket such that the resulting string is no longer balanced.