Codeforces Round 535 (Div. 3)

Solutions for Codeforces Round 535 (Div. 3) (contest 1108). 3/7 problems verified against sample I/O. Difficulty range: 800-2100.

7 items

Codeforces Round 535 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 3/7 | Rating range: 800-2100 | Time: 17m 24s

Problem Name Rating Tags Solve Time Verified
A Two distinct points 800 implementation 1m 41s ✗
B Divisors of Two Integers 1100 brute-force, greedy, math 1m 13s ✓
C Nice Garland 1300 brute-force, greedy, math 7m 4s ✗
D Diverse Garland 1400 constructive-algorithms, dp, greedy 1m 23s ✓
E1 Array and Segments (Easy version) 1800 brute-force, greedy, implementation 2m 50s ✗
E2 Array and Segments (Hard version) 2100 data-structures, implementation 2m 28s ✗
F MST Unification 2100 binary-search, dsu, graphs 45s ✓
Practice › Codeforces Solutions › Codeforces Round 535 (Div. 3) ›

CF 1108C - Nice Garland

We are given a line of lamps, each painted in one of three colors: R, G, or B. We are allowed to repaint any lamp to any other color.
codeforces competitive-programming brute-force greedy math Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 535 (Div. 3) ›

CF 1108F - MST Unification

We are given a connected undirected graph with n vertices and m edges, each with a positive weight. The goal is to adjust some edge weights by incrementing them, so that the graph's minimum spanning tree (MST) remains the same cost as initially but becomes unique.
codeforces competitive-programming binary-search dsu graphs greedy Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 535 (Div. 3) ›

CF 1108E2 - Array and Segments (Hard version)

We are given an array of integers and a collection of segments, each defined by a start and end index. Each segment can be applied at most once to decrease all values in that segment by one.
codeforces competitive-programming data-structures implementation Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 535 (Div. 3) ›

CF 1108E1 - Array and Segments (Easy version)

We are given an integer array and a collection of intervals over its indices. Each interval represents an operation: if we select it, every position inside that range is decreased by exactly one.
codeforces competitive-programming brute-force greedy implementation Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 535 (Div. 3) ›

CF 1108D - Diverse Garland

We are given a linear sequence of lamps, each painted either red, green, or blue. The task is to change as few of them as possible so that no two consecutive lamps have the same color.
codeforces competitive-programming constructive-algorithms dp greedy Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 535 (Div. 3) ›

CF 1108A - Two distinct points

We are given two line segments on the number line, each defined by its endpoints. For each query, we need to pick one integer point from the first segment and one integer point from the second segment such that the points are different.
codeforces competitive-programming implementation Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 535 (Div. 3) ›

CF 1108B - Divisors of Two Integers

We are given a shuffled list of integers, each representing a divisor of one of two unknown positive integers, which we can call x and y. If a number divides both x and y, it appears twice in the list. Our task is to reconstruct any pair (x, y) that could have produced this list.
codeforces competitive-programming brute-force greedy math number-theory Jun 12, 2026