Codeforces Beta Round 35 (Div. 2)

5 problems from Codeforces Beta Round 35 (Div. 2) (contest 35), difficulty 1000-2100. 5/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 35 (Div. 2)

Div. 2 | 5 problems | 5/5 verified | Difficulty 1000-2100 | 7m 52s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Shell Game	1000	implementation	7,582	1m 26s	✓
B	Warehouse	1700	implementation	1,195	1m 21s	✓
C	Fire Again	1500	brute-force, dfs-and-similar, shortest-paths	8,613	2m 10s	✓
D	Animals	1700	dp, greedy	3,860	1m 14s	✓
E	Parade	2100	data-structures, sortings	879	1m 41s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 35 (Div. 2) ›

CF 35A - Shell Game

We have three cups arranged in a line, and a ball starts under one of them. The performer performs exactly three swaps. Each swap exchanges the positions of two cups. After all swaps finish, we must determine which cup contains the ball.

Practice › Codeforces Solutions › Codeforces Beta Round 35 (Div. 2) ›

CF 35B - Warehouse

We are asked to simulate a warehouse with a grid-like shelving system. Each shelf has m sections, and there are n shelves stacked from top to bottom. Every section can hold at most one box.

Practice › Codeforces Solutions › Codeforces Beta Round 35 (Div. 2) ›

CF 35C - Fire Again

We have a rectangular grid of trees. A fire starts simultaneously from several cells, and every minute it spreads to neighboring cells that share a side. The task is to find any cell whose burning time is as large as possible, meaning it catches fire later than every other tree.

Practice › Codeforces Solutions › Codeforces Beta Round 35 (Div. 2) ›

CF 35D - Animals

We are asked to simulate a farm in which animals arrive one per day over n days. Each animal has a fixed daily food requirement starting from the day it arrives. The farm starts with X tons of food.

Practice › Codeforces Solutions › Codeforces Beta Round 35 (Div. 2) ›

CF 35E - Parade

Each skyscraper is an axis-aligned rectangle sitting on the ground. A building with parameters (h, l, r) occupies every point with l ≤ x ≤ r and 0 ≤ y ≤ h.