Codeforces Round 715 (Div. 1)

Solutions for Codeforces Round 715 (Div. 1) (contest 1508). 0/6 problems verified against sample I/O. Difficulty range: 1800-3500.

6 items

Codeforces Round 715 (Div. 1)

Type: Div. 1 | Problems: 6 | Verified: 0/6 | Rating range: 1800-3500 | Time: 31m 57s

Problem Name Rating Tags Solve Time Verified
A Binary Literature 1900 constructive-algorithms, greedy, implementation 3m 44s ✗
B Almost Sorted 1800 binary-search, combinatorics, constructive-algorithms 14m 44s ✗
C Complete the MST 2500 bitmasks, brute-force, data-structures 2m 41s ✗
D Swap Pass 3000 constructive-algorithms, geometry, sortings 3m 42s ✗
E Tree Calendar 3100 brute-force, constructive-algorithms, data-structures 2m 19s ✗
F Optimal Encoding 3500 brute-force, data-structures 4m 47s ✗
Practice › Codeforces Solutions › Codeforces Round 715 (Div. 1) ›

CF 1508B - Almost Sorted

We are asked to construct the $k$-th permutation of the numbers $1$ through $n$ that satisfies a specific adjacency property: each number can decrease by at most one relative to its predecessor.
codeforces competitive-programming binary-search combinatorics constructive-algorithms implementation Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 715 (Div. 1) ›

CF 1508F - Optimal Encoding

We are given a permutation of numbers from 1 to $n$, which we can think of as a sequence of distinct integers. Along with this permutation, we are given $q$ intervals $[li, ri]$.
codeforces competitive-programming brute-force data-structures Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 715 (Div. 1) ›

CF 1508D - Swap Pass

We are given $n$ points on the plane, each with a unique label between 1 and $n$. Initially, the labels are scrambled, forming a permutation of the integers 1 through $n$. Our task is to restore the labels so that each point $i$ ends up with label $i$.
codeforces competitive-programming constructive-algorithms geometry sortings Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 715 (Div. 1) ›

CF 1508E - Tree Calendar

We are given a rooted directed tree. Every edge points from a parent to a child. Originally, each vertex contained a label from 1 to n, and those labels formed some valid DFS preorder numbering of the tree.
codeforces competitive-programming brute-force constructive-algorithms data-structures dfs-and-similar sortings trees Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 715 (Div. 1) ›

CF 1508A - Binary Literature

We are given three distinct bitstrings, each of length $2n$, and we need to construct a new bitstring of length at most $3n$ that contains at least two of these three strings as subsequences.
codeforces competitive-programming constructive-algorithms greedy implementation strings two-pointers Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 715 (Div. 1) ›

CF 1508C - Complete the MST

We are working with a complete undirected graph, but only some edges come with fixed weights. Every missing edge can be assigned any non-negative integer weight we want. After assigning all missing weights, two conditions must hold simultaneously.
codeforces competitive-programming bitmasks brute-force data-structures dfs-and-similar dsu graphs greedy trees Jun 10, 2026