Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!]

5 problems from Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] (contest 1067), difficulty 1800-3100. 0/5 solutions verified against sample I/O.

5 items

Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!]

Div. 1 | 5 problems | 0/5 verified | Difficulty 1800-3100 | 37m 58s

#	Problem	Rating	Tags	Accepted	Time
A	Array Without Local Maximums	1900	dp	3,132	6m 9s
B	Multihedgehog	1800	dfs-and-similar, graphs, shortest-paths	2,860	9m 7s
C	Knights	2600	constructive-algorithms	714	8m 40s
D	Computer Game	3100	dp, greedy, math	491	5m 2s
E	Random Forest Rank	2800	dp, graph-matchings, math	552	9m

Practice › Codeforces Solutions › Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] ›

CF 1067E - Random Forest Rank

We are given a tree with $n$ vertices. Each edge is independently kept with probability $1/2$, so after the process we obtain a random forest. For every such resulting forest, we can build its adjacency matrix over real numbers and take its linear algebraic rank.

Practice › Codeforces Solutions › Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] ›

CF 1067D - Computer Game

We are given a collection of quests, each with two reward values and a success probability. Every second, Ivan chooses one quest and attempts it.

Practice › Codeforces Solutions › Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] ›

CF 1067B - Multihedgehog

We are given a tree with $n$ vertices and asked whether it can be generated by a very specific recursive construction parameterized by $k$.

Practice › Codeforces Solutions › Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] ›

CF 1067C - Knights

We are asked to choose positions for $n$ knights on an infinite chessboard. After placing them, the board evolves deterministically: whenever an empty cell has at least four knights that can attack it in one knight move, a new knight is added there.

Practice › Codeforces Solutions › Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] ›

CF 1067A - Array Without Local Maximums

We are given an array of length ( n ), where each position must eventually contain an integer between 1 and 200. Some positions are already fixed, while others are unknown and marked as (-1).