Codeforces Round 703 (Div. 2)

Solutions for Codeforces Round 703 (Div. 2) (contest 1486). 2/7 problems verified against sample I/O. Difficulty range: 900-2600.

7 items

Codeforces Round 703 (Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 2/7 | Rating range: 900-2600 | Time: 19m 2s

Problem Name Rating Tags Solve Time Verified
A Shifting Stacks 900 greedy, implementation 1m 53s ✓
B Eastern Exhibition 1500 binary-search, geometry, shortest-paths 1m 53s ✓
C1 Guessing the Greatest (easy version) 1600 binary-search, interactive 3m 1s ✗
C2 Guessing the Greatest (hard version) 1900 binary-search, interactive 2m 52s ✗
D Max Median 2100 binary-search, data-structures, dp 3m 6s ✗
E Paired Payment 2200 binary-search, brute-force, constructive-algorithms 3m 5s ✗
F Pairs of Paths 2600 combinatorics, data-structures, dfs-and-similar 3m 12s ✗
Practice › Codeforces Solutions › Codeforces Round 703 (Div. 2) ›

CF 1486F - Pairs of Paths

We are given a tree with n vertices, meaning a connected graph with n-1 edges and no cycles. Along with the tree, we are given m paths, each specified by its two endpoints u and v.
codeforces competitive-programming combinatorics data-structures dfs-and-similar dp trees Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 703 (Div. 2) ›

CF 1486E - Paired Payment

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.
codeforces competitive-programming binary-search brute-force constructive-algorithms dp flows graphs shortest-paths Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 703 (Div. 2) ›

CF 1486D - Max Median

We are asked to find the largest possible median among all contiguous subarrays of a given array with length at least $k$.
codeforces competitive-programming binary-search data-structures dp Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 703 (Div. 2) ›

CF 1486C2 - Guessing the Greatest (hard version)

We are given a hidden array of distinct values, and we can only interact with it through queries. Each query asks for a subsegment and returns the position of the second largest value inside that subsegment (but the index is reported in the original array).
codeforces competitive-programming binary-search interactive Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 703 (Div. 2) ›

CF 1486C1 - Guessing the Greatest (easy version)

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.
codeforces competitive-programming binary-search interactive Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 703 (Div. 2) ›

CF 1486A - Shifting Stacks

We are given a sequence of stacks, each with some number of blocks. The task is to decide if we can redistribute blocks, moving them only to the right, to make the stack heights strictly increasing.
codeforces competitive-programming greedy implementation Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 703 (Div. 2) ›

CF 1486B - Eastern Exhibition

We are given several independent test cases. In each test case there is a set of points on a 2D grid, representing houses.
codeforces competitive-programming binary-search geometry shortest-paths sortings Jun 10, 2026