Codeforces Round 865 (Div. 2)

Solutions for Codeforces Round 865 (Div. 2) (contest 1816). 0/2 problems verified against sample I/O. Difficulty range: 800-1000.

2 items

Codeforces Round 865 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 0/2 | Rating range: 800-1000 | Time: 3m 17s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Ian Visits Mary	800	constructive-algorithms, geometry, number-theory	1m 19s	✗
B	Grid Reconstruction	1000	constructive-algorithms, greedy	1m 58s	✗

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

CF 1816B - Grid Reconstruction

We are asked to fill a $2 times n$ grid with the numbers $1$ through $2n$, each exactly once, in a way that maximizes the minimum alternating sum along any path from the top-left corner $(1, 1)$ to the bottom-right corner $(2, n)$.

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

CF 1816A - Ian Visits Mary

We start with a frog sitting at the origin of the integer grid and a target point at coordinates $(a,b)$. The frog can perform jumps between lattice points, but each jump must be “clean” in the sense that the straight segment between the starting and ending points cannot…