Codeforces Round 575 (Div. 3)

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

7 items

Codeforces Round 575 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 6/7 | Rating range: 800-2200 | Time: 43m 3s

Problem Name Rating Tags Solve Time Verified
A Three Piles of Candies 800 brute-force, constructive-algorithms, math 4m 3s ✓
B Odd Sum Segments 1200 constructive-algorithms, math 6m 10s ✓
C Robot Breakout 1500 implementation 6m 19s ✓
D1 RGB Substring (easy version) 1500 implementation 5m 8s ✓
D2 RGB Substring (hard version) 1600 data-structures, dp, implementation 3m 41s ✓
E Connected Component on a Chessboard 1800 constructive-algorithms, implementation 12m 58s ✗
F K-th Path 2200 brute-force, constructive-algorithms, shortest-paths 4m 44s ✓
Practice › Codeforces Solutions › Codeforces Round 575 (Div. 3) ›

CF 1196E - Connected Component on a Chessboard

We are working on an infinite checkerboard indexed by positive integer coordinates. The cell at (1, 1) is fixed as white, and colors alternate like a standard chessboard: parity of (x + y) determines whether a cell is black or white.
codeforces competitive-programming constructive-algorithms implementation Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 575 (Div. 3) ›

CF 1196F - K-th Path

We are given an undirected weighted graph where every pair of vertices is connected by at least one path. Between any two vertices, there is a well-defined shortest path length.
codeforces competitive-programming brute-force constructive-algorithms shortest-paths sortings Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 575 (Div. 3) ›

CF 1196D2 - RGB Substring (hard version)

We are given a string made only of the letters R, G, and B. From this string we want to pick a contiguous block of fixed length k and modify characters so that this block matches some segment of an infinite repeating pattern "RGBRGBRGB...".
codeforces competitive-programming data-structures dp implementation two-pointers Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 575 (Div. 3) ›

CF 1196C - Robot Breakout

We are given several independent queries. Each query describes a set of robots placed on an infinite grid. Every robot starts at a fixed coordinate, and it also has a personal movement system described by which of the four cardinal directions it can use.
codeforces competitive-programming implementation Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 575 (Div. 3) ›

CF 1196B - Odd Sum Segments

We are given several independent arrays. For each one, we must cut it into exactly k contiguous pieces, where each piece has an odd sum. The array order is fixed, so the only freedom is choosing cut positions.
codeforces competitive-programming constructive-algorithms math Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 575 (Div. 3) ›

CF 1196D1 - RGB Substring (easy version)

We are given a string made only of three characters, R, G, and B. From this string, we want to find a contiguous segment of fixed length k that is as close as possible to the repeating pattern RGBRGBRGB....
codeforces competitive-programming implementation Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 575 (Div. 3) ›

CF 1196A - Three Piles of Candies

Each query gives three piles of candies. Alice must take one whole pile, Bob must take one of the remaining piles, and the last pile can be split arbitrarily between them.
codeforces competitive-programming brute-force constructive-algorithms math Jun 12, 2026