Codeforces Round 192 (Div. 1)

5 problems from Codeforces Round 192 (Div. 1) (contest 329), difficulty 1500-2500. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 192 (Div. 1)

Div. 1 | 5 problems | 3/5 verified | Difficulty 1500-2500 | 10m 40s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Purification	1500	constructive-algorithms, greedy	4,805	1m 55s	✓
B	Biridian Forest	1500	dfs-and-similar, shortest-paths	7,493	1m 46s	✓
C	Graph Reconstruction	2400	constructive-algorithms	1,010	5m 49s
D	The Evil Temple and the Moving Rocks	2500	constructive-algorithms	436	1m 10s	✓
E	Evil			183

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

CF 329B - Biridian Forest

We are given a rectangular grid representing the forest. Some cells are blocked by trees, one cell contains our starting position S, one cell contains the exit E, and some cells contain digits. A digit cell represents that many other breeders standing there initially.

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

CF 329C - Graph Reconstruction

The original graph is very restricted. Every vertex has degree at most two, which means every connected component is either a simple path or a simple cycle. We must build another graph on the same set of vertices.

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

CF 329D - The Evil Temple and the Moving Rocks

We are asked to design a placement of rocks on an n × n grid such that activating a single rock produces at least x sounds. Each rock has a fixed movement direction - up, down, left, or right - and rocks move until they hit either a wall or another rock.

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

CF 329A - Purification

We have an n × n grid. Some cells are usable (.), while some cells are forbidden (E). A spell may only be cast on a usable cell. When we cast a spell on cell (r, c), every cell in row r and every cell in column c becomes purified.