Can anyone please tell me where I am going wrong with this? Whenever my last move is not air, I move to air and when the last move is air, I find the maximum time on performing water or fire move. I am a beginner at dp, so any suggestion would help. Thanks. Question | My submission
→ Обратите внимание
До соревнования
Rayan Programming Contest 2024 - Selection (Codeforces Round, Div. 1 + Div. 2)
4 дня
Зарегистрироваться »
Rayan Programming Contest 2024 - Selection (Codeforces Round, Div. 1 + Div. 2)
4 дня
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 155 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | nor | 152 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 26.11.2024 19:25:39 (f1).
Десктопная версия, переключиться на мобильную.
При поддержке
in line 8, you should write 1 in place of 2 my solution
It shouldn't matter, as long as it is not 0 it will produce the same output for (last!=0). Also, I ran your code , it gives the exact same result as mine but your code got accepted in SPOJ checker but mine didn't. Can anyone explain what is wrong with my code?
Your code is working fine. For each testcase just reassign the DP array to -1. You only assigned it before taking the input . So for a particular H ,A your solve method is peeking into some other (H,A) previously calculated states. That's why your solution got wrong answer .
It did work, thanks a lot. But I still have a doubt, wouldn't the answer from every state (i,j) be the same? I do not understand to reinitialize the dp vector, couldn't I reuse the dp vector from the previous test case and just fill in the empty states, building on top of the states that I have already calculated? Amit_kr31 's solution does the same thing(i.e. builds on previously calculated states) but it got accepted when I tried.
He is assigning all states . See his Implementation carefully and furthermore increase your DP dimension to 3 (ex Dp[2000][2000][2] ) because answer will vary if last is 0 or 1 according to your Implementation. This way you might not need to reassign Dp to -1.