Educational Codeforces Round 97 (Rated for Div. 2)

7 problems from Educational Codeforces Round 97 (Rated for Div. 2) (contest 1437), difficulty 800-2600. 4/7 solutions verified against sample I/O.

7 items

Educational Codeforces Round 97 (Rated for Div. 2)

Div. 2 | 7 problems | 4/7 verified | Difficulty 800-2600 | 24m 5s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Marketing Scheme	800	brute-force, constructive-algorithms, greedy	18,462	4m 2s	✓
B	Reverse Binary Strings	1200	constructive-algorithms, greedy	20,848	4m 32s
C	Chef Monocarp	1800	dp, flows, graph-matchings	12,181	1m 37s	✓
D	Minimal Height Tree	1600	graphs, greedy, shortest-paths	14,361	1m 12s	✓
E	Make It Increasing	2200	binary-search, constructive-algorithms, data-structures	3,925	1m 45s	✓
F	Emotional Fishermen	2600	combinatorics, dp, math	1,608	7m 17s
G	Death DBMS	2600	data-structures, string-suffix-structures, strings	1,260	3m 40s

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

CF 1437F - Emotional Fishermen

We are given a multiset of positive integers representing fish weights. We must arrange these values in a permutation, then reveal them one by one. As the sequence unfolds, each revealed value is compared against the maximum value seen so far.

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

CF 1437G - Death DBMS

We maintain a fixed collection of strings, each representing a “name”, and each name has an associated value that changes over time.

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

CF 1437B - Reverse Binary Strings

We are given a binary string where zeros and ones appear in equal quantity, and the length is even. The target configuration is not arbitrary: we want the string to become perfectly alternating, meaning every adjacent pair of characters must differ.

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

CF 1437A - Marketing Scheme

We are choosing a single pack size a for selling cat food cans. Every customer initially wants to buy some number x within a fixed range [l, r].

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

CF 1437E - Make It Increasing

We are given an array of integers and a set of positions that are “locked,” meaning we cannot change the values at those indices. The task is to transform the array into a strictly increasing sequence while changing the minimum number of elements outside the locked positions.

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

CF 1437D - Minimal Height Tree

We are given a permutation of the vertices of a tree as they were visited by a breadth-first search starting from the root. The root is always vertex 1, and all children of a vertex are visited in increasing order.

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

CF 1437C - Chef Monocarp

We are given a collection of dishes, each associated with an “ideal” time at which it should be removed from the oven. Time in this problem is discrete and increases one minute at a time.