-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathday1.py
56 lines (39 loc) · 1.18 KB
/
day1.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
import sys
from typing import Counter
def read_input() -> str:
if len(sys.argv) > 1:
with open(sys.argv[1]) as f:
data = f.read()
else:
data = sys.stdin.read()
return data
def parse_lists(data: str) -> tuple[list[int], list[int]]:
l1, l2 = [], []
for line in data.splitlines():
v1, v2 = map(int, line.split())
l1.append(v1)
l2.append(v2)
return l1, l2
def distance_between_lists(l1: list[int], l2: list[int]) -> int:
return sum(abs(a - b) for a, b, in zip(sorted(l1), sorted(l2)))
def part_1():
print("day 1")
data = read_input()
print("data: ", len(data))
l1, l2 = parse_lists(data)
print("parsed: " , len(l1), len(l2))
d = distance_between_lists(l1, l2)
print("Answer: ", d)
def similarity(left: list[int], right: list[int]) -> int:
frequency = Counter(right)
return sum(v * frequency[v] for v in left)
def part_2():
print("part 2")
data = read_input()
print("data: ", len(data))
left, right = parse_lists(data)
print("parsed: ", len(left), len(right))
s = similarity(left, right)
print("Answer: ", s)
if __name__ == "__main__":
part_2()