Codeforces Round 1086 (Div. 2)

6 problems from Codeforces Round 1086 (Div. 2) (contest 2208), difficulty 800-2700. 2/6 solutions verified against sample I/O.

6 items

Codeforces Round 1086 (Div. 2)

Div. 2 | 6 problems | 2/6 verified | Difficulty 800-2700 | 14m

#	Problem	Rating	Tags	Accepted	Time	✓
A	Bingo Candies	800	constructive-algorithms, math	20,130	1m 45s	✓
B	Cyclists	1100	brute-force, games, greedy	13,623	2m 23s
C	Stamina and Tasks	1300	dp, greedy, math	11,031	1m 59s	✓
D1	Tree Orientation (Easy Version)	1800	constructive-algorithms, dfs-and-similar, dsu	4,190	3m 24s
D2	Tree Orientation (Hard Version)	2200	dfs-and-similar, dsu, graphs	1,824	1m 57s
E	Counting Cute Arrays	2700	combinatorics, dp	423	2m 32s

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

CF 2208D1 - Tree Orientation (Easy Version)

We are given a binary reachability matrix for a directed graph on $n$ nodes. The matrix tells us, for every ordered pair $(i, j)$, whether node $i$ can reach node $j$ through directed edges.

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

CF 2208E - Counting Cute Arrays

We are given an array of length $n$ with integers ranging from $-1$ to $n$. The $-1$ values are placeholders that can take any non-negative integer.

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

CF 2208D2 - Tree Orientation (Hard Version)

We are given a directed reachability matrix of a tree after all its edges have been assigned directions, and we need to reconstruct a tree and its edge directions that produce exactly the same reachability information.

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

CF 2208B - Cyclists

We are given a deck of n cards, each with an energy cost. Bob wants to play a special "win-condition" card as many times as possible without exceeding a total energy budget m. On each turn, Bob can select a card from only the first k positions in the current deck.

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

CF 2208C - Stamina and Tasks

We are given a sequence of tasks, each with a point value and a difficulty percentage. You start with a stamina of 1. For each task, you can either skip it or complete it.

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

CF 2208A - Bingo Candies

We are given a square grid of size $n times n$ representing a board where each cell contains a candy of a certain color. The color of a candy is denoted by an integer, and different integers represent different colors.