Codeforces Round 191 (Div. 2)

Solutions for Codeforces Round 191 (Div. 2) (contest 327). 2/3 problems verified against sample I/O. Difficulty range: 1200-2300.

3 items

Codeforces Round 191 (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 2/3 | Rating range: 1200-2300 | Time: 7m 2s

Problem Name Rating Tags Solve Time Verified
A Flipping Game 1200 brute-force, dp, implementation 4m 3s ✓
D Block Tower 1900 constructive-algorithms, dfs-and-similar, graphs 1m 34s ✗
E Axis Walking 2300 bitmasks, combinatorics, constructive-algorithms 1m 25s ✓
Practice › Codeforces Solutions › Codeforces Round 191 (Div. 2) ›

CF 327A - Flipping Game

We are given a short binary array, where each position is either 0 or 1. We are allowed to choose exactly one contiguous segment and invert every value inside it, turning 0 into 1 and 1 into 0.
codeforces competitive-programming brute-force dp implementation May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 191 (Div. 2) ›

CF 327D - Block Tower

We are given a grid where some cells are blocked and the rest are usable land. On each usable cell we may place one building, either a blue tower worth 100 population or a red tower worth 200 population.
codeforces competitive-programming constructive-algorithms dfs-and-similar graphs May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 191 (Div. 2) ›

CF 327E - Axis Walking

We are given a multiset of positive segment lengths. Any permutation of these lengths defines a walk along the number line starting from 0, where we cumulatively add each chosen segment.
codeforces competitive-programming bitmasks combinatorics constructive-algorithms dp meet-in-the-middle May 29, 2026