1990A — Submission Bait
1990B — Array Craft
1990C — Mad MAD Sum
1990D — Grid Puzzle
1990E2 — Catch the Mole(Hard Version)
Not a formal proof! (please explain the formal proof of the algorithm in the comment section if you know that)
Пожалуйста, подпишитесь на официальный канал Codeforces в Telegram по ссылке https://t.me/codeforces_official.
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3880 |
| 2 | jiangly | 3669 |
| 3 | ecnerwala | 3654 |
| 4 | Benq | 3627 |
| 5 | orzdevinwang | 3612 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | jqdai0815 | 3532 |
| 9 | Radewoosh | 3522 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | adamant | 156 |
| 4 | maroonrk | 154 |
| 5 | -is-this-fft- | 148 |
| 5 | SecondThread | 148 |
| 5 | atcoder_official | 148 |
| 8 | Petr | 147 |
| 9 | TheScrasse | 145 |
| 10 | nor | 144 |
→ Найти пользователя
→ Прямой эфир
Разбор задач Codeforces Round 960 (Div. 2)
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 21.07.2024 01:27:39 (g1).
Десктопная версия, переключиться на мобильную.
При поддержке
Congrats for reaching 10K dude <3
Thank you bro <3
Why video editorial?
text editorials take time to complete , besides Shayan does some clean coding too , so its nice in the mean time.
The authors will prepare the text editorial.
Can someone please explain problem D? I understood everything in the editorial up until adding the second dimension to the dp array. I don't get that part, why do we add dp[i][j] where j can be {0,1,2,3}? And is there a way to solve this without adding this second dimension?
Problem D can be solved using greedy: https://mirror.codeforces.com/contest/1990/submission/271628945
The "A.Submission Bait" problem really lives up to its name
Problem D greedy solution with just 2 variables and one for loop: 271663296
Always color a 2x2 grid if the remaining area on a_i after a_i-1 is colored is <= 2, otherwise it is always optimal to color the entire row.
Same idea here, but tracking column indices instead: 271665697
trash ass solution. clearly codeforces is not for u lil bluh
What didn't you like about it? Maybe we can improve if u tell us so.
Please add Russian subtitles to the video