Educational Codeforces Round 150 (Rated for Div. 2)

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

6 items

Educational Codeforces Round 150 (Rated for Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 3/6 | Rating range: 800-2700 | Time: 11m 57s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Game with Board	800	constructive-algorithms, games	1m 4s	✓
B	Keep it Beautiful	1000	implementation	1m 46s	✓
C	Ranom Numbers	1800	brute-force, dp, greedy	4m 37s	✗
D	Pairs of Segments	2000	data-structures, greedy, sortings	1m 48s	✗
E	Fill the Matrix	2200	data-structures, greedy, math	1m 25s	✓
F	Monocarp and a Strategic Game	2700	geometry, sortings, two-pointers	1m 17s	✗

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

CF 1841C - Ranom Numbers

You pick an index i, remove c[i], and replace the pair (c[i-1], c[i+1]) by their sum. So locally: This is not a “subarray optimization” problem. It is a tree of merges problem: - Every element can repeatedly get absorbed into neighbors.

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

CF 1841F - Monocarp and a Strategic Game

We are asked to simulate a strategic city-building game where Monocarp can accept or reject groups of creatures arriving in his city. Each group contains a certain number of humans, orcs, elves, and dwarves.

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

CF 1841E - Fill the Matrix

Each column of the matrix contains a black prefix and a white suffix. In column i, rows 1..ai are blocked, while rows ai+1..n are available. We must place the integers 1,2,...,m into distinct white cells.

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

CF 1841D - Pairs of Segments

We are given an array of segments, each represented by two integers marking its left and right endpoints. The task is to remove as few segments as possible so that the remaining segments can be paired up in such a way that within each pair, the segments overlap, and segments…

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

CF 1841B - Keep it Beautiful

We start with an empty array and receive numbers one by one. For each incoming value x, we must decide whether appending it to the current array keeps the array "beautiful". If it does, we permanently append it. Otherwise we ignore it.

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

CF 1841A - Game with Board

We start with a multiset of numbers where all values are identical and equal to one, and the size of this multiset is given by $n$. Two players alternate turns, with Alice moving first.