Codeforces Round 182 (Div. 1)

5 problems from Codeforces Round 182 (Div. 1) (contest 301), difficulty 1800-2800. 5/5 solutions verified against sample I/O.

5 items

Codeforces Round 182 (Div. 1)

Div. 1 | 5 problems | 5/5 verified | Difficulty 1800-2800 | 17m 11s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Yaroslav and Sequence	1800	constructive-algorithms	3,256	1m 30s	✓
B	Yaroslav and Time	2100	binary-search, graphs, shortest-paths	2,794	2m 10s	✓
C	Yaroslav and Algorithm	2500	constructive-algorithms	488	6m 58s	✓
D	Yaroslav and Divisors	2200	data-structures	3,020	2m 55s	✓
E	Yaroslav and Arrangements	2800	dp	406	3m 38s	✓

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

CF 301A - Yaroslav and Sequence

We are given an array of length (2·n - 1). Yaroslav can perform an operation any number of times where he selects exactly n elements and multiplies each by -1. Our task is to determine the maximum sum achievable by applying this operation optimally.

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

CF 301B - Yaroslav and Time

We are given a set of stations placed on a 2D grid. Moving between any two stations takes time proportional to their Manhattan distance multiplied by a constant factor $d$.

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

CF 301C - Yaroslav and Algorithm

We must construct a small string rewriting program. The program consists of ordered commands. Each command searches for a substring and replaces its first occurrence with another string. Some commands continue execution after replacement, while others terminate immediately.

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

CF 301D - Yaroslav and Divisors

We are given a permutation of numbers from 1 to n. For every query interval [l, r], we must count how many ordered pairs of positions (q, w) inside that interval satisfy: $$p[q] mid p[w]$$ Since all values are distinct and form a permutation, every number appears exactly once.

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

CF 301E - Yaroslav and Arrangements

We are given three integers. The length of the array cannot exceed n, every value must lie between 1 and m, and the number of distinct cyclic arrangements that satisfy a special adjacency rule must be between 1 and k. The adjacency rule defines a "good" array.