The answer is coming 0 instead of some positive value for some test cases Submission: https://codeforces.net/contest/1703/submission/164043486
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 166 |
| 2 | maomao90 | 163 |
| 2 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 18.11.2024 02:29:46 (h1).
Десктопная версия, переключиться на мобильную.
При поддержке
Typecast pow into long long .it might work.
when printing the answer it's not enough to take dp [ n ] [ i ] , you need to take dp [ j ] [ i ] over all n elements..
Thank you!!! This worked and also I get it why it is not enough to take dp[n][i] while calculating the final answer.
there is a case when you will not to buy a good key anymore then you will never have a negative values in the next moves , from buying the bad key you will still add to your answer either 0 or some value greater than 0 .. I hope this is clear