Educational Codeforces Round 152 (Rated for Div. 2)

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

6 items

Educational Codeforces Round 152 (Rated for Div. 2)

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

Problem	Name	Rating	Tags	Solve Time	Verified
A	Morning Sandwich	800	implementation, math	1m 2s	✓
B	Monsters	1000	greedy, math, sortings	1m 36s	✗
C	Binary String Copying	1600	binary-search, brute-force, data-structures	1m 31s	✓
D	Array Painting	1700	constructive-algorithms, greedy, two-pointers	2m 58s	✗
E	Max to the Right of Min	2300	binary-search, data-structures, divide-and-conquer	1m 2s	✓
F	XOR Partition	2700	binary-search, bitmasks, data-structures	1m 31s	✗

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

CF 1849D - Array Painting

We are given a line of cells, each containing a value 0, 1, or 2. Every cell starts unpainted, and the goal is to paint all cells. We are allowed to spend coins in two different ways. The first is direct painting: we can pick any unpainted cell, paint it, and pay one coin.

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

CF 1849F - XOR Partition

We are given a set of distinct integers and we need to split them into two subsets such that the minimum XOR among all pairs in each subset is as large as possible. The value of a partition is the smaller of the two subset costs. Each element must belong to exactly one subset.

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

CF 1849E - Max to the Right of Min

We are given a permutation of length $n$, which means we have a sequence containing every integer from $1$ to $n$ exactly once.

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

CF 1849B - Monsters

The problem describes a scenario where Monocarp fights a group of monsters, each with an initial health value. Monocarp can repeatedly hit the monster with the highest current health, reducing it by a fixed amount $k$ per attack.

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

CF 1849C - Binary String Copying

We are asked to analyze the effect of sorting substrings on multiple copies of a binary string. Each test case gives us a string consisting of zeros and ones, and a set of operations, one per copy.

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

CF 1849A - Morning Sandwich

Monocarp wants to make the tallest sandwich possible given a certain number of bread slices, cheese slices, and ham slices. A valid sandwich must always start and end with a piece of bread, and the layers alternate between bread and filling (either cheese or ham).