Codeforces Round 593 (Div. 2)

6 problems from Codeforces Round 593 (Div. 2) (contest 1236), difficulty 800-3000. 3/6 solutions verified against sample I/O.

6 items

Codeforces Round 593 (Div. 2)

Div. 2 | 6 problems | 3/6 verified | Difficulty 800-3000 | 39m 57s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Stones	800	brute-force, greedy, math	17,249	5m 9s	✓
B	Alice and the List of Presents	1500	combinatorics, math	12,052	6m 11s	✓
C	Labs	1300	constructive-algorithms, greedy, implementation	10,553	9m 52s
D	Alice and the Doll	2300	brute-force, data-structures, greedy	1,737	6m 19s	✓
E	Alice and the Unfair Game	2500	binary-search, data-structures, dp	731	7m 19s
F	Alice and the Cactus	3000	dfs-and-similar, graphs, math	213	5m 7s

Practice › Codeforces Solutions › Codeforces Round 593 (Div. 2) ›

CF 1236E - Alice and the Unfair Game

We are given a line of $n$ boxes and a single token hidden in one of them. The game proceeds in $m$ rounds. In each round Alice points to a box index $ai$, trying to locate the token.

Practice › Codeforces Solutions › Codeforces Round 593 (Div. 2) ›

CF 1236F - Alice and the Cactus

We are given a connected undirected graph with a special structure: it is a cactus, meaning every edge belongs to at most one simple cycle. On this graph, each vertex independently survives with probability $1/2$, otherwise it is deleted together with all incident edges.

Practice › Codeforces Solutions › Codeforces Round 593 (Div. 2) ›

CF 1236C - Labs

We are given the integers from 1 to $n^2$, each representing a lab positioned by height, where smaller numbers are lower and larger numbers are higher.

Practice › Codeforces Solutions › Codeforces Round 593 (Div. 2) ›

CF 1236D - Alice and the Doll

We are given a rectangular grid with some blocked cells. Starting from the top-left corner, a token must move through the grid so that every unblocked cell is visited exactly once.

Practice › Codeforces Solutions › Codeforces Round 593 (Div. 2) ›

CF 1236A - Stones

We are given three piles of stones. From these piles, Alice can repeatedly perform two kinds of moves. One move consumes one stone from the first pile and two stones from the second pile. The other move consumes one stone from the second pile and two stones from the third pile.

Practice › Codeforces Solutions › Codeforces Round 593 (Div. 2) ›

CF 1236B - Alice and the List of Presents

We are given several kinds of items, where each kind is unlimited in supply. We also have several distinct boxes, each belonging to a different friend, so boxes are labeled and cannot be swapped. For each kind of item, Alice chooses a subset of boxes to place that kind into.