Codeforces Round 1096 (Div. 3)

8 problems from Codeforces Round 1096 (Div. 3) (contest 2227), difficulty -. 0/8 solutions verified against sample I/O.

8 items

Codeforces Round 1096 (Div. 3)

Div. 3 | 8 problems | 0/8 verified | Difficulty - | 27m 59s

# Problem Rating Tags Accepted Time ✓
A Koshary implementation, math 18,706 2m 38s
B Party Monster greedy 17,432 3m 38s
C Snowfall constructive-algorithms, math 14,564 4m 24s
D Palindromex binary-search, brute-force, constructive-algorithms 8,349 3m 24s
E It All Went Sideways binary-search, data-structures, dp 5,828 2m 57s
F It Just Keeps Going Sideways binary-search, data-structures, dp 2,665 5m 5s
G Drowning binary-search, data-structures, math 1,249 2m 57s
H Fallen Leaves dfs-and-similar, dp, trees 921 2m 56s
Practice › Codeforces Solutions › Codeforces Round 1096 (Div. 3) ›

CF 2227A - Koshary

We are given a grid starting at the origin point $(0,0)$ and a target point $(x,y)$. At each move, Yousef can increase exactly one coordinate by 2 using a long step, either moving right by 2 or up by 2.
codeforces competitive-programming implementation math Jun 1, 2026
Practice › Codeforces Solutions › Codeforces Round 1096 (Div. 3) ›

CF 2227B - Party Monster

We are given a string made only of opening and closing parentheses. In one move, we are allowed to take a contiguous block, remove it, and then reinsert its characters anywhere in the remaining string, with full freedom to permute those removed characters and place each one…
codeforces competitive-programming greedy Jun 1, 2026
Practice › Codeforces Solutions › Codeforces Round 1096 (Div. 3) ›

CF 2227C - Snowfall

A subarray product is divisible by $6$ if and only if the product contains at least one factor $2$ and at least one factor $3$. For each number, only its divisibility by $2$ and $3$ matters. The exact value is irrelevant.
codeforces competitive-programming constructive-algorithms math Jun 1, 2026
Practice › Codeforces Solutions › Codeforces Round 1096 (Div. 3) ›

CF 2227D - Palindromex

We are given an array of length $2n$. Every value from $0$ to $n-1$ appears exactly twice. The task is to select a contiguous segment of this array that reads the same left-to-right and right-to-left, and among all such segments we want the one whose mex is as large as possible.
codeforces competitive-programming binary-search brute-force constructive-algorithms data-structures greedy implementation two-pointers Jun 1, 2026
Practice › Codeforces Solutions › Codeforces Round 1096 (Div. 3) ›

CF 2227E - It All Went Sideways

Each test case gives a sequence of column heights. Think of column i as a vertical stack of unit blocks, occupying rows 1 up to ai. All blocks in a row are aligned across columns.
codeforces competitive-programming binary-search data-structures dp greedy Jun 1, 2026
Practice › Codeforces Solutions › Codeforces Round 1096 (Div. 3) ›

CF 2227F - It Just Keeps Going Sideways

Each column contains cubes stacked from height $1$ up to height $ai$. After gravity turns to the right, cubes never change height. Cubes at the same height slide independently and occupy the rightmost available positions on that horizontal level.
codeforces competitive-programming binary-search data-structures dp greedy math Jun 1, 2026
Practice › Codeforces Solutions › Codeforces Round 1096 (Div. 3) ›

CF 2227G - Drowning

Ta có một mảng số nguyên dương. Một phép giảm chọn ba phần tử liên tiếp sao cho phần tử giữa nhỏ hơn tổng hai phần tử hai bên. Khi đó bộ ba $$(c{i-1},ci,c{i+1})$$ được thay bằng một giá trị duy nhất $$x=c{i-1}-ci+c{i+1}.
codeforces competitive-programming binary-search data-structures math Jun 1, 2026
Practice › Codeforces Solutions › Codeforces Round 1096 (Div. 3) ›

CF 2227H - Fallen Leaves

We are given a tree and a fixed set of vertices consisting of all leaves in the original tree. These leaves are determined once from the initial structure and do not change during the process.
codeforces competitive-programming dfs-and-similar dp trees Jun 1, 2026