Codeforces Round 706 (Div. 1)

Solutions for Codeforces Round 706 (Div. 1) (contest 1495). 0/6 problems verified against sample I/O. Difficulty range: 1200-3300.

6 items

Codeforces Round 706 (Div. 1)

Type: Div. 1 | Problems: 6 | Verified: 0/6 | Rating range: 1200-3300 | Time: 24m 23s

Problem Name Rating Tags Solve Time Verified
A Diamond Miner 1200 geometry, greedy, math 6m 5s ✗
B Let's Go Hiking 1900 games, greedy 3m 32s ✗
C Garden of the Sun 2300 constructive-algorithms, graphs 5m 29s ✗
D BFS Trees 2600 combinatorics, dfs-and-similar, graphs 1m 16s ✗
E Qingshan and Daniel 3200 brute-force, data-structures, greedy 5m 15s ✗
F Squares 3300 constructive-algorithms, data-structures, dp 2m 46s ✗
Practice › Codeforces Solutions › Codeforces Round 706 (Div. 1) ›

CF 1495E - Qingshan and Daniel

We are simulating a deterministic process on a circle of n robots. Each robot belongs to one of two teams and starts with some number of “actions” (cards).
codeforces competitive-programming brute-force data-structures greedy implementation Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 706 (Div. 1) ›

CF 1495F - Squares

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 constructive-algorithms data-structures dp graphs trees Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 706 (Div. 1) ›

CF 1495A - Diamond Miner

We are given two sets of points in a plane. One set contains miners, and all of them lie strictly on the vertical axis, so each miner has coordinates of the form $(0, y)$.
codeforces competitive-programming geometry greedy math sortings Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 706 (Div. 1) ›

CF 1495C - Garden of the Sun

We are given a grid where some cells already contain 'X' and the remaining cells contain '.'. The original story describes lightning destroying sunflowers. From the graph perspective, the cells marked 'X' are already selected vertices. We are allowed to change any '.
codeforces competitive-programming constructive-algorithms graphs Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 706 (Div. 1) ›

CF 1495D - BFS Trees

We are asked to count, for every pair of vertices $i, j$ in an undirected connected graph, the number of spanning trees that simultaneously behave as BFS trees rooted at both $i$ and $j$. A BFS tree rooted at $s$ preserves the shortest distances from $s$ to every other vertex.
codeforces competitive-programming combinatorics dfs-and-similar graphs math shortest-paths trees Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 706 (Div. 1) ›

CF 1495B - Let's Go Hiking

We are given a permutation laid out on a line of positions. Two players control two markers, one starting from an index chosen by Qingshan and the other chosen by Daniel after seeing the first choice.
codeforces competitive-programming games greedy Jun 10, 2026