Codeforces Round 933 (Div. 3)

Solutions for Codeforces Round 933 (Div. 3) (contest 1941). 6/7 problems verified against sample I/O. Difficulty range: 800-2000.

7 items

Codeforces Round 933 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 6/7 | Rating range: 800-2000 | Time: 12m 58s

Problem Name Rating Tags Solve Time Verified
A Rudolf and the Ticket 800 brute-force, math 1m 23s ✓
B Rudolf and 121 1000 brute-force, dp, greedy 2m 47s ✓
C Rudolf and the Ugly String 900 dp, greedy, strings 2m 41s ✓
D Rudolf and the Ball Game 1200 dfs-and-similar, dp, implementation 1m 17s ✗
E Rudolf and k Bridges 1600 binary-search, data-structures, dp 2m 6s ✓
F Rudolf and Imbalance 1800 binary-search, greedy, sortings 1m 36s ✓
G Rudolf and Subway 2000 constructive-algorithms, dfs-and-similar, graphs 1m 8s ✓
Practice › Codeforces Solutions › Codeforces Round 933 (Div. 3) ›

CF 1941D - Rudolf and the Ball Game

We have a circle of n players, numbered 1 through n clockwise. The ball starts with player x. There are m throws, and each throw has a distance r_i and a remembered direction c_i. The direction could be clockwise (0), counterclockwise (1), or unknown (?).
codeforces competitive-programming dfs-and-similar dp implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Round 933 (Div. 3) ›

CF 1941E - Rudolf and k Bridges

Each row of the river can be treated independently. Along a chosen row, we want to place supports in some columns so that the first and last columns always contain supports, and the number of cells skipped between two neighboring supports is at most d.
codeforces competitive-programming binary-search data-structures dp two-pointers May 28, 2026
Practice › Codeforces Solutions › Codeforces Round 933 (Div. 3) ›

CF 1941F - Rudolf and Imbalance

We start with a strictly increasing array of problem complexities. The imbalance of the set is defined as the largest difference between two neighboring elements after sorting.
codeforces competitive-programming binary-search greedy sortings two-pointers May 28, 2026
Practice › Codeforces Solutions › Codeforces Round 933 (Div. 3) ›

CF 1941G - Rudolf and Subway

The problem describes a subway system as an undirected graph where each vertex is a station and each edge represents a direct connection between two stations. Every edge is labeled with a color representing the subway line it belongs to.
codeforces competitive-programming constructive-algorithms dfs-and-similar graphs shortest-paths May 28, 2026
Practice › Codeforces Solutions › Codeforces Round 933 (Div. 3) ›

CF 1941A - Rudolf and the Ticket

The problem gives us two arrays of coin values. The first array represents coins in Rudolf's left pocket, and the second array represents coins in his right pocket.
codeforces competitive-programming brute-force math May 27, 2026
Practice › Codeforces Solutions › Codeforces Round 933 (Div. 3) ›

CF 1941B - Rudolf and 121

We are given an array of non-negative integers. In one operation, we choose an index $i$ such that $2 le i le n-1$, and
codeforces competitive-programming brute-force dp greedy math May 27, 2026
Practice › Codeforces Solutions › Codeforces Round 933 (Div. 3) ›

CF 1941C - Rudolf and the Ugly String

We are given a string and want to remove the minimum number of characters so that the resulting string no longer contains "pie" or "map" as a substring.
codeforces competitive-programming dp greedy strings May 27, 2026