Educational Codeforces Round 111 (Rated for Div. 2)

6 problems from Educational Codeforces Round 111 (Rated for Div. 2) (contest 1550), difficulty 800-2700. 3/6 solutions verified against sample I/O.

6 items

Educational Codeforces Round 111 (Rated for Div. 2)

Div. 2 | 6 problems | 3/6 verified | Difficulty 800-2700 | 38m 34s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Find The Array	800	greedy, math	29,459	6m 4s
B	Maximum Cost Deletion	1000	greedy, math	28,549	3m 39s	✓
C	Manhattan Subarrays	1700	brute-force, geometry, greedy	10,847	12m 41s
D	Excellent Arrays	2300	binary-search, combinatorics, constructive-algorithms	2,058	6m 20s
E	Stringforces	2500	binary-search, bitmasks, brute-force	1,838	5m 43s	✓
F	Jumping Around	2700	binary-search, data-structures, divide-and-conquer	899	4m 7s	✓

Practice › Codeforces Solutions › Educational Codeforces Round 111 (Rated for Div. 2) ›

CF 1550C - Manhattan Subarrays

We are given an array where each element represents a point on a vertical line at its index. More precisely, the i-th element forms a point $(ai, i)$ in a 2D plane. The distance between two points is measured using Manhattan distance.

Practice › Codeforces Solutions › Educational Codeforces Round 111 (Rated for Div. 2) ›

CF 1550E - Stringforces

We are given a string made of lowercase letters from a small alphabet of size $k$, plus wildcard characters that can be replaced freely.

Practice › Codeforces Solutions › Educational Codeforces Round 111 (Rated for Div. 2) ›

CF 1550F - Jumping Around

We are given a sorted set of points on a number line, which we can think of as rocks placed at distinct integer coordinates. A frog starts on one designated rock and can repeatedly jump to other rocks.

Practice › Codeforces Solutions › Educational Codeforces Round 111 (Rated for Div. 2) ›

CF 1550D - Excellent Arrays

We are given an array of length $n$, and each position $i$ must store an integer $ai$ within a fixed interval $[l, r]$. Two constraints define what makes a valid configuration interesting.

Practice › Codeforces Solutions › Educational Codeforces Round 111 (Rated for Div. 2) ›

CF 1550A - Find The Array

We are asked to construct an array of positive integers whose elements sum to a fixed value, while keeping the array as small as possible in length.

Practice › Codeforces Solutions › Educational Codeforces Round 111 (Rated for Div. 2) ›

CF 1550B - Maximum Cost Deletion

We are given a binary string and repeatedly remove substrings that consist of only one character type. Every deletion of a substring of length l gives a l + b points. The string shrinks after each operation because the remaining parts are concatenated together.