ENG  RUSTimus 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

Xan Tei Jun What is the BruteForce Algorithm [3] // Problem 1016. Cube on the Walk 28 Oct 2009 12:09


Edited by author 28.10.2009 16:46
tiancaihb Re: What is the BruteForce Algorithm [1] // Problem 1016. Cube on the Walk 28 Oct 2009 16:48
For every point on the board, we change it into 24 different points in our graph. Every point means a state where the cube move onto it, eg (a,b) means "a" at bottom and "b" at front. Weights are the numbers on the bottom. Use dijkstra at last.
Start dfs from starting node and when you crossed through some node more than 2 then return.