Educational Codeforces Round 69 (Rated for Div. 2)

Solutions for Educational Codeforces Round 69 (Rated for Div. 2) (contest 1197). 3/6 problems verified against sample I/O. Difficulty range: 900-2700.

6 items

Educational Codeforces Round 69 (Rated for Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 3/6 | Rating range: 900-2700 | Time: 29m 56s

Problem	Name	Rating	Tags	Solve Time	Verified
A	DIY Wooden Ladder	900	greedy, math, sortings	5m 53s	✓
B	Pillars	1000	greedy, implementation	4m 34s	✓
C	Array Splitting	1400	greedy, sortings	1m 27s	✓
D	Yet Another Subarray Problem	1900	dp, greedy, math	4m 28s	✗
E	Culture Code	2300	binary-search, combinatorics, data-structures	7m 53s	✗
F	Coloring Game	2700	dp, games, matrices	5m 41s	✗

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

CF 1197E - Culture Code

We are given a collection of matryoshka dolls. Each doll has two parameters: an outer volume and an inner empty volume. A doll can be placed inside another if the outer volume of the inner doll does not exceed the inner volume of the outer doll.

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

CF 1197F - Coloring Game

Each strip can be viewed as a line of positions, and each position holds a chip. A chip starts at the rightmost cell of its strip, and players alternately move exactly one chip per turn, pushing it left by 1, 2, or 3 positions, as long as the move stays inside the strip and is…

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

CF 1197A - DIY Wooden Ladder

We are given several independent sets of wooden planks, where each plank has a fixed length and cannot be cut. From each set, we want to assemble a structure called a ladder with as many steps as possible. A k-step ladder is formed by selecting exactly k + 2 planks.

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

CF 1197B - Pillars

We are given a row of pillars, each initially holding exactly one disk. Each disk has a distinct radius, so we can think of the input as a permutation of values from 1 to n placed on positions 1 through n. The only allowed move is very restrictive.

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

CF 1197D - Yet Another Subarray Problem

We are given a sequence of numbers and asked to pick one contiguous segment, or skip picking anything at all, in order to maximize a specific score function. The score of a chosen segment is its plain sum minus a penalty that depends only on its length.

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

CF 1197C - Array Splitting

We are given a non-decreasing array and asked to split it into exactly $k$ contiguous parts. Each part contributes a cost equal to the difference between its largest and smallest element, and since the array is sorted, this is simply the difference between its last and first…