Codeforces Round 594 (Div. 1)

6 problems from Codeforces Round 594 (Div. 1) (contest 1239), difficulty 1700-3400. 3/6 solutions verified against sample I/O.

6 items

Codeforces Round 594 (Div. 1)

Div. 1 | 6 problems | 3/6 verified | Difficulty 1700-3400 | 29m 53s

# Problem Rating Tags Accepted Time ✓
A Ivan the Fool and the Probability Theory 1700 combinatorics, dp, math 7,790 1m 42s ✓
B The World Is Just a Programming Task (Hard Version) 2500 implementation 1,120 3m 39s ✓
C Queue in the Train 2300 data-structures, greedy, implementation 1,810 3m 5s ✓
D Catowice City 2400 2-sat, dfs-and-similar, graph-matchings 2,600 5m 40s
E Turtle 3100 dp, implementation 1,165 6m 34s
F Swiper, no swiping! 3400 graphs, implementation 316 9m 13s
Practice › Codeforces Solutions › Codeforces Round 594 (Div. 1) ›

CF 1239F - Swiper, no swiping!

We are given multiple connected graphs, each with up to half a million vertices and edges in total across all test cases.
codeforces competitive-programming graphs implementation Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 594 (Div. 1) ›

CF 1239E - Turtle

We are given a grid with exactly two rows and n columns. Every cell contains a value, and we are allowed to permute these 2n values arbitrarily between the cells.
codeforces competitive-programming dp implementation Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 594 (Div. 1) ›

CF 1239D - Catowice City

We are given a system of $n$ people, each of whom owns exactly one cat, forming a natural pairing between person $i$ and cat $i$.
codeforces competitive-programming 2-sat dfs-and-similar graph-matchings graphs Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 594 (Div. 1) ›

CF 1239B - The World Is Just a Programming Task (Hard Version)

We are given a bracket string and we are allowed to perform exactly one swap of any two positions, possibly the same position.
codeforces competitive-programming implementation Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 594 (Div. 1) ›

CF 1239C - Queue in the Train

We are given a row of seats indexed from left to right, and each seat has exactly one passenger. Every passenger has a planned time when they become ready to go to a water tank located just left of seat 1.
codeforces competitive-programming data-structures greedy implementation Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 594 (Div. 1) ›

CF 1239A - Ivan the Fool and the Probability Theory

We are asked to count the number of "random pictures" of size $n times m$, where each cell is either black or white. A picture is considered random under Ivan's definition if every cell has at most one adjacent cell of the same color. Here, adjacency is horizontal or vertical.
codeforces competitive-programming combinatorics dp math Jun 11, 2026