69 lines
1.9 KiB
Python
Executable file
69 lines
1.9 KiB
Python
Executable file
#!/usr/bin/env python
|
|
|
|
import enum
|
|
import itertools
|
|
import sys
|
|
from collections.abc import Iterator
|
|
from typing import NamedTuple
|
|
|
|
|
|
class Point(NamedTuple):
|
|
x: int
|
|
y: int
|
|
|
|
def neighbours(self) -> Iterator["Point"]:
|
|
for dx, dy in itertools.product(range(-1, 1 + 1), repeat=2):
|
|
if dx == 0 and dy == 0:
|
|
continue
|
|
yield Point(self.x + dx, self.y + dy)
|
|
|
|
|
|
class Cell(enum.StrEnum):
|
|
OPEN = "."
|
|
TREE = "|"
|
|
LUMBERYARD = "#"
|
|
|
|
|
|
def solve(input: str) -> int:
|
|
def parse(input: list[str]) -> dict[Point, Cell]:
|
|
return {
|
|
Point(x, y): Cell(c)
|
|
for x, line in enumerate(input)
|
|
for y, c in enumerate(line)
|
|
}
|
|
|
|
def step_cell(p: Point, grid: dict[Point, Cell]) -> Cell:
|
|
neighbours = (n for n in p.neighbours() if n in grid)
|
|
if grid[p] == Cell.OPEN:
|
|
trees = sum(grid[n] == Cell.TREE for n in neighbours)
|
|
return Cell.TREE if trees >= 3 else Cell.OPEN
|
|
if grid[p] == Cell.TREE:
|
|
lumberyards = sum(grid[n] == Cell.LUMBERYARD for n in neighbours)
|
|
return Cell.LUMBERYARD if lumberyards >= 3 else Cell.TREE
|
|
if grid[p] == Cell.LUMBERYARD:
|
|
continues = {Cell.TREE, Cell.LUMBERYARD} <= {grid[n] for n in neighbours}
|
|
return Cell.LUMBERYARD if continues else Cell.OPEN
|
|
assert False # Sanity check
|
|
|
|
def step(grid: dict[Point, Cell]) -> dict[Point, Cell]:
|
|
res: dict[Point, Cell] = {}
|
|
for p in map(Point._make, itertools.product(range(50), repeat=2)):
|
|
res[p] = step_cell(p, grid)
|
|
return res
|
|
|
|
grid = parse(input.splitlines())
|
|
for _ in range(10):
|
|
grid = step(grid)
|
|
trees = sum(c == Cell.TREE for c in grid.values())
|
|
lumberyards = sum(c == Cell.LUMBERYARD for c in grid.values())
|
|
return trees * lumberyards
|
|
|
|
|
|
def main() -> None:
|
|
input = sys.stdin.read()
|
|
print(solve(input))
|
|
|
|
|
|
if __name__ == "__main__":
|
|
main()
|