Codeforces Round 975 (Div. 2)

Solutions for Codeforces Round 975 (Div. 2) (contest 2019). 1/6 problems verified against sample I/O. Difficulty range: 800-2200.

6 items

Codeforces Round 975 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 1/6 | Rating range: 800-2200 | Time: 18m 26s

Problem Name Rating Tags Solve Time Verified
A Max Plus Size 800 brute-force, dp, greedy 1m 18s ✓
B All Pairs Segments 1200 implementation, math 1m 52s ✗
C Cards Partition 1600 greedy, implementation, math 7m 8s ✗
D Speedbreaker 1900 binary-search, constructive-algorithms, data-structures 1m 43s ✗
E Tree Pruning 1700 constructive-algorithms, dfs-and-similar, dp 4m 37s ✗
F Max Plus Min Plus Size 2200 data-structures, dp, dsu 1m 48s ✗
Practice › Codeforces Solutions › Codeforces Round 975 (Div. 2) ›

CF 2019C - Cards Partition

We are given a collection of cards, where each card has an integer written on it. For each number from 1 to $n$, we know exactly how many cards of that type we initially possess. In addition, we have $k$ coins, and each coin allows us to buy a card of any type we choose.
codeforces competitive-programming greedy implementation math Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 975 (Div. 2) ›

CF 2019E - Tree Pruning

We are given a sorted list of integer coordinates on a line. From every pair of these points, we draw a closed segment, meaning every integer point between the endpoints is included in that segment.
codeforces competitive-programming constructive-algorithms dfs-and-similar dp sortings trees Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 975 (Div. 2) ›

CF 2019F - Max Plus Min Plus Size

We are given an array of positive integers, and we are allowed to mark some of them as "red" under the constraint that no two adjacent elements can both be red.
codeforces competitive-programming data-structures dp dsu greedy sortings Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 975 (Div. 2) ›

CF 2019D - Speedbreaker

We have a row of $n$ cities, each with a deadline $ai$. You pick one city to start conquering at time 1, and each subsequent time step you expand to an adjacent unconquered city. The goal is to conquer every city $i$ at or before time $ai$.
codeforces competitive-programming binary-search constructive-algorithms data-structures greedy math Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 975 (Div. 2) ›

CF 2019B - All Pairs Segments

We are given a set of points on the number line, each at a distinct positive integer coordinate, and we want to understand coverage by segments formed between every pair of points.
codeforces competitive-programming implementation math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 975 (Div. 2) ›

CF 2019A - Max Plus Size

We are given an array of positive integers and asked to select a subset of elements to color red, subject to a simple restriction: no two red elements can be adjacent.
codeforces competitive-programming brute-force dp greedy Jun 8, 2026