Hello !
I want to solve this problem but got WA on test 45
I use DFS and this is my code : http://paste.ubuntu.com/7587811/
what's Wrong ? please Help me!
Thank you!
№ | Пользователь | Рейтинг |
---|---|---|
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 | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Hello !
I want to solve this problem but got WA on test 45
I use DFS and this is my code : http://paste.ubuntu.com/7587811/
what's Wrong ? please Help me!
Thank you!
Название |
---|
Number of moves it has taken you to get to a certain square matters, but you don't take it into account.
why it matter?
Just try to simulate your code's behaviour on the test number 45. You'll move in a snake pattern and you'll close your way to the last column.
why in my code "just" move like snake ?
I have 2 loops! but it doesn't work well!