Educational Codeforces Round 130 (Rated for Div. 2)

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

6 items

Educational Codeforces Round 130 (Rated for Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 3/6 | Rating range: 800-2800 | Time: 18m 56s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Parkway Walk	800	greedy, implementation	2m 6s	✓
B	Promo	900	greedy, sortings	2m 6s	✓
C	awoo's Favorite Problem	1400	binary-search, constructive-algorithms, data-structures	7m 21s	✓
D	Guess The String	1900	binary-search, constructive-algorithms, interactive	2m 11s	✗
E	Coloring	2400	brute-force, combinatorics, constructive-algorithms	2m 47s	✗
F	Too Many Constraints	2800	2-sat, constructive-algorithms, graphs	2m 25s	✗

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

CF 1697C - awoo's Favorite Problem

The problem gives two strings s and t of the same length consisting of the characters 'a', 'b', and 'c'. The allowed operations let us swap adjacent "ab" to "ba" and "bc" to "cb". The task is to determine whether we can transform s into t using any number of these moves.

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

CF 1697F - Too Many Constraints

We are asked to construct a sequence of integers of length n, where each element lies between 1 and k, and the sequence must be non-decreasing. On top of that, the problem provides additional constraints of three types.

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

CF 1697E - Coloring

We are given a set of points on a 2D plane with unique coordinates. Each point must be assigned a color represented by an integer from 1 to $n$, and the coloring must satisfy two distance-based constraints.

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

CF 1697D - Guess The String

We are trying to reconstruct an unknown string of length $n$, where each position contains a lowercase letter. The only way to interact with this hidden string is through two operations: we can directly reveal the character at a chosen position, or we can query a segment and…

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

CF 1697A - Parkway Walk

We are given a linear sequence of benches, numbered from one to $n+1$, separated by distances $a1, a2, dots, an$. You start at the first bench with a fixed amount of energy $m$. Walking a distance of one meter consumes exactly one unit of energy.

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

CF 1697B - Promo

We have a store with n items, each with a specific price. The store runs a promotion where, if a customer buys at least x items, the y cheapest among those items are free. For each query (x, y), we want to determine the maximum total value of items a customer can get for free.