Rating changes for last rounds are temporarily rolled back. They will be returned soon. ×

playerBILLIONMONEY's blog

[Help] Problem UVA : 532 — Dungeon Master
By playerBILLIONMONEY, history, 3 months ago, In English

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

  • Vote: I like it
  • -3
  • Vote: I do not like it

»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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.

→ Reply
  • »
    »
    3 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    sorry but i still can't understand, could you explaint more detail (example path way from S to E in 11 minute)

    → Reply
    • »
      »
      »
      3 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      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

      → Reply