codemicro/adventOfCode
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Update __init__.py

Browse source
This commit is contained in:
akp 2022-12-08 11:46:44 +00:00
parent 6becab8669
commit 4e62cdd4aa
No known key found for this signature in database
GPG key ID: AA5726202C8879B7
1 changed files with 29 additions and 15 deletions
Download patch file Download diff file Expand all files Collapse all files

44
challenges/2022/08-treetopTreeHouse/py/__init__.py
View file

@ -16,7 +16,11 @@ def parse(instr: str) -> Tuple[Forest, Coordinate]:
return res, (x, y)
def are_adjacents_lower(forest: Forest, initial_pos: Coordinate, next_pos: Callable[[Coordinate], Coordinate]) -> bool:
def are_adjacents_lower(
forest: Forest,
initial_pos: Coordinate,
next_pos: Callable[[Coordinate], Coordinate],
) -> bool:
height = forest[initial_pos]
pos = next_pos(initial_pos)
while pos in forest:
@ -25,7 +29,12 @@ def are_adjacents_lower(forest: Forest, initial_pos: Coordinate, next_pos: Calla
pos = next_pos(pos)
return True
def get_viewing_distance(forest: Forest, initial_pos: Coordinate, next_pos: Callable[[Coordinate], Coordinate]) -> int:
def get_viewing_distance(
forest: Forest,
initial_pos: Coordinate,
next_pos: Callable[[Coordinate], Coordinate],
) -> int:
viewing_dist = 0
height = forest[initial_pos]
@ -38,49 +47,54 @@ def get_viewing_distance(forest: Forest, initial_pos: Coordinate, next_pos: Call
return viewing_dist
class Challenge(BaseChallenge):
class Challenge(BaseChallenge):
@staticmethod
def one(instr: str) -> int:
forest, (max_x, max_y) = parse(instr)
count = 0
for tree_pos in forest:
x, y = tree_pos
if x == 0 or y == 0 or x == max_x or y == max_y:
count += 1
continue
# left -x
if are_adjacents_lower(forest, tree_pos, lambda x: (x[0]-1, x[1])):
if are_adjacents_lower(forest, tree_pos, lambda x: (x[0] - 1, x[1])):
count += 1
continue
# right +x
if are_adjacents_lower(forest, tree_pos, lambda x: (x[0]+1, x[1])):
if are_adjacents_lower(forest, tree_pos, lambda x: (x[0] + 1, x[1])):
count += 1
continue
# up -y
if are_adjacents_lower(forest, tree_pos, lambda x: (x[0], x[1]-1)):
if are_adjacents_lower(forest, tree_pos, lambda x: (x[0], x[1] - 1)):
count += 1
continue
# down +y
if are_adjacents_lower(forest, tree_pos, lambda x: (x[0], x[1]+1)):
if are_adjacents_lower(forest, tree_pos, lambda x: (x[0], x[1] + 1)):
count += 1
continue
return count
@staticmethod
def two(instr: str) -> int:
forest, _ = parse(instr)
max_senic = 0
for tree_pos in forest:
view_left = get_viewing_distance(forest, tree_pos, lambda x: (x[0]-1, x[1]))
view_right = get_viewing_distance(forest, tree_pos, lambda x: (x[0]+1, x[1]))
view_up = get_viewing_distance(forest, tree_pos, lambda x: (x[0], x[1]-1))
view_down = get_viewing_distance(forest, tree_pos, lambda x: (x[0], x[1]+1))
view_left = get_viewing_distance(
forest, tree_pos, lambda x: (x[0] - 1, x[1])
)
view_right = get_viewing_distance(
forest, tree_pos, lambda x: (x[0] + 1, x[1])
)
view_up = get_viewing_distance(forest, tree_pos, lambda x: (x[0], x[1] - 1))
view_down = get_viewing_distance(
forest, tree_pos, lambda x: (x[0], x[1] + 1)
)
senic = view_left * view_right * view_up * view_down
if senic > max_senic: