24 lines
539 B
Python
24 lines
539 B
Python
|
import fileinput
|
||
|
from itertools import permutations
|
||
|
|
||
|
|
||
|
def main():
|
||
|
graph = {}
|
||
|
cities = set()
|
||
|
|
||
|
for line in fileinput.input():
|
||
|
route, distance = line.split(" = ", 1)
|
||
|
source, dest = route.split(" to ", 1)
|
||
|
graph[(source, dest)] = graph[(dest, source)] = int(distance)
|
||
|
cities.add(source)
|
||
|
cities.add(dest)
|
||
|
|
||
|
lengths = [
|
||
|
sum(graph[(route[i], route[i + 1])] for i in range(len(route) - 1))
|
||
|
for route in permutations(cities)
|
||
|
]
|
||
|
|
||
|
print(min(lengths), max(lengths))
|
||
|
|
||
|
main()
|