day 17 py; Dijkstra's algorithm #64
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
I suspect if I record the starting point and stop considering and just update all existing start/stop map, it'll save even more time. |
|
It looks like I might be stumbling on a Dijkstra's algorithm solution except I didn't think of a weighted graph case and simply used deque for a WFS. Trying priority queue and it reduced the total time to 2second. It makes sense to put the loss as a score in priorty queue and consider first in its pop out. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Fun problem.
I basically used a FIFO to record the optimal scenario for each tile, considering the history(direction that that went into this tile and that's the nth step(1..3..10) of a straight line.
It took 60 second for solution 1 and 80 seconds for solution 2.