Codeforces Beta Round 15

5 problems from Codeforces Beta Round 15 (contest 15), difficulty 1200-2600. 5/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 15

Beta | 5 problems | 5/5 verified | Difficulty 1200-2600 | 11m 13s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Cottage Village	1200	implementation, sortings	4,495	2m 21s	✓
B	Laser	1800	math	1,680	2m 54s	✓
C	Industrial Nim	2000	games	2,837	2m 25s	✓
D	Map	2500	data-structures, implementation, sortings	913	2m 12s	✓
E	Triangles	2600	combinatorics, dp	673	1m 21s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 15 ›

CF 15A - Cottage Village

We are given a one-dimensional map of a village where all the houses lie along the _x_-axis. Each house is square, specified by its center coordinate and its side length. No two houses overlap, though they may touch edges.

Practice › Codeforces Solutions › Codeforces Beta Round 15 ›

CF 15B - Laser

We have a rectangular grid with n columns and m rows. Two lasers point at two different cells. Both lasers always move together, meaning their relative offset never changes. If one laser moves by (dx, dy), the other must move by exactly the same vector.

Practice › Codeforces Solutions › Codeforces Beta Round 15 ›

CF 15C - Industrial Nim

Each quarry contributes a consecutive range of heap sizes to a standard Nim game.

Practice › Codeforces Solutions › Codeforces Beta Round 15 ›

CF 15D - Map

We are given a rectangular map of size n × m, where each cell has a non-negative height. Peter wants to build cities of size a × b. To place a city, he must level the ground inside its rectangle by reducing all cells to the minimum height within that rectangle.

Practice › Codeforces Solutions › Codeforces Beta Round 15 ›

CF 15E - Triangles

The picture in the statement describes a recursive triangular arrangement of paths and blocked regions. The black segments form a planar graph, and the gray triangles represent forbidden forest areas.