Codeforces Round 162 (Div. 1)

5 problems from Codeforces Round 162 (Div. 1) (contest 264), difficulty 1200-3000. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 162 (Div. 1)

Div. 1 | 5 problems | 2/5 verified | Difficulty 1200-3000 | 10m 5s

# Problem Rating Tags Accepted Time ✓
A Escape from Stones 1200 constructive-algorithms, data-structures, implementation 11,804 1m 47s ✓
B Good Sequences 1500 dp, number-theory 12,017 1m 33s ✓
C Choosing Balls 2000 dp 3,275 1m 45s
D Colorful Stones 2500 dp, two-pointers 451 2m 35s
E Roadside Trees 3000 data-structures, dp 469 2m 25s
Practice › Codeforces Solutions › Codeforces Round 162 (Div. 1) ›

CF 264C - Choosing Balls

We are given a sequence of balls arranged in a fixed order. Each ball carries two pieces of information, a color and a numeric value. From this sequence we are allowed to pick a subsequence while preserving the original order, or choose nothing at all.
codeforces competitive-programming dp Jun 4, 2026
Practice › Codeforces Solutions › Codeforces Round 162 (Div. 1) ›

CF 264B - Good Sequences

We are given a strictly increasing list of positive integers. From this list, we want to choose a subsequence that is also strictly increasing, but with an additional constraint on adjacency: whenever two consecutive chosen numbers appear next to each other in the subsequence…
codeforces competitive-programming dp number-theory Jun 4, 2026
Practice › Codeforces Solutions › Codeforces Round 162 (Div. 1) ›

CF 264E - Roadside Trees

We have a street with n positions where trees can be planted, numbered from west to east. Trees grow automatically by one meter per month, and we handle one query per month.
codeforces competitive-programming data-structures dp Jun 4, 2026
Practice › Codeforces Solutions › Codeforces Round 162 (Div. 1) ›

CF 264D - Colorful Stones

We have two sequences of stones, each colored either red, green, or blue. One sequence belongs to Squirrel Liss, the other to Cat Vasya. Each animal starts on the first stone of their respective sequence.
codeforces competitive-programming dp two-pointers Jun 4, 2026
Practice › Codeforces Solutions › Codeforces Round 162 (Div. 1) ›

CF 264A - Escape from Stones

We are given a string consisting of the characters l and r. The characters describe how the squirrel moves when stones fall one by one. Stone i falls after stones 1...i-1 have already been placed.
codeforces competitive-programming constructive-algorithms data-structures implementation two-pointers Jun 4, 2026