ENG
RUS
Timus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board
Discussion of Problem
1016
. Cube on the Walk
AC
Posted by
linjek
9 Aug 2014 16:51
You can solve that with algo Djikstra.
We have 6!*8*8 vertex (hash of cube and point) .
And all vertexs have <=4 edges.
P.s. sry for English )
Edited by author 09.08.2014 16:51
© 2000–2024
Timus Online Judge Team
. All rights reserved.