Codeforces Round 177 (Div. 2)

2 problems from Codeforces Round 177 (Div. 2) (contest 289), difficulty 1100-1400. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 177 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 1100-1400 | 2m 24s

# Problem Rating Tags Accepted Time ✓
A Polo the Penguin and Segments 1100 brute-force, implementation 10,325 1m 19s ✓
B Polo the Penguin and Matrix 1400 brute-force, dp, implementation 18,961 1m 5s ✓
Practice › Codeforces Solutions › Codeforces Round 177 (Div. 2) ›

CF 289B - Polo the Penguin and Matrix

We are given a rectangular grid of integers, and we are allowed to perform a very specific operation: pick a single cell and add or subtract a fixed value d to it. Each such operation costs one move.
codeforces competitive-programming brute-force dp implementation sortings ternary-search Jun 5, 2026
Practice › Codeforces Solutions › Codeforces Round 177 (Div. 2) ›

CF 289A - Polo the Penguin and Segments

We are given several integer intervals on the number line. Each interval represents a continuous block of covered integers, and the segments do not overlap or touch in any way.
codeforces competitive-programming brute-force implementation Jun 5, 2026