Codeforces Round 516 (Div. 1, by Moscow Team Olympiad)

6 problems from Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) (contest 1063), difficulty 1300-3300. 2/6 solutions verified against sample I/O.

6 items

Codeforces Round 516 (Div. 1, by Moscow Team Olympiad)

Div. 1 | 6 problems | 2/6 verified | Difficulty 1300-3300 | 25m 19s

# Problem Rating Tags Accepted Time ✓
A Oh Those Palindromes 1300 constructive-algorithms, strings 11,056 2m 42s ✓
B Labyrinth 1800 graphs, shortest-paths 9,230 2m 18s ✓
C Dwarves, Hats and Extrasensory Abilities 1900 binary-search, constructive-algorithms, geometry 3,280 3m 24s
D Candies for Children 2600 brute-force, math 472 5m 59s
E Lasers and Mirrors 3000 constructive-algorithms, math 402 5m 33s
F String Journey 3300 data-structures, dp, string-suffix-structures 1,009 5m 23s
Practice › Codeforces Solutions › Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) ›

CF 1063F - String Journey

We are given a single string and we want to decompose it into a sequence of progressively shorter substrings, where each substring in the sequence must appear inside the previous one.
codeforces competitive-programming data-structures dp string-suffix-structures Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) ›

CF 1063D - Candies for Children

We are simulating a deterministic passing process on a circular arrangement of $n$ children. A box starts at position $l$ and is passed clockwise.
codeforces competitive-programming brute-force math Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) ›

CF 1063E - Lasers and Mirrors

The maze is an $n times n$ grid where each cell can either be empty or contain a fixed type of mirror that behaves like a 45-degree reflector. A laser starts from each column on the southern boundary and travels northward into the grid.
codeforces competitive-programming constructive-algorithms math Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) ›

CF 1063C - Dwarves, Hats and Extrasensory Abilities

We are interacting with an unknown assignment of colors to points, where the opponent can choose each point’s color after seeing where we place it. We must output a sequence of distinct integer-coordinate points.
codeforces competitive-programming binary-search constructive-algorithms geometry interactive Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) ›

CF 1063A - Oh Those Palindromes

We are given a multiset of lowercase letters. We are allowed to rearrange these letters into any order we want, forming a new string of the same length. For any resulting string, we look at every contiguous substring and check whether it is a palindrome.
codeforces competitive-programming constructive-algorithms strings Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) ›

CF 1063B - Labyrinth

The task places us on a grid maze where each cell is either open or blocked. We start from a given cell and can move in the four cardinal directions as long as we stay inside the grid and avoid obstacles.
codeforces competitive-programming graphs shortest-paths Jun 15, 2026