Files
python-aoc-2022/day12/part1.min.py
Sebastian Seedorf abe76c0d38 Day 13
2022-12-14 09:41:49 +01:00

31 lines
830 B
Python

#!/usr/bin/env python3
import numpy as np
lines = np.array([np.array([ord(y) for y in x.strip()]) for x in open("input.txt")])
start = tuple(np.array(np.where(lines == ord('S'))).T[0])
end = tuple(np.array(np.where(lines == ord('E'))).T[0])
lines[start] = ord('a')
lines[end] = ord('z')
lines = lines-ord('a')
open = [(start, None)]
closed = dict()
while open:
n, prev = open.pop(0)
if n in closed:
continue
closed[n] = prev
if n == end:
path = [n]
while path[-1] is not None:
path.append(closed[path[-1]][1])
print(len(path)-2)
break
for dx, dy in [(-1, 0), (0, -1), (1, 0), (0, 1)]:
xn, yn = n[0]+dx, n[1]+dy
if 0 <= xn < len(lines) and 0 <= yn < len(lines[0]) and lines[n] + 1 >= lines[xn, yn]:
open.append(((xn, yn), n))