Codeforces Round 252 (Div. 2)

5 problems from Codeforces Round 252 (Div. 2) (contest 441), difficulty 1000-2400. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 252 (Div. 2)

Div. 2 | 5 problems | 2/5 verified | Difficulty 1000-2400 | 7m 9s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Valera and Antique Items	1000	implementation	19,290	1m 21s	✓
B	Valera and Fruits	1400	greedy, implementation	7,510	1m 21s	✓
C	Valera and Tubes	1500	constructive-algorithms, dfs-and-similar, implementation	11,921	1m 35s
D	Valera and Swaps	2100	constructive-algorithms, dsu, graphs	1,200	1m 26s
E	Valera and Number	2400	bitmasks, dp, math	816	1m 26s

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

CF 441B - Valera and Fruits

Valera has a garden with a number of fruit trees, each producing a specific number of fruits on a particular day. Each fruit becomes collectible on its ripening day and remains fresh only for the next day.

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

CF 441E - Valera and Number

Valera starts with a number $x$ and performs $k$ random operations on it. On each step, he flips a biased coin: with probability $p/100$, he doubles the current number, otherwise he increments it by one.

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

CF 441C - Valera and Tubes

We are given an $n times m$ grid where every cell must be partitioned into exactly $k$ simple paths. Each path, called a tube, must contain at least two cells and must move only through edge-adjacent cells, never revisiting a cell.

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

CF 441A - Valera and Antique Items

Valera wants to buy exactly one antique item from a set of sellers. Each seller offers multiple items with a current auction price. Valera can only secure a deal if he offers strictly more than the current price of an item, and he has a fixed budget v.

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

CF 441D - Valera and Swaps

We are given a permutation, which we can think of as a row of numbered positions, where each position contains a distinct value from 1 to n. A swap operation exchanges two positions, and after a sequence of swaps we obtain another permutation.