Codeforces Round 986 (Div. 2)

Solutions for Codeforces Round 986 (Div. 2) (contest 2028). 2/6 problems verified against sample I/O. Difficulty range: 900-2700.

6 items

Codeforces Round 986 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 900-2700 | Time: 11m 25s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Alice's Adventures in ''Chess''	900	brute-force, implementation, math	1m 43s	✓
B	Alice's Adventures in Permuting	1400	binary-search, implementation, math	3m 23s	✓
C	Alice's Adventures in Cutting Cake	1600	binary-search, dp, greedy	1m 35s	✗
D	Alice's Adventures in Cards	2000	constructive-algorithms, data-structures, dp	1m 29s	✗
E	Alice's Adventures in the Rabbit Hole	2300	combinatorics, dfs-and-similar, dp	1m 23s	✗
F	Alice's Adventures in Addition	2700	bitmasks, brute-force, dp	1m 52s	✗

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

CF 2028F - Alice's Adventures in Addition

We are given a sequence of integers and we are allowed to insert either addition or multiplication operators between consecutive elements. Multiplication has higher precedence than addition, so the expression is evaluated as a sum of several multiplicative blocks.

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

CF 2028B - Alice's Adventures in Permuting

We are asked to determine how many operations it takes to turn a linearly generated array into a permutation of integers from 0 to n−1. The array is defined by three numbers n, b, and c, and follows the formula ai = b (i - 1) + c for 1 ≤ i ≤ n.

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

CF 2028E - Alice's Adventures in the Rabbit Hole

We are given a tree with n vertices where vertex 1 is considered the exit of the rabbit hole, and Alice starts at some vertex v. Each turn a fair coin is flipped. On heads, Alice chooses an adjacent vertex to move to.

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

CF 2028D - Alice's Adventures in Cards

The problem can be viewed as a graph traversal on a set of n card types. Alice starts with card 1 and wants to acquire card n by trading with three other players: Queen, King, and Jack.

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

CF 2028A - Alice's Adventures in ''Chess''

Alice starts at the origin on a two-dimensional grid and can move in the four cardinal directions. She has a fixed sequence of moves that she repeats indefinitely.

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

CF 2028C - Alice's Adventures in Cutting Cake

We are given a long sheet cake divided into n sections, each with a tastiness value. Alice is at a party with m creatures, and she wants to cut the cake into m + 1 contiguous pieces. Each creature will only be happy if its piece has tastiness at least v.