-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathday_5.py
79 lines (60 loc) · 1.77 KB
/
day_5.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
76
77
78
79
from utils import read_multisection_input
from collections import defaultdict
from functools import cmp_to_key
RULES = None
def map_rules(lines):
rules = []
for line in lines.split("\n"):
before, after = line.split("|")
rules.append((int(before), int(after)))
return rules
def map_updates(lines):
updates = []
for line in lines.split("\n"):
updates.append([int(n) for n in line.split(",")])
return updates
def create_rules_map(rules):
rules_map = defaultdict(list)
for before, after in rules:
rules_map[before].append(after)
return rules_map
def sort_by_rules(a, b):
if a in RULES:
if b in RULES[a]:
return -1
if b in RULES:
if a in RULES[b]:
return 1
else:
return 0
def is_in_order(update):
s_update = sorted(update, key=cmp_to_key(sort_by_rules))
return update == s_update
def sum_middle_pages(updates):
total = 0
for update in updates:
mid = len(update) // 2
total += update[mid]
return total
def part_1():
global RULES
rules, updates = read_multisection_input(5, [map_rules, map_updates])
RULES = create_rules_map(rules)
correct_updates = [update for update in updates if is_in_order(update)]
result = sum_middle_pages(correct_updates)
print(f"Part 1: {result}")
assert result == 7074
def part_2():
global RULES
rules, updates = read_multisection_input(5, [map_rules, map_updates])
RULES = create_rules_map(rules)
corrected_updates = [
sorted(update, key=cmp_to_key(sort_by_rules))
for update in updates
if not is_in_order(update)
]
result = sum_middle_pages(corrected_updates)
print(f"Part 2: {result}")
assert result == 4828
part_1()
part_2()