Codeforces Round 135 (Div. 2)

5 problems from Codeforces Round 135 (Div. 2) (contest 219), difficulty 1000-2200. 5/5 solutions verified against sample I/O.

5 items

Codeforces Round 135 (Div. 2)

Div. 2 | 5 problems | 5/5 verified | Difficulty 1000-2200 | 6m 25s

#	Problem	Rating	Tags	Accepted	Time	✓
A	k-String	1000	implementation, strings	32,297	1m 22s	✓
B	Special Offer! Super Price 999 Bourles!	1400	implementation	6,150	1m 29s	✓
C	Color Stripe	1600	brute-force, dp, greedy	7,156	1m 3s	✓
D	Choosing Capital for Treeland	1700	dfs-and-similar, dp, graphs	12,478	1m 16s	✓
E	Parking Lot	2200	data-structures	697	1m 15s	✓

Practice › Codeforces Solutions › Codeforces Round 135 (Div. 2) ›

CF 219C - Color Stripe

We are given a stripe represented as a row of n cells, where each cell is painted one of k colors labeled with letters A through the k-th letter. The goal is to repaint as few cells as possible so that no two adjacent cells share the same color.

Practice › Codeforces Solutions › Codeforces Round 135 (Div. 2) ›

CF 219D - Choosing Capital for Treeland

We are asked to choose a capital city in a tree-shaped country with one-way roads. Each city is a node, and each road is a directed edge. The goal is to orient all roads so that from the chosen capital, we can reach every other city by following the roads in their direction.

Practice › Codeforces Solutions › Codeforces Round 135 (Div. 2) ›

CF 219E - Parking Lot

We have a linear parking lot with n spaces numbered from 1 to n. Cars arrive and depart over time. When a car arrives, we must assign it a spot that maximizes the distance to the nearest occupied space.

Practice › Codeforces Solutions › Codeforces Round 135 (Div. 2) ›

CF 219A - k-String

We are given a lowercase string and an integer k. We may rearrange the letters however we want. The goal is to build a new string that consists of exactly k identical blocks placed one after another.

Practice › Codeforces Solutions › Codeforces Round 135 (Div. 2) ›

CF 219B - Special Offer! Super Price 999 Bourles!

Polycarpus already knows the best regular price for his product, p. He is willing to reduce it by at most d bourles if that gives the final price a more attractive ending, specifically as many trailing nines as possible. A trailing nine means a digit 9 at the end of the number.