Codeforces Round 601 (Div. 1)

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

6 items

Codeforces Round 601 (Div. 1)

Div. 1 | 6 problems | 3/6 verified | Difficulty 1700-3300 | 12m 52s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Feeding Chicken	1700	constructive-algorithms, greedy, implementation	5,515	1m 26s
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	1m 20s	✓
C	Point Ordering	2300	constructive-algorithms, geometry, interactive	1,595	1m 31s
D	Tree Queries	2700	data-structures, probabilities, trees	1,529	1m 35s
E	Send Tree to Charlie	3300	combinatorics, dfs-and-similar, dsu	366	4m 42s	✓

Practice › Codeforces Solutions › Codeforces Round 601 (Div. 1) ›

CF 1254D - Tree Queries

We are given a tree with values stored on vertices, initially all zero. The system processes two kinds of operations. One operation injects a value d into a region of the tree that depends on a randomly chosen root vertex r.

Practice › Codeforces Solutions › Codeforces Round 601 (Div. 1) ›

CF 1254C - Point Ordering

We are given a hidden set of points in the plane, each point identified only by an index from 1 to n. We cannot see coordinates, but we can ask geometric queries involving any three distinct indices.

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. The task is to partition the entire grid into exactly $k$ connected regions, one per chicken, so that every cell belongs to exactly one region and every region is…

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 chocolate pieces. A single move allows us to take one piece from a box and shift it to an adjacent box, so the cost of moving a piece is exactly the distance it travels along the line.

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.

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.