Codeforces Round 192 (Div. 1)

Solutions for Codeforces Round 192 (Div. 1) (contest 329). 1/3 problems verified against sample I/O. Difficulty range: 1500-3100.

3 items

Codeforces Round 192 (Div. 1)

Type: Div. 1 | Problems: 3 | Verified: 1/3 | Rating range: 1500-3100 | Time: 7m 40s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Purification	1500	constructive-algorithms, greedy	3m 58s	✗
B	Biridian Forest	1500	dfs-and-similar, shortest-paths	2m 48s	✓
E	Evil	3100	math	54s	✗

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

CF 329A - Purification

We are given an $n times n$ grid where every cell is initially unclean. Some cells are marked as forbidden for casting a spell. When we cast a purification spell on a cell $(r, c)$, we clean every cell in row $r$ and every cell in column $c$.

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

CF 329B - Biridian Forest

We are asked to navigate a forest represented as a grid. Each cell can be empty, contain a tree, or contain one or more mikemon breeders. Our goal is to move from our starting position to a designated exit while minimizing the number of battles we are forced to engage in.

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

CF 329E - Evil

We are given a set of $n$ cities, each represented as a point on a 2D Cartesian plane. The distance between any two cities is measured using the Manhattan metric, which is the sum of the absolute differences of their coordinates.