Codeforces Round 578 (Div. 2)

Solutions for Codeforces Round 578 (Div. 2) (contest 1200). 5/6 problems verified against sample I/O. Difficulty range: 800-2300.

6 items

Codeforces Round 578 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 5/6 | Rating range: 800-2300 | Time: 14m 36s

Problem Name Rating Tags Solve Time Verified
A Hotelier 800 brute-force, data-structures, implementation 2m 10s ✓
B Block Adventure 1200 dp, greedy 1m 50s ✓
C Round Corridor 1400 math, number-theory 1m 35s ✓
D White Lines 1900 brute-force, data-structures, dp 2m 28s ✓
E Compress Words 2000 brute-force, hashing, implementation 1m 17s ✓
F Graph Traveler 2300 brute-force, data-structures, dfs-and-similar 5m 16s ✗
Practice › Codeforces Solutions › Codeforces Round 578 (Div. 2) ›

CF 1200F - Graph Traveler

We are given a directed graph where each vertex behaves like a deterministic machine with a twist: the outgoing edge is not fixed, but chosen based on a changing integer state $c$.
codeforces competitive-programming brute-force data-structures dfs-and-similar dp graphs implementation math number-theory Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 578 (Div. 2) ›

CF 1200D - White Lines

We are given an $n times n$ grid where each cell is either black or white. A single operation is allowed exactly once: we choose a top-left corner of a $k times k$ square and repaint every cell inside that square to white.
codeforces competitive-programming brute-force data-structures dp implementation two-pointers Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 578 (Div. 2) ›

CF 1200A - Hotelier

We are simulating a very small system: a hotel with exactly 10 rooms indexed from 0 to 9. Each room can either be empty or occupied.
codeforces competitive-programming brute-force data-structures implementation Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 578 (Div. 2) ›

CF 1200E - Compress Words

We are given a sequence of words forming a sentence, and the task is to compress them into a single string by merging them left to right.
codeforces competitive-programming brute-force hashing implementation string-suffix-structures strings Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 578 (Div. 2) ›

CF 1200B - Block Adventure

In Block Adventure, we have a row of columns with different heights. The player starts on the first column and must reach the last one.
codeforces competitive-programming dp greedy Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 578 (Div. 2) ›

CF 1200C - Round Corridor

The corridor is essentially two separate circular rings placed one inside the other. The inner ring is split into n equal rooms arranged in a cycle, and the outer ring is split into m equal rooms arranged in another cycle.
codeforces competitive-programming math number-theory Jun 11, 2026