Codeforces Round 740 (Div. 2, based on VK Cup 2021 - Final (Engine))
3 problems from Codeforces Round 740 (Div. 2, based on VK Cup 2021 - Final (Engine)) (contest 1561), difficulty 800-1700. 2/3 solutions verified against sample I/O.
Codeforces Round 740 (Div. 2, based on VK Cup 2021 - Final (Engine))
Div. 2 | 3 problems | 2/3 verified | Difficulty 800-1700 | 10m 18s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Simply Strange Sort | 800 | brute-force, implementation, sortings | 17,167 | 2m 40s | ✓ |
| C | Deep Down Below | 1300 | binary-search, greedy, sortings | 21,396 | 1m 39s | ✓ |
| D1 | Up the Strip (simplified version) | 1700 | brute-force, data-structures, dp | 6,113 | 5m 59s |
CF 1561D1 - Up the Strip (simplified version)
We are standing on a vertical strip of numbered cells from 1 at the top down to n at the bottom. A token starts at cell n, and we repeatedly move it upward until it reaches cell 1.
CF 1561A - Simply Strange Sort
We are given a permutation, meaning an array containing every integer from 1 to n exactly once. The process repeatedly applies a deterministic “strange bubble pass” operation, but with a twist: odd-numbered rounds compare adjacent pairs starting from index 1, 3, 5, and…
CF 1561C - Deep Down Below
We are given a hero facing a sequence of caves. Each cave contains a number of monsters, each with an armor value, and the hero can defeat a monster only if his current power is strictly greater than the monster's armor.