Codeforces Round 179 (Div. 1)

Solutions for Codeforces Round 179 (Div. 1) (contest 295). 4/4 problems verified against sample I/O. Difficulty range: 1700-2500.

4 items

Codeforces Round 179 (Div. 1)

Type: Div. 1 | Problems: 4 | Verified: 4/4 | Rating range: 1700-2500 | Time: 11m 55s

Problem	Name	Rating	Tags	Solve Time	Verified
B	Greg and Graph	1700	dp, graphs, shortest-paths	6m 5s	✓
C	Greg and Friends	2100	combinatorics, dp, graphs	2m 44s	✓
D	Greg and Caves	2400	combinatorics, dp	1m 37s	✓
E	Yaroslav and Points	2500	data-structures	1m 29s	✓

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

CF 295B - Greg and Graph

We are given a fully connected directed graph with weighted edges, represented as an adjacency matrix. Each vertex has an edge to every other vertex, including a zero-weight self-loop. Greg wants to play a game where he removes vertices one by one according to a given sequence.

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

CF 295C - Greg and Friends

We are given a group of $n$ people standing on one river bank. Each person has a weight of either 50 or 100, and a boat that can carry a limited total weight $k$.

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

CF 295D - Greg and Caves

We are counting colorings of an $n times m$ grid with black and white cells that form a very specific geometric structure. Most rows are completely white. There is one contiguous block of rows, say from row $l$ to row $r$, where every row contains exactly two black cells.

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

CF 295E - Yaroslav and Points

We are given a set of n points positioned on a one-dimensional number line. Each point has a unique coordinate, and these coordinates can be very large in absolute value, up to 10^9.