-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path18-1.py
executable file
·112 lines (85 loc) · 3.45 KB
/
18-1.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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
#!/usr/bin/env python
from math import ceil, floor
class Snailfish:
def __init__(self, pair):
if isinstance(pair, str):
pair = eval(pair)
self.pair = pair
def __add__(self, other):
p = Snailfish([self.pair, other.pair])
return p.reduce()
def reduce(self):
while True:
did_explode, new_pair = self.explode(self.pair)
self.pair = new_pair
if did_explode:
continue
did_split, new_pair = self.split(self.pair)
self.pair = new_pair
if did_split:
continue
break
return self
def increase_rightmost(self, element, increase):
if isinstance(element, int):
return element + increase
return [element[0], self.increase_rightmost(element[1], increase)]
def increase_leftmost(self, element, increase):
if isinstance(element, int):
return element + increase
return [self.increase_leftmost(element[0], increase), element[1]]
def inner_explode(self, element, level):
if level == 5 and isinstance(element, list):
return (True, 0, element[0], element[1])
elif isinstance(element, int):
return (False, element, None, None)
else:
new_right = element[1]
did_explode_left, new_left, propagate_left, propagate_right = self.inner_explode(element[0], level + 1)
if did_explode_left and propagate_right is not None and propagate_right > 0:
new_right = self.increase_leftmost(element[1], propagate_right)
propagate_right = 0
did_explode_right = False
if not did_explode_left:
did_explode_right, new_right, propagate_left, propagate_right = self.inner_explode(element[1], level + 1)
if did_explode_right and propagate_left is not None and propagate_left > 0:
new_left = self.increase_rightmost(element[0], propagate_left)
propagate_left = 0
return (
did_explode_left or did_explode_right,
[new_left, new_right],
propagate_left,
propagate_right
)
def explode(self, pair):
did_explode, new_pair, _, _ = self.inner_explode(pair, 1)
return (did_explode, new_pair)
def split(self, element):
if isinstance(element, int) and element >= 10:
return (True, [floor(element / 2), ceil(element / 2)])
elif isinstance(element, int):
return (False, element)
else:
did_split_left, new_left = self.split(element[0])
did_split_right = False
new_right = element[1]
if not did_split_left:
did_split_right, new_right = self.split(element[1])
return (
did_split_left or did_split_right,
[new_left, new_right]
)
def magnitude(self, element):
if isinstance(element, int):
return element
else:
return 3 * self.magnitude(element[0]) + 2 * self.magnitude(element[1])
def score(self):
return self.magnitude(self.pair)
def __str__(self):
return f"<{self.__class__.__name__}: {self.pair}>"
numbers = [Snailfish(line.strip()) for line in open('18.input').readlines()]
collect = numbers[0]
for number in numbers[1:]:
collect += number
print(collect.score())