AdventOfCode2022/08.py at master · garbidge/AdventOfCode2022 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
from math import prod

def checkDirections(grid, x, y, dx, dy):
    score, height = 0, grid[y][x]
    x, y = x+dx, y+dy
    while 0 <= x < len(grid[0]) and 0 <= y < len(grid):
        score += 1
        if grid[y][x] >= height: return (score, False)
        x, y = x+dx, y+dy
    return (score, True)

def checkTree(grid, x, y):
    results = [checkDirections(grid, x, y, dx, dy) for dx,dy in [(-1,0),(1,0),(0,-1),(0,1)]]
    visible = any(visible for score,visible in results)
    score = prod(score for score,visible in results)
    return (score, visible)

grid = [[int(n) for n in line.strip()] for line in open('in/08.txt')]
checked = [checkTree(grid, x, y) for x in range(len(grid[0])) for y in range(len(grid))]
print('part1:', sum(visible for score,visible in checked))
print('part2:', max(score for score,visible in checked))