-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathday9.py
75 lines (59 loc) · 2.17 KB
/
day9.py
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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
import pytest
from collections import defaultdict
from itertools import permutations
@pytest.mark.parametrize('data, expected',
[
({'London': {'Dublin': 464, 'Belfast': 518},
'Dublin': {'London': 464, 'Belfast': 141},
'Belfast': {'London': 518, 'Dublin': 141}},
605),
])
def test_part1(data: dict, expected: int):
assert part1(data) == expected
@pytest.mark.parametrize('data, expected',
[
({'London': {'Dublin': 464, 'Belfast': 518},
'Dublin': {'London': 464, 'Belfast': 141},
'Belfast': {'London': 518, 'Dublin': 141}},
982),
])
def test_part2(data: dict, expected: int):
assert part2(data) == expected
def parse_input(filename: str) -> dict:
lines = [line.strip() for line in open(filename).readlines()]
routes = defaultdict(dict)
for line in lines:
city1, _, city2, _, distance = line.split(' ')
routes[city1][city2] = int(distance)
routes[city2][city1] = int(distance)
return routes
def part1(data: dict) -> int:
cities = data.keys()
num_cities = len(cities)
routes = permutations(cities)
best_distance = float('inf')
for route in routes:
distance = 0
for i in range(num_cities - 1):
distance += data[route[i]][route[i + 1]]
if distance < best_distance:
best_distance = distance
return best_distance
def part2(data: dict) -> int:
cities = data.keys()
num_cities = len(cities)
routes = permutations(cities)
best_distance = 0
for route in routes:
distance = 0
for i in range(num_cities - 1):
distance += data[route[i]][route[i + 1]]
if distance > best_distance:
best_distance = distance
return best_distance
def main():
data = parse_input('input/day9.txt')
print(f'Part 1: {part1(data)}')
print(f'Part 2: {part2(data)}')
if __name__ == "__main__":
main()