Codeforces Round 586 (Div. 1 + Div. 2)

7 problems from Codeforces Round 586 (Div. 1 + Div. 2) (contest 1220), difficulty 800-3400. 4/7 solutions verified against sample I/O.

7 items

Codeforces Round 586 (Div. 1 + Div. 2)

Div. 1+2 | 7 problems | 4/7 verified | Difficulty 800-3400 | 26m 51s

# Problem Rating Tags Accepted Time ✓
A Cards 800 implementation, sortings, strings 32,791 2m 11s ✓
B Multiplication Table 1300 math, number-theory 12,135 3m 19s ✓
C Substring Game in the Lesson 1300 games, greedy, strings 10,811 1m 34s ✓
D Alex and Julian 1900 bitmasks, math, number-theory 4,140 5m 37s
E Tourism 2200 dfs-and-similar, dp, dsu 3,002 3m 3s ✓
F Gardener Alex 2700 binary-search, data-structures 850 4m 32s
G Geolocation 3400 geometry 74 6m 35s
Practice › Codeforces Solutions › Codeforces Round 586 (Div. 1 + Div. 2) ›

CF 1220G - Geolocation

We are given a fixed set of points in the plane, which we can think of as antennas. For each query, there is an unknown integer point in a bounded grid, and we are told the squared distances from that point to all antennas.
codeforces competitive-programming geometry Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 586 (Div. 1 + Div. 2) ›

CF 1220F - Gardener Alex

We are given a permutation of length $n$. From this permutation, a binary tree is constructed in a deterministic way: the smallest value in a segment becomes the root of that segment, and the remaining elements are split into the left and right subsegments around it.
codeforces competitive-programming binary-search data-structures Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 586 (Div. 1 + Div. 2) ›

CF 1220D - Alex and Julian

We are given a finite set of positive integers, but the structure we build from it is infinite. Every integer is a vertex, and each number in the set is interpreted as a “distance type”.
codeforces competitive-programming bitmasks math number-theory Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 586 (Div. 1 + Div. 2) ›

CF 1220E - Tourism

We are given a connected undirected graph where each vertex represents a city and each city has a fixed value. Alex starts from a specific city and walks through the graph by traversing edges, with one restriction: he is not allowed to immediately traverse back along the same…
codeforces competitive-programming dfs-and-similar dp dsu graphs greedy trees Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 586 (Div. 1 + Div. 2) ›

CF 1220A - Cards

We are given a multiset of letters that originally came from writing several binary words, where each word is either the string "zero" representing digit 0 or "one" representing digit 1.
codeforces competitive-programming implementation sortings strings Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 586 (Div. 1 + Div. 2) ›

CF 1220B - Multiplication Table

We are given an $n times n$ table that was originally generated from some hidden array $a1, a2, dots, an$. Every entry of the table was formed by multiplying two elements of this array, so the cell in row $i$, column $j$ equals $ai cdot aj$.
codeforces competitive-programming math number-theory Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 586 (Div. 1 + Div. 2) ›

CF 1220C - Substring Game in the Lesson

We are given a string s and we need to predict the outcome of a two-player game for each starting position k in the string. The game begins with a substring consisting of a single character at position k.
codeforces competitive-programming games greedy strings Jun 11, 2026