Mail.Ru Cup 2018 Round 3

8 problems from Mail.Ru Cup 2018 Round 3 (contest 1056), difficulty 800-3200. 7/8 solutions verified against sample I/O.

8 items

Mail.Ru Cup 2018 Round 3

Special | 8 problems | 7/8 verified | Difficulty 800-3200 | 29m 37s

# Problem Rating Tags Accepted Time ✓
A Determine Line 800 implementation 7,307 3m 25s ✓
B Divide Candies 1600 math, number-theory 4,546 6m 37s ✓
C Pick Heroes 1700 greedy, implementation, interactive 2,579 5m
D Decorate Apple Tree 1600 constructive-algorithms, dfs-and-similar, dp 6,719 2m 24s ✓
E Check Transcription 2100 brute-force, data-structures, hashing 2,812 2m 32s ✓
F Write The Contest 2500 binary-search, dp, math 703 4m 4s ✓
G Take Metro 2900 brute-force, data-structures, graphs 300 2m 57s ✓
H Detect Robots 3200 data-structures, strings 253 2m 38s ✓
Practice › Codeforces Solutions › Mail.Ru Cup 2018 Round 3 ›

CF 1056C - Pick Heroes

Two players are building two equally sized teams by alternately taking heroes from a common pool of $2n$ candidates. Each hero has a fixed strength, and once taken it disappears from the game.
codeforces competitive-programming greedy implementation interactive sortings Jun 15, 2026
Practice › Codeforces Solutions › Mail.Ru Cup 2018 Round 3 ›

CF 1056F - Write The Contest

The problem describes a scheduling process where each task depends heavily on a continuously changing “skill level”. You are given several problems, each with a difficulty value and a reward.
codeforces competitive-programming binary-search dp math Jun 15, 2026
Practice › Codeforces Solutions › Mail.Ru Cup 2018 Round 3 ›

CF 1056G - Take Metro

We are given a circular metro line with stations numbered from 1 to n. Moving along the circle is always possible in both directions, so from any station we can go clockwise or counter-clockwise with wrap-around.
codeforces competitive-programming brute-force data-structures graphs Jun 15, 2026
Practice › Codeforces Solutions › Mail.Ru Cup 2018 Round 3 ›

CF 1056H - Detect Robots

The city is a graph where crossroads are vertices and roads are undirected edges. Each ride is a simple path in this graph, meaning the driver never revisits a vertex within that ride. Across all rides, we observe many such simple paths.
codeforces competitive-programming data-structures strings Jun 15, 2026
Practice › Codeforces Solutions › Mail.Ru Cup 2018 Round 3 ›

CF 1056B - Divide Candies

Each cell in an $n times n$ grid defines a number of candies equal to $i^2 + j^2$, where $i$ and $j$ are the row and column indices. For every cell, we imagine taking that many identical candies and trying to split them evenly among $m$ friends.
codeforces competitive-programming math number-theory Jun 15, 2026
Practice › Codeforces Solutions › Mail.Ru Cup 2018 Round 3 ›

CF 1056D - Decorate Apple Tree

We are given a rooted tree, with node 1 fixed as the root. Only leaf nodes initially receive colors, and all other nodes are uncolored. A leaf, in this problem, is defined as a node whose subtree consists of only itself, which in a rooted tree means a node with no children.
codeforces competitive-programming constructive-algorithms dfs-and-similar dp graphs greedy sortings trees Jun 15, 2026
Practice › Codeforces Solutions › Mail.Ru Cup 2018 Round 3 ›

CF 1056E - Check Transcription

We are given a binary template string s, where each character is either 0 or 1, and a target string t consisting of lowercase letters.
codeforces competitive-programming brute-force data-structures hashing strings Jun 15, 2026
Practice › Codeforces Solutions › Mail.Ru Cup 2018 Round 3 ›

CF 1056A - Determine Line

We are given a sequence of moments during a tram ride, where each moment corresponds to a stop where Arkady briefly observed which tram lines serve that stop. Each stop lists a set of line identifiers, and Arkady remembers the full set at every observed stop.
codeforces competitive-programming implementation Jun 15, 2026