-
Notifications
You must be signed in to change notification settings - Fork 0
/
solver.py
57 lines (42 loc) · 1.07 KB
/
solver.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
import os
import inspect
cwd = os.path.dirname(os.path.abspath(inspect.stack()[0][1]))
with open(os.path.join(cwd, "example.txt"), "r") as f:
tiles = {
complex(i, j): col
for j, row in enumerate(f)
for i, col in enumerate(row.strip())
}
def get_directions(tile, d):
match tile:
case "/":
return (-1j / d,)
case "\\":
return (1j / d,)
case "|":
return (1j, -1j)
case "-":
return (1, -1)
case _:
return (d,)
def get_energized_count(p, d, tiles):
energized = set()
q = [(p, d)]
while q:
p, d = q.pop()
if ((p, d)) in energized:
continue
energized.add((p, d))
q.extend((p + d, d) for d in get_directions(tiles.get(p), d) if p + d in tiles)
return len({p for p, _ in energized})
# part 1
print(get_energized_count(0, 1, tiles))
# part 2
print(
max(
get_energized_count(p, d, tiles)
for p in tiles
for d in (1, 1j, -1, -1j)
if p - d not in tiles
)
)