Codeforces Round 968 (Div. 2)

Solutions for Codeforces Round 968 (Div. 2) (contest 2003). 1/8 problems verified against sample I/O. Difficulty range: 800-2800.

8 items

Codeforces Round 968 (Div. 2)

Type: Div. 2 | Problems: 8 | Verified: 1/8 | Rating range: 800-2800 | Time: 20m 20s

Problem Name Rating Tags Solve Time Verified
A Turtle and Good Strings 800 greedy, strings 2m 1s ✗
B Turtle and Piggy Are Playing a Game 2 800 games, greedy, sortings 2m ✗
C Turtle and Good Pairs 1200 constructive-algorithms, greedy, sortings 2m 35s ✗
D1 Turtle and a MEX Problem (Easy Version) 1500 greedy, math 2m 5s ✗
D2 Turtle and a MEX Problem (Hard Version) 2100 dfs-and-similar, dp, graphs 2m 31s ✗
E1 Turtle and Inversions (Easy Version) 2600 brute-force, divide-and-conquer, dp 4m 17s ✓
E2 Turtle and Inversions (Hard Version) 2700 brute-force, data-structures, divide-and-conquer 2m 29s ✗
F Turtle and Three Sequences 2800 brute-force, data-structures, dp 2m 22s ✗
Practice › Codeforces Solutions › Codeforces Round 968 (Div. 2) ›

CF 2003F - Turtle and Three Sequences

This is a counting problem, so it is closest to Type C in the supplied classification. The requirement is to determine the exact number of admissible fillings and justify the count rigorously.
codeforces competitive-programming brute-force data-structures dp greedy math probabilities two-pointers Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 968 (Div. 2) ›

CF 2003E1 - Turtle and Inversions (Easy Version)

We are asked to find the maximum number of inversions in permutations of length $n$ that satisfy a specific "interesting" property defined by a set of intervals.
codeforces competitive-programming brute-force divide-and-conquer dp greedy math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 968 (Div. 2) ›

CF 2003E2 - Turtle and Inversions (Hard Version)

The problem gives us a permutation of integers from 1 to $n$ and asks us to consider certain "interesting" permutations based on a set of intervals.
codeforces competitive-programming brute-force data-structures divide-and-conquer dp greedy math two-pointers Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 968 (Div. 2) ›

CF 2003D2 - Turtle and a MEX Problem (Hard Version)

The problem involves a turtle playing with several integer sequences and a non-negative integer $x$. For each sequence, the turtle can perform an operation exactly once: he sets $x$ to the $text{mex}$ of its current value together with the numbers in the chosen sequence.
codeforces competitive-programming dfs-and-similar dp graphs greedy implementation math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 968 (Div. 2) ›

CF 2003D1 - Turtle and a MEX Problem (Easy Version)

We are given several sequences of non-negative integers, and an initial integer $x$. Turtle can repeatedly choose any sequence and replace $x$ with the mex of $x$ together with all numbers in that sequence.
codeforces competitive-programming greedy math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 968 (Div. 2) ›

CF 2003C - Turtle and Good Pairs

We are given a string consisting of lowercase letters, and our task is to reorder it to maximize the number of "good pairs.
codeforces competitive-programming constructive-algorithms greedy sortings strings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 968 (Div. 2) ›

CF 2003A - Turtle and Good Strings

We are asked to determine whether a given string can be split into two or more contiguous substrings such that no substring starts with a character that appears at the end of a later substring.
codeforces competitive-programming greedy strings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 968 (Div. 2) ›

CF 2003B - Turtle and Piggy Are Playing a Game 2

We are given a sequence of numbers and two players who repeatedly shrink it until only one value remains at the front position. Each move removes one element, but before removing it, the left element of the chosen adjacent pair is updated.
codeforces competitive-programming games greedy sortings Jun 8, 2026