-
Notifications
You must be signed in to change notification settings - Fork 0
/
day10.py
182 lines (164 loc) · 5.53 KB
/
day10.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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
from collections import defaultdict
from itertools import count, repeat
import numpy as np
def day10(inp):
sketch = np.array([list(line) for line in inp.strip().splitlines()])
start = np.array([arr.item() for arr in (sketch == 'S').nonzero()])
# a given pipe always means a step along current heading
# and an optional heading change
deltas = {
'd': [1, 0],
'u': [-1, 0],
'l': [0, -1],
'r': [0, 1],
}
new_headings = {
'|': {'d': 'd', 'u': 'u'},
'-': {'r': 'r', 'l': 'l'},
'L': {'d': 'r', 'l': 'u'},
'J': {'d': 'l', 'r': 'u'},
'7': {'u': 'l', 'r': 'd'},
'F': {'u': 'r', 'l': 'd'},
}
left_turns = defaultdict(int)
left_turns.update({
('d', 'r'): 1,
('d', 'l'): -1,
('u', 'l'): 1,
('u', 'r'): -1,
('r', 'u'): 1,
('r', 'd'): -1,
('l', 'd'): 1,
('l', 'u'): -1,
})
# assume that S is only connected in one direction (no ambiguity at start)
for heading in 'dulr':
next_pos = start + deltas[heading]
if (next_pos < 0).any() or (next_pos >= sketch.shape).any():
# can't go that way
continue
next_tile = sketch[tuple(next_pos)]
if heading in new_headings[next_tile]:
# we have a valid connection
break
else:
raise ValueError('No valid initial heading found...')
# so we start from the start with known heading, walk the pipe
pos = start.copy()
initial_heading = heading
loop_tiles = {tuple(pos)} # tile positions that are in the loop
rotations = 0 # number of 90 degree left turns
for loop_length in count(1):
pos += deltas[heading]
next_tile = sketch[tuple(pos)]
if next_tile == 'S':
# we're done
break
loop_tiles.add(tuple(pos))
new_heading = new_headings[next_tile][heading]
# keep track of rotations for loop orientation
rotations += left_turns[heading, new_heading]
heading = new_heading
# fill in 'S' tile to close loop
rotations += left_turns[heading, initial_heading]
# rotations == 4 for a left-turning loop, -4 for right-turning loop, starting with initial_heading
lefty = rotations // 4 == 1
part1 = loop_length // 2
# part 2: check tiles on the "inside" side of the loop and flood fill
pos = start.copy()
heading = initial_heading
inside_seeds = set()
while True:
pos += deltas[heading]
next_tile = sketch[tuple(pos)]
if next_tile == 'S':
# we're done
break
seed_poses = []
if next_tile == '|':
if (heading == 'd' and lefty) or (heading == 'u' and not lefty):
# O|I
seed_poses = [pos + [0, 1]]
else:
# I|O
seed_poses = [pos + [0, -1]]
elif next_tile == '-':
if (heading == 'r' and lefty) or (heading == 'l' and not lefty):
# I
# -
# O
seed_poses = [pos + [-1, 0]]
else:
# O
# -
# I
seed_poses = [pos + [1, 0]]
elif next_tile == 'L':
if (heading == 'd' and lefty) or (heading == 'l' and not lefty):
#
# O L
# O O
pass
else:
#
# I L
# I I
seed_poses = [pos + [1, 0], pos + [0, -1], pos + [1, -1]]
elif next_tile == 'J':
if (heading == 'r' and lefty) or (heading == 'd' and not lefty):
#
# J O
# O O
pass
else:
#
# J I
# I I
seed_poses = [pos + [1, 0], pos + [0, 1], pos + [1, 1]]
elif next_tile == '7':
if (heading == 'u' and lefty) or (heading == 'r' and not lefty):
#
# O O
# 7 O
pass
else:
#
# I I
# 7 I
seed_poses = [pos + [-1, 0], pos + [0, 1], pos + [-1, 1]]
elif next_tile == 'F':
if (heading == 'l' and lefty) or (heading == 'u' and not lefty):
#
# O O
# O F
pass
else:
#
# I I
# I F
seed_poses = [pos + [-1, 0], pos + [0, -1], pos + [-1, -1]]
for seed_pos in map(tuple, seed_poses):
if seed_pos not in loop_tiles:
# seed_pos is inside the loop
# (no chance for out of bounds indices here)
inside_seeds.add(seed_pos)
heading = new_headings[next_tile][heading]
# now flood fill indices starting from inside seeds
inside_inds = set()
while inside_seeds:
seed = inside_seeds.pop()
inside_inds.add(seed)
for delta in deltas.values():
neighb = tuple(seed + np.array(delta))
if neighb in loop_tiles | inside_inds:
# hit the loop or already visited inside tile
continue
inside_seeds.add(neighb)
part2 = len(inside_inds)
return part1, part2
if __name__ == "__main__":
testinp = open('day10.testinp').read()
testinp2 = open('day10.testinp2').read()
print(day10(testinp)[0], day10(testinp2)[1])
inp = open('day10.inp').read()
print(*day10(inp))