Educational Codeforces Round 158 (Rated for Div. 2)

Solutions for Educational Codeforces Round 158 (Rated for Div. 2) (contest 1901). 2/6 problems verified against sample I/O. Difficulty range: 800-2900.

6 items

Educational Codeforces Round 158 (Rated for Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 800-2900 | Time: 14m 6s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Line Trip	800	greedy, math	1m 45s	✗
B	Chip and Ribbon	1100	greedy, math	2m 1s	✓
C	Add, Divide and Floor	1400	constructive-algorithms, greedy, math	2m 14s	✗
D	Yet Another Monster Fight	1700	binary-search, dp, greedy	2m 14s	✗
E	Compressed Tree	2200	dfs-and-similar, dp, graphs	3m 51s	✓
F	Landscaping	2900	binary-search, geometry, two-pointers	2m 1s	✗

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

CF 1901E - Compressed Tree

We are given a tree with n vertices, each labeled with an integer. The operations allowed let us remove leaf vertices (vertices with at most one edge) any number of times.

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

CF 1901F - Landscaping

We are given a road represented as a sequence of points along the x-axis, starting at (0,0) and ending at (n-1,0). Each point has a height above the x-axis, initially given by array a.

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

CF 1901D - Yet Another Monster Fight

We are asked to determine the minimum initial power $x$ of a chain lightning spell that can defeat a row of monsters no matter how the spell propagates, provided we choose the first monster to hit optimally.

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

CF 1901C - Add, Divide and Floor

We are given an array of non-negative integers. In a single operation, we can choose a number $x$ and add it to each element, then divide each element by 2, rounding down. This affects all elements simultaneously.

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

CF 1901B - Chip and Ribbon

We are asked to simulate a chip moving along a ribbon of cells, where each cell initially contains zero. On the first turn, the chip starts at the first cell, and on every subsequent turn, we can either move it to the next cell or teleport it to any cell.

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

CF 1901A - Line Trip

We are moving along a straight road from position 0 to position x and then returning back to 0. The car consumes fuel proportional to distance, one unit of fuel per unit of distance.