I tried many times, but I still don’t understand the test case. Could someone please explain it to me? Thank you so much!
https://onlinejudge.org/external/5/532.pdf


| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
I tried many times, but I still don’t understand the test case. Could someone please explain it to me? Thank you so much!
https://onlinejudge.org/external/5/532.pdf


| Name |
|---|



This problem is the 3D version of finding the shortest path between two cells in a 2D grid. The dungeon is given to you in layers since it is 3D.
sorry but i still can't understand, could you explaint more detail (example path way from S to E in 11 minute)
First layer:go to cell (4, 4), that takes 8 minutes then go up, that takes 1 minute, now you are on the second layer in cell (4, 4) Second layer:go right to cell (4, 5), and then up, that takes two minutes Now you are on the third layer and in the end cell Total:11 minutes
okay i was understand, thank you so much