Codeforces Round 569 (Div. 1)

Solutions for Codeforces Round 569 (Div. 1) (contest 1179). 2/5 problems verified against sample I/O. Difficulty range: 1500-3200.

5 items

Codeforces Round 569 (Div. 1)

Type: Div. 1 | Problems: 5 | Verified: 2/5 | Rating range: 1500-3200 | Time: 24m 32s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Valeriy and Deque	1500	data-structures, implementation	3m 4s	✓
B	Tolik and His Uncle	1800	constructive-algorithms	3m 20s	✗
C	Serge and Dining Room	2200	binary-search, data-structures, graph-matchings	1m 22s	✓
D	Fedor Runs for President	2700	data-structures, dp, trees	6m 37s	✗
E	Alesya and Discrete Math	3200	divide-and-conquer, interactive	10m 9s	✗

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

CF 1179E - Alesya and Discrete Math

We are dealing with several functions that behave like monotone step counters on a huge integer line. Each function starts at value zero at position zero, ends at a fixed value L at position 10^18, and can only change in a very restricted way: as we move from x−1 to x, the…

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

CF 1179D - Fedor Runs for President

We are given a tree with $n$ vertices. Every pair of vertices has exactly one simple path between them. We are allowed to add exactly one extra edge between any two distinct vertices, turning the structure into a graph with one cycle.

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

CF 1179B - Tolik and His Uncle

We are given an $n times m$ grid, and we start from the top-left cell $(1,1)$. The goal is to produce a complete ordering of all grid cells such that we visit every cell exactly once, starting from $(1,1)$.

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

CF 1179A - Valeriy and Deque

We are given a deque containing n integers. Valeriy repeatedly performs an operation where he removes the first two elements, compares them, and then reinserts them: the larger of the two goes to the front, and the smaller goes to the back.

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

CF 1179C - Serge and Dining Room

We are tasked with simulating a school dining room where each dish has a single copy and each pupil buys the most expensive dish they can afford. Serge, our protagonist, wants to know which dish he will get if he waits until all pupils have made their purchases.