Codeforces Round 601 (Div. 1)

5 problems from Codeforces Round 601 (Div. 1) (contest 1254), difficulty 1700-3300. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 601 (Div. 1)

Div. 1 | 5 problems | 2/5 verified | Difficulty 1700-3300 | 24m 53s

# Problem Rating Tags Accepted Time ✓
A Feeding Chicken 1700 constructive-algorithms, greedy, implementation 5,515 3m 53s
B1 Send Boxes to Alice (Easy Version) 1800 constructive-algorithms, greedy, math 5,006 2m 18s ✓
B2 Send Boxes to Alice (Hard Version) 2100 constructive-algorithms, greedy, math 3,419 3m 53s
C Point Ordering 2300 constructive-algorithms, geometry, interactive 1,595 10m 7s
E Send Tree to Charlie 3300 combinatorics, dfs-and-similar, dsu 366 4m 42s ✓
Practice › Codeforces Solutions › Codeforces Round 601 (Div. 1) ›

CF 1254C - Point Ordering

We are given a hidden set of points that form the vertices of a convex polygon. The only thing we can do is query relationships between triples of points: either we can ask for the orientation of a triple around a fixed point, or we can ask for the signed area of a triangle…
codeforces competitive-programming constructive-algorithms geometry interactive math Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 601 (Div. 1) ›

CF 1254E - Send Tree to Charlie

We are given a tree with $n$ nodes, where each node initially holds a unique label from $1$ to $n$. Someone then performs a process that is equivalent to choosing an ordering of all edges and, for each edge in that order, swapping the labels of its two endpoints.
codeforces competitive-programming combinatorics dfs-and-similar dsu trees Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 601 (Div. 1) ›

CF 1254A - Feeding Chicken

We are given a rectangular grid where each cell is either empty or contains rice. We also have $k$ chickens, and we must partition the entire grid into exactly $k$ connected regions, one per chicken.
codeforces competitive-programming constructive-algorithms greedy implementation Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 601 (Div. 1) ›

CF 1254B2 - Send Boxes to Alice (Hard Version)

We are given a line of boxes, each containing some number of chocolates. In one move, we can take a single chocolate from box i and move it to either neighbor i-1 or i+1, as long as that neighbor exists. Each such move costs one second.
codeforces competitive-programming constructive-algorithms greedy math number-theory ternary-search two-pointers Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 601 (Div. 1) ›

CF 1254B1 - Send Boxes to Alice (Easy Version)

We are asked to rearrange chocolates among boxes so that Alice will be happy. Each of the $n$ boxes has either zero or one chocolate, and at least one box contains a chocolate.
codeforces competitive-programming constructive-algorithms greedy math number-theory ternary-search two-pointers Jun 11, 2026