Codeforces Round 1073 (Div. 2)

Solutions for Codeforces Round 1073 (Div. 2) (contest 2191). 2/8 problems verified against sample I/O. Difficulty range: 800-3200.

8 items

Codeforces Round 1073 (Div. 2)

Type: Div. 2 | Problems: 8 | Verified: 2/8 | Rating range: 800-3200 | Time: 14m 4s

Problem Name Rating Tags Solve Time Verified
A Array Coloring 800 constructive-algorithms 1m 50s ✓
B MEX Reordering 1000 constructive-algorithms, sortings 1m 8s ✓
C Sorting Game 1200 games 3m 14s ✗
D1 Sub-RBS (Easy Version) 1400 constructive-algorithms 1m 43s ✗
D2 Sub-RBS (Hard Version) 1900 dp, games 1m 24s ✗
E Comparable Permutations 2300 interactive, two-pointers 2m 4s ✗
F Prufer Vertex 2500 combinatorics, number-theory 1m 29s ✗
G Median Permutation 3200 combinatorics 1m 12s ✗
Practice › Codeforces Solutions › Codeforces Round 1073 (Div. 2) ›

CF 2191G - Median Permutation

We are given a partially filled permutation of size $n$, represented as an array $a$ where zeros indicate unknown positions.
codeforces competitive-programming combinatorics Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1073 (Div. 2) ›

CF 2191F - Prufer Vertex

We start with a graph that is already a forest, meaning it is a collection of trees on the vertex set $1 ldots n$. Some edges are present, but the graph is acyclic and possibly disconnected.
codeforces competitive-programming combinatorics number-theory Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1073 (Div. 2) ›

CF 2191E - Comparable Permutations

Something went wrong. If this issue persists please contact us through our help center at help.openai.com.
codeforces competitive-programming interactive two-pointers Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1073 (Div. 2) ›

CF 2191C - Sorting Game

We are given a weighted undirected graph. We must choose exactly $n-1$ edges. If those $n-1$ edges form a spanning tree, the choice is forbidden. We want the minimum possible total weight among all choices of $n-1$ edges that do not form a tree.
codeforces competitive-programming games Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1073 (Div. 2) ›

CF 2191D2 - Sub-RBS (Hard Version)

We are given a string s of parentheses of length n. The task is to consider all non-empty subsequences of s and compute a "score" for each. The score is defined as follows: if the subsequence is not a regular bracket sequence, its score is 0.
codeforces competitive-programming dp games Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1073 (Div. 2) ›

CF 2191D1 - Sub-RBS (Easy Version)

We are given a string of parentheses s that is already a valid regular bracket sequence. The task is to find the longest non-empty subsequence t of s that is also a valid regular bracket sequence and is “better” than s.
codeforces competitive-programming constructive-algorithms Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1073 (Div. 2) ›

CF 2191B - MEX Reordering

We are given an array of integers, and we are allowed to reorder it arbitrarily. After fixing an order, we look at every possible split position between prefix and suffix.
codeforces competitive-programming constructive-algorithms sortings Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1073 (Div. 2) ›

CF 2191A - Array Coloring

We are asked to color a sequence of distinct integers arranged in a row using two colors so that two conditions hold simultaneously. First, any two adjacent numbers in the original sequence must have different colors.
codeforces competitive-programming constructive-algorithms Jun 7, 2026