Codeforces Round 1064 (Div. 1)

6 problems from Codeforces Round 1064 (Div. 1) (contest 2165), difficulty 1300-3500. 1/6 solutions verified against sample I/O.

6 items

Codeforces Round 1064 (Div. 1)

Div. 1 | 6 problems | 1/6 verified | Difficulty 1300-3500 | 13m 2s

# Problem Rating Tags Accepted Time ✓
A Cyclic Merging 1300 constructive-algorithms, greedy 14,097 1m 25s ✓
B Marble Council 1900 dp, math, sortings 4,531 1m 55s
C Binary Wine 2000 bitmasks, greedy, math 3,515 3m 42s
D Path Split 2500 graph-matchings, greedy 896 1m 38s
E Rainbow Branch 3200 constructive-algorithms, dp, greedy 255 1m 40s
F Arctic Acquisition 3500 data-structures, greedy 194 2m 42s
Practice › Codeforces Solutions › Codeforces Round 1064 (Div. 1) ›

CF 2165F - Arctic Acquisition

We are given a permutation of length $n$, which is an array of distinct integers from 1 to $n$ arranged in some order. The task is to count the number of contiguous subarrays (intervals) that contain a specific pattern, called a 21435-subsequence.
codeforces competitive-programming data-structures greedy Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 1064 (Div. 1) ›

CF 2165C - Binary Wine

We are given an array of integers, and each element acts like a cap: for each position $i$, we are allowed to choose a value $bi$ anywhere between $0$ and $ai$, inclusive. From this chosen vector $b$, we look at the XOR of all its elements.
codeforces competitive-programming bitmasks greedy math Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 1064 (Div. 1) ›

CF 2165E - Rainbow Branch

We are given a tree and we need to assign colors to its edges. The restriction is that we must use exactly $k$ distinct colors, each appearing at least once. Once the coloring is fixed, consider any two vertices and look at the simple path between them.
codeforces competitive-programming constructive-algorithms dp greedy trees Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 1064 (Div. 1) ›

CF 2165D - Path Split

We are given a sequence of integers. Our goal is to split this sequence into the smallest number of subsequences where each subsequence is “consecutive in value.” That is, within a subsequence, every adjacent pair differs by exactly one.
codeforces competitive-programming graph-matchings greedy Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 1064 (Div. 1) ›

CF 2165B - Marble Council

We are given a multiset of integers, which we can think of as a bag of marbles where each marble has a color represented by a number.
codeforces competitive-programming dp math sortings Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 1064 (Div. 1) ›

CF 2165A - Cyclic Merging

We are asked to merge elements arranged in a circle. Each element is a non-negative integer, and two elements are considered adjacent if they are next to each other in the array or if one is at the start and the other at the end.
codeforces competitive-programming constructive-algorithms greedy Jun 7, 2026