| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Hello CodeForces. I've been trying to solve this problem (505C - Mr. Kitayuta, the Treasure Hunter) for the last hour but I hit a roadblock. Here's my submission: 212193996
It uses the idea of the editorial but somehow fails testcase 5. The expected output is 16790 but my code outputs 16791.
Thanks for your interest...
Hi! I believe you should remove your two conditions: (j > 0) and (j<2*ss) in your second and third if statements (as I think they are pointless). Instead, you should check if lastjump > 1 in your second state because if your lastjump is 1, then the next one cannot be 0. These changes should make you solution pass.
Thank you so much! It passed as I applied the changes you suggested. Have a great day...
My Pleasure! Thanks, you too :)