Codeforces Beta Round 87 (Div. 1 Only)

5 problems from Codeforces Beta Round 87 (Div. 1 Only) (contest 115), difficulty 900-2600. 3/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 87 (Div. 1 Only)

Div. 1 | 5 problems | 3/5 verified | Difficulty 900-2600 | 11m 15s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Party	900	dfs-and-similar, graphs, trees	43,322	1m 51s	✓
B	Lawnmower	1500	greedy, sortings	2,840	1m 30s	✓
C	Plumber	2200	math	676	2m 56s
D	Unambiguous Arithmetic Expression	2600	dp, expression-parsing	454	2m 6s	✓
E	Linear Kingdom Races	2400	data-structures, dp	2,200	2m 52s

Practice › Codeforces Solutions › Codeforces Beta Round 87 (Div. 1 Only) ›

CF 115A - Party

We are asked to organize a company party such that no group contains both a manager and their subordinate, directly or indirectly. The input describes each employee's immediate manager: a number from 1 to n, or -1 if they have no manager.

Practice › Codeforces Solutions › Codeforces Beta Round 87 (Div. 1 Only) ›

CF 115B - Lawnmower

We are given a rectangular garden represented as an n×m grid. Each cell contains either grass, which does not require mowing, or weeds, which do. We start at the top-left corner of the garden, always on grass, and initially facing right.

Practice › Codeforces Solutions › Codeforces Beta Round 87 (Div. 1 Only) ›

CF 115C - Plumber

We have an n × m grid. Every cell must contain one of four corner-shaped pipe pieces. Each piece connects exactly two adjacent sides of the cell.

Practice › Codeforces Solutions › Codeforces Beta Round 87 (Div. 1 Only) ›

CF 115D - Unambiguous Arithmetic Expression

We are asked to count the number of ways an arithmetic expression can be made unambiguous with parentheses so that, if all parentheses are removed, the expression is exactly the string given in the input.

Practice › Codeforces Solutions › Codeforces Beta Round 87 (Div. 1 Only) ›

CF 115E - Linear Kingdom Races

We are asked to maximize profit from a set of potential races in a linearly connected kingdom. Each race occupies a contiguous set of roads and provides a payment if all the roads it uses are repaired.