aboutsummaryrefslogtreecommitdiff
path: root/2015/09/puzzles.py
blob: e0d33b7d673cd8b86c4cb37d5e69ef23e3a1ced8 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
#!/usr/bin/env python3

import itertools
import re


def main() -> None:
	towns: set[str] = set()
	distances: list[tuple[str, str, int]] = []
	with open("input", "r", encoding="utf-8") as f:
		for line in f.readlines():
			f, t, d = re.match(r"(\w+) to (\w+) = (\d+)", line).groups()
			towns.update({f, t})
			distances.append((f, t, int(d)))

	print(
		# START PART 1
		min(
		# END PART 1 START PART 2
		max(
		# END PART 2
			sum(
				[d[2] for d in distances if part[0] in d and part[1] in d][0]
				for part in zip(perm, perm[1:])
			)
			for perm in itertools.permutations(towns)
		)
	)


if __name__ == "__main__":
	main()