Every year, Santa manages to deliver all of his presents in a single night.
This year, however, he has some new locations to visit; his elves have provided him the distances between every pair of locations. He can start and end at any two (different) locations he wants, but he must visit each location exactly once. What is the shortest distance he can travel to achieve this?
For example, given the following distances:
London to Dublin = 464
London to Belfast = 518
Dublin to Belfast = 141The possible routes are therefore:
Dublin -> London -> Belfast = 982
London -> Dublin -> Belfast = 605
London -> Belfast -> Dublin = 659
Dublin -> Belfast -> London = 659
Belfast -> Dublin -> London = 605
Belfast -> London -> Dublin = 982The shortest of these is London -> Dublin -> Belfast = 605, and so the answer is 605 in this example.
What is the distance of the shortest route? )
In [1]:
input=: (0 2 4 { ;:);._2 freads '~AoC/2015/aoc09_input.txt'
Locs=: ~. , 2{."1 input
Trips=: <"1 Locs i. 2 {."1 input
Distances=: _99 ". > {:"1 input
Routes=: 2 <@/:~\"1 (i.@!@# A. ]) i.#Locs
echo 'Day9 Part1: ',": <./ +/"1 Distances {~ Trips i. Routes
The next year, just to show off, Santa decides to take the route with the longest distance instead.
He can still start and end at any two (different) locations he wants, and he still must visit each location exactly once.
For example, given the distances above, the longest route would be 982 via (for example) Dublin -> London -> Belfast.
What is the distance of the longest route?
In [2]:
echo 'Day9 Part2: ',": >./ +/"1 Distances {~ Trips i. Routes