Codeforces Round 614 (Div. 1)

5 problems from Codeforces Round 614 (Div. 1) (contest 1292), difficulty 1400-3500. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 614 (Div. 1)

Div. 1 | 5 problems | 2/5 verified | Difficulty 1400-3500 | 17m 14s

#	Problem	Rating	Tags	Accepted	Time	✓
A	NEKO's Maze Game	1400	data-structures, dsu, implementation	13,871	1m 55s	✓
C	Xenon's Attack on the Gangs	2300	combinatorics, dfs-and-similar, dp	2,252	1m 10s
D	Chaotic V.	2700	dp, graphs, greedy	971	7m 22s
E	Rin and The Unknown Flower	3500	constructive-algorithms, greedy, interactive	466	4m 51s
F	Nora's Toy Boxes	3500	bitmasks, combinatorics, dp	370	1m 56s	✓

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

CF 1292D - Chaotic V.

The graph in this problem is not given explicitly, but fully determined by the structure of integers. Every positive integer is a node, and each number $x 1$ has a directed edge to $x / f(x)$, where $f(x)$ is the smallest prime factor of $x$.

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

CF 1292E - Rin and The Unknown Flower

We are trying to reconstruct a hidden string of length up to 50. The string is guaranteed to use only three symbols: C, H, and O.

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

CF 1292C - Xenon's Attack on the Gangs

We are given a tree with $n$ nodes and $n-1$ edges. Each edge is assigned a distinct label from $0$ to $n-2$, so every label appears exactly once. For any pair of nodes $u, v$, we look at the unique path between them and collect all edge labels on that path.

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

CF 1292F - Nora's Toy Boxes

We are given a collection of n distinct toy boxes, each labeled with a positive integer ai. ROBO can perform a very specific action multiple times: pick three distinct boxes where one box's label divides the other two, and then remove the third box to place it on his pile.

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

CF 1292A - NEKO's Maze Game

We are given a 2-row by $n$-column grid representing a maze. The player starts at the top-left cell $(1,1)$ and wants to reach the bottom-right cell $(2,n)$. Movement is allowed only between orthogonally adjacent cells. Initially, all cells are passable ground.