Educational Codeforces Round 126 (Rated for Div. 2)

Solutions for Educational Codeforces Round 126 (Rated for Div. 2) (contest 1661). 4/6 problems verified against sample I/O. Difficulty range: 800-2600.

6 items

Educational Codeforces Round 126 (Rated for Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 4/6 | Rating range: 800-2600 | Time: 12m 33s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Array Balancing	800	greedy, math	2m 5s	✓
B	Getting Zero	1300	bitmasks, brute-force, dfs-and-similar	1m 30s	✓
C	Water the Trees	1700	binary-search, greedy, math	3m 55s	✓
D	Progressions Covering	1900	data-structures, greedy	1m 22s	✓
E	Narrow Components	2500	brute-force, data-structures, dp	1m 42s	✗
F	Teleporters	2600	binary-search, greedy	1m 59s	✗

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

CF 1661F - Teleporters

We are given a sorted sequence of points on a number line: starting at position 0, followed by positions $a1, a2, dots, an$, where $an$ is the final destination. These positions act as teleportation stations.

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

CF 1661C - Water the Trees

We are given a set of trees, each with an initial height. Our goal is to make all trees reach the same final height using a daily watering process. On odd-numbered days, watering a tree increases its height by 1, while on even-numbered days, it increases by 2.

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

CF 1661E - Narrow Components

We are given a grid with three rows and n columns, where each cell is either free or blocked. Conceptually, this is a narrow vertical slice of a 2D space, only three cells high, but potentially very wide.

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

CF 1661D - Progressions Covering

We are given an array b of length n, where each element represents a target value we need to reach or exceed in a corresponding array a. Initially, a consists of all zeros.

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

CF 1661A - Array Balancing

At every position i, we have a pair of values (a[i], b[i]). The only operation allowed is swapping the two values inside the same pair. We may do this independently for any positions. After choosing which pairs to swap, we obtain final arrays a and b.

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

CF 1661B - Getting Zero

We are given a list of integers, each less than 32768, and the goal is to reduce each number to zero using two operations: either increment the number by one modulo 32768 or double it modulo 32768. The input specifies the number of integers followed by the integers themselves.