Codeforces Round 514 (Div. 2)

5 problems from Codeforces Round 514 (Div. 2) (contest 1059), difficulty 1000-2400. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 514 (Div. 2)

Div. 2 | 5 problems | 3/5 verified | Difficulty 1000-2400 | 20m 28s

# Problem Rating Tags Accepted Time ✓
A Cashier 1000 implementation 13,810 1m 25s ✓
B Forgery 1300 implementation 7,585 3m 39s ✓
C Sequence Transformation 1600 constructive-algorithms, math 7,533 5m 19s
D Nature Reserve 2200 binary-search, geometry, ternary-search 2,997 4m 38s ✓
E Split the Tree 2400 binary-search, data-structures, dp 1,623 5m 27s
Practice › Codeforces Solutions › Codeforces Round 514 (Div. 2) ›

CF 1059E - Split the Tree

We are given a rooted tree where every vertex contains a positive weight. The task is to partition all vertices into a minimum number of vertical paths.
codeforces competitive-programming binary-search data-structures dp greedy trees Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 514 (Div. 2) ›

CF 1059D - Nature Reserve

We are given a set of points in the plane, each representing an animal’s location. We need to place a circle that covers all these points. At the same time, there is a fixed horizontal river, which after transformation becomes the x-axis, so the line is $y = 0$.
codeforces competitive-programming binary-search geometry ternary-search Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 514 (Div. 2) ›

CF 1059C - Sequence Transformation

We start with a fixed sequence containing the integers from 1 up to n. We repeatedly perform an operation where we look at all remaining elements, compute their greatest common divisor, record that value, and then delete exactly one element of our choice.
codeforces competitive-programming constructive-algorithms math Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 514 (Div. 2) ›

CF 1059B - Forgery

We are given a binary grid representing a target drawing made of ink cells. Each cell is either already filled or empty, and we want to determine whether this final pattern could have been produced from an initially empty grid using a specific stamping tool.
codeforces competitive-programming implementation Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 514 (Div. 2) ›

CF 1059A - Cashier

We are given a workday of fixed length and a sequence of service intervals where a cashier must be continuously present. Between these service intervals, there are gaps of free time.
codeforces competitive-programming implementation Jun 15, 2026