Codeforces Round 802 (Div. 2)

Solutions for Codeforces Round 802 (Div. 2) (contest 1700). 0/6 problems verified against sample I/O. Difficulty range: 800-2600.

6 items

Codeforces Round 802 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 0/6 | Rating range: 800-2600 | Time: 20m 20s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Optimal Path	800	constructive-algorithms, greedy, math	2m 37s	✗
B	Palindromic Numbers	1100	constructive-algorithms, implementation, math	2m 31s	✗
C	Helping the Nature	1700	constructive-algorithms, data-structures, greedy	2m 24s	✗
D	River Locks	1900	binary-search, dp, greedy	2m 59s	✗
E	Serega the Pirate	2600	brute-force, constructive-algorithms	7m 12s	✗
F	Puzzle	2600	constructive-algorithms, dp, greedy	2m 37s	✗

Practice › Codeforces Solutions › Codeforces Round 802 (Div. 2) ›

CF 1700E - Serega the Pirate

The puzzle is represented as an $n times m$ grid containing each integer from $1$ to $n cdot m$ exactly once. A sequence solves the puzzle if, when following a path of adjacent cells, the first time each number is visited respects the natural order $1, 2, dots, n cdot m$.

Practice › Codeforces Solutions › Codeforces Round 802 (Div. 2) ›

CF 1700D - River Locks

The system is a chain of containers, each with a fixed capacity. Water enters a selected subset of these containers at a constant rate of one unit per second per opened pipe.

Practice › Codeforces Solutions › Codeforces Round 802 (Div. 2) ›

CF 1700F - Puzzle

We are given two binary grids, each with exactly two rows and $n$ columns. Every cell contains either a zero or a one. The grid starts in an initial configuration and must be transformed into a target configuration.

Practice › Codeforces Solutions › Codeforces Round 802 (Div. 2) ›

CF 1700A - Optimal Path

We are asked to find the minimal cost for a turtle to travel from the top-left corner of a table to the bottom-right corner. The table has (n) rows and (m) columns, and each cell contains the number ((i-1) cdot m + j), where (i) and (j) are the row and column indices.

Practice › Codeforces Solutions › Codeforces Round 802 (Div. 2) ›

CF 1700B - Palindromic Numbers

The proposed solution is for a Codeforces problem about counting “beautiful triples” in a dynamic set of points. However, the exercise cited, 3.4.1.

Practice › Codeforces Solutions › Codeforces Round 802 (Div. 2) ›

CF 1700C - Helping the Nature

We have an array of integers representing soil moisture levels along a path of trees. Each value can be positive, negative, or zero, and our goal is to reduce all values to zero using three operations: decrease a prefix by one, decrease a suffix by one, or increase the entire…