Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2)
10 problems from Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) (contest 1209), difficulty 800-3300. 6/10 solutions verified against sample I/O.
Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2)
Div. 1+2 | 10 problems | 6/10 verified | Difficulty 800-3300 | 35m 55s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Paint the Numbers | 800 | greedy, implementation, math | 12,841 | 1m 41s | ✓ |
| B | Koala and Lights | 1300 | implementation, math, number-theory | 8,515 | 11m 21s | ✓ |
| C | Paint the Digits | 1500 | constructive-algorithms, greedy, implementation | 7,859 | 3m 18s | |
| D | Cow and Snacks | 1700 | dfs-and-similar, dsu, graphs | 10,722 | 2m 49s | ✓ |
| E1 | Rotate Columns (easy version) | 2000 | bitmasks, brute-force, dp | 3,250 | 1m 58s | ✓ |
| E2 | Rotate Columns (hard version) | 2500 | bitmasks, dp, greedy | 2,299 | 4m 14s | |
| F | Koala and Notebook | 2600 | data-structures, dfs-and-similar, graphs | 1,364 | 4m 29s | |
| G1 | Into Blocks (easy version) | 2000 | data-structures, dsu, greedy | 3,952 | 1m 44s | ✓ |
| G2 | Into Blocks (hard version) | 3200 | data-structures | 528 | 2m 49s | |
| H | Moving Walkways | 3300 | data-structures, greedy, math | 230 | 1m 32s | ✓ |
CF 1209E2 - Rotate Columns (hard version)
We are given a grid with a small number of rows and a potentially large number of columns. The only operation allowed is to take any single column and rotate it cyclically any number of times.
CF 1209F - Koala and Notebook
We are given an undirected connected graph with up to 100,000 cities and roads, where each road has a unique identifier from 1 to m. Koala starts at city 1 and travels through the graph.
CF 1209G2 - Into Blocks (hard version)
We are given an array that evolves over time through point updates. After each modification, we must compute a value called the difficulty of the array, which measures how far the array is from being representable as a sequence of contiguous uniform blocks.
CF 1209C - Paint the Digits
We are given a sequence of digits and we must assign each position one of two labels, 1 or 2. After labeling, we form a new sequence by taking all digits labeled 1 in their original order, followed by all digits labeled 2 in their original order.
CF 1209D - Cow and Snacks
We are given a collection of snack types and a group of guests. Each snack type appears exactly once, so there are $n$ distinct items labeled $1$ to $n$. Each guest has two preferred snack types.
CF 1209B - Koala and Lights
Each light in this problem behaves like a binary switch that flips its state over time. You are given an initial configuration where each light is either on or off.
CF 1209H - Moving Walkways
We are asked to move along a straight line from position 0 to position L. The segment is split into ordinary parts and several disjoint special intervals called walkways. Each walkway covers a subsegment $[xi, yi]$ and provides a constant speed bonus $si$.
CF 1209G1 - Into Blocks (easy version)
We are asked to transform a given sequence of integers into a "nice" sequence. A sequence is nice if all occurrences of the same number appear in contiguous blocks. For example, [3, 3, 1, 1, 2] is nice, but [3, 1, 3] is not because the 3s are split by 1.
CF 1209E1 - Rotate Columns (easy version)
We are given a matrix with n rows and m columns, where each entry is a positive integer. We can pick any column and rotate it cyclically any number of times. After performing such rotations, we consider each row and take the maximum value in that row.
CF 1209A - Paint the Numbers
We are given a list of integers, and we want to partition them into as few groups as possible. Each group has a structural constraint: if you look at the smallest number inside that group, every other number assigned to the same group must be divisible by that smallest number.