Codeforces Round 179 (Div. 1)

5 problems from Codeforces Round 179 (Div. 1) (contest 295), difficulty 1400-2500. 5/5 solutions verified against sample I/O.

5 items

Codeforces Round 179 (Div. 1)

Div. 1 | 5 problems | 5/5 verified | Difficulty 1400-2500 | 9m 58s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Greg and Array	1400	data-structures, implementation	25,983	1m 14s	✓
B	Greg and Graph	1700	dp, graphs, shortest-paths	17,615	1m 25s	✓
C	Greg and Friends	2100	combinatorics, dp, graphs	1,939	3m 38s	✓
D	Greg and Caves	2400	combinatorics, dp	740	1m 22s	✓
E	Yaroslav and Points	2500	data-structures	818	2m 19s	✓

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

CF 295A - Greg and Array

We are given an array of integers, and we need to perform multiple operations on ranges of this array. Each operation specifies a contiguous segment of the array and a value to add to every element in that segment.

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

CF 295C - Greg and Friends

Every person weighs either 50 kg or 100 kg. A boat starts on the left bank and can carry any non-empty group whose total weight does not exceed the boat limit. Somebody inside the boat must steer it, so every crossing contains at least one passenger.

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

CF 295E - Yaroslav and Points

We have a set of points on the number line. Each point has an identity, so when an update says "move point p by d", only that specific point changes position. There are two operations.

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

CF 295D - Greg and Caves

We are asked to count the number of ways to paint a rectangle of size n by m with black and white cells so that it forms a "cave." In practical terms, each row can either be all white or have exactly two black cells.

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

CF 295B - Greg and Graph

We are given a complete weighted directed graph with n vertices, represented as an adjacency matrix. Each entry a[i][j] is the weight of the edge from vertex i to vertex j. The graph is complete, so every pair of distinct vertices has an edge in both directions.