Codeforces Round 681 (Div. 2, based on VK Cup 2019-2020 - Final)
Solutions for Codeforces Round 681 (Div. 2, based on VK Cup 2019-2020 - Final) (contest 1443). 2/4 problems verified against sample I/O. Difficulty range: 800-2400.
Codeforces Round 681 (Div. 2, based on VK Cup 2019-2020 - Final)
Type: Div. 2 | Problems: 4 | Verified: 2/4 | Rating range: 800-2400 | Time: 10m 8s
| Problem | Name | Rating | Tags | Solve Time | Verified |
|---|---|---|---|---|---|
| A | Kids Seating | 800 | constructive-algorithms, math | 1m 43s | ✗ |
| B | Saving the City | 1300 | dp, greedy, math | 1m 28s | ✓ |
| C | The Delivery Dilemma | 1400 | binary-search, greedy, sortings | 5m 13s | ✓ |
| E | Long Permutation | 2400 | brute-force, math, two-pointers | 1m 44s | ✗ |
CF 1443C - The Delivery Dilemma
In this problem, Petya wants to get all his birthday dishes in the minimum amount of time. For each dish, he can either pick it up himself from a restaurant, taking bi minutes, or order a delivery, which will arrive in ai minutes.
CF 1443E - Long Permutation
We are given the initial permutation of integers from 1 to $n$ in order. Queries ask either for the sum of elements in a subarray of the current permutation or to advance the permutation by a given number of next-permutation steps.
CF 1443A - Kids Seating
We are asked to seat a group of $n$ children on a line of chairs numbered from $1$ to $4n$ such that no two children can "indulge." Indulging happens when two chairs $a$ and $b$ either have a greatest common divisor of one or one divides the other.
CF 1443B - Saving the City
We are given a city represented as a line of buildings, each of which may or may not have a mine. The city map is a string of zeros and ones, where "1" indicates a mine and "0" indicates a safe building.