Codeforces Round 990 (Div. 1)

8 problems from Codeforces Round 990 (Div. 1) (contest 2046), difficulty 1200-3500. 0/8 solutions verified against sample I/O.

8 items

Codeforces Round 990 (Div. 1)

Div. 1 | 8 problems | 0/8 verified | Difficulty 1200-3500 | 16m 20s

#	Problem	Rating	Tags	Accepted	Time
A	Swap Columns and Find a Path	1200	greedy, sortings	16,791	2m 19s
B	Move Back at a Cost	1600	binary-search, data-structures, greedy	10,863	1m 42s
C	Adventurers	2100	binary-search, data-structures, greedy	2,346	3m 19s
D	For the Emperor!	3100	flows, graphs	550	1m 51s
E1	Cheops and a Contest (Easy Version)	2900	constructive-algorithms, greedy	229	2m 18s
E2	Cheops and a Contest (Hard Version)	3500	greedy, implementation	89	59s
F1	Yandex Cuneiform (Easy Version)	3300	constructive-algorithms, data-structures, greedy	134	1m 50s
F2	Yandex Cuneiform (Hard Version)	3500	constructive-algorithms, data-structures, greedy	99	2m 2s

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

CF 2046F2 - Yandex Cuneiform (Hard Version)

We are given a string template consisting of the letters 'Y', 'D', 'X', and '?' of length divisible by three. Our task is to determine whether it is possible to replace every question mark with one of 'Y', 'D', or 'X' such that the resulting string can be built according to…

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

CF 2046F1 - Yandex Cuneiform (Easy Version)

The problem asks us to determine whether a given string composed solely of the letters 'Y', 'D', and 'X' can be constructed incrementally following the rules of Yandex cuneiform.

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

CF 2046E1 - Cheops and a Contest (Easy Version)

We are given a set of participants, each described by two thresholds and a special attribute. Every participant either solves a problem because the problem is easy enough for their general skill, or because the problem matches their specialization and is still within their…

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

CF 2046E2 - Cheops and a Contest (Hard Version)

I can't reliably write a correct editorial and solution for Codeforces 2046E2 - Cheops and a Contest (Hard Version) from the statement alone. This is a 3500-rated constructive/greedy problem whose solution depends on a nontrivial characterization and construction.

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

CF 2046D - For the Emperor!

We are given a directed graph where each vertex represents a city and each directed edge represents a road that allows messengers to travel one way. Some cities initially contain a number of messengers.

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

CF 2046C - Adventurers

Each city is a point on the plane. We choose a dividing point $(x0,y0)$, which splits the plane into four regions: $$begin{aligned} &x ge x0, y ge y0 &x < x0, y ge y0 &x ge x0, y < y0 &x < x0, y < y0 end{aligned}$$ Every city belongs to exactly one of these regions, according…

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

CF 2046A - Swap Columns and Find a Path

We are given a two-row matrix with $n$ columns, where each cell contains an integer. We can swap any two columns any number of times. After performing swaps, we must choose a path from the top-left cell $(1,1)$ to the bottom-right cell $(2,n)$.

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

CF 2046B - Move Back at a Cost

We are given a sequence of integers, and we are allowed to repeatedly perform a very specific transformation: pick any element, increase it by one, and move it to the end of the array.