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!
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | maspy | 150 |
| 3 | Um_nik | 145 |
| 4 | Errichto | 139 |
| 5 | adamant | 136 |
| 6 | maroonrk | 134 |
| 7 | DNR | 133 |
| 8 | nik_exists | 132 |
| 9 | AmShZ | 130 |
| 10 | Dominater069 | 129 |
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!
| Name |
|---|



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!