Recently (two weeks ago) RuCode Festival 7.0 concluded.
Let's discuss the problems here.
How to solve A from DIVAB? I know how to solve most tasks, except A, C, F and L.
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3741 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3489 |
| 7 | Radewoosh | 3483 |
| 8 | Kevin114514 | 3442 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 2 | atcoder_official | 162 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | nor | 150 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/19/2024 13:37:32 (l2).
Desktop version, switch to mobile version.
Supported by
Auto comment: topic has been translated by induk_v_tsiane (original revision, translated revision, compare)
Please refrain from discussing the problems publicly until 10:00 (UTC) on this Sunday (October 29th), because this contest will be used as the next round of Universal Cup.
You can discuss the problems now. We will post an official editorial within a couple of days.
Editorial is here: https://tsweb.ru/trains/231015/231015-tutorial.en.pdf
There is a simpler solution to Shoes, without any Farach-Colton-Bender. We write the same dp, but then we notice that all diagonal requests are monotonic, and use the sliding window technique. Working code — https://pastebin.com/yADA7VhC.
Nice!!