The answer is coming 0 instead of some positive value for some test cases Submission: https://codeforces.com/contest/1703/submission/164043486
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3783 |
| 2 | jiangly | 3666 |
| 3 | tourist | 3611 |
| 4 | Um_nik | 3536 |
| 5 | inaFSTream | 3477 |
| 6 | fantasy | 3468 |
| 7 | maroonrk | 3464 |
| 8 | QAQAutoMaton | 3428 |
| 9 | ecnerwala | 3427 |
| 10 | Ormlis | 3396 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 184 |
| 2 | adamant | 178 |
| 3 | awoo | 177 |
| 4 | nor | 169 |
| 5 | maroonrk | 165 |
| 6 | -is-this-fft- | 163 |
| 7 | antontrygubO_o | 152 |
| 8 | ko_osaga | 151 |
| 9 | dario2994 | 150 |
| 10 | SecondThread | 149 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2023 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jun/07/2023 11:09:59 (j3).
Desktop version, switch to mobile version.
Supported by
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