plais/advent-of-code-2021
1
0
Fork 0
Code Projects Releases Activity

Rename a variable
All checks were successful
continuous-integration/drone/push Build is passing
Details

Browse Source
This commit is contained in:
Pascal Lais
2021-12-16 16:53:25 +01:00
parent d16807f80d
commit 86665d264a
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
day-15/day-15.py
View File

@@ -61,13 +61,13 @@ def part_2(input):
if not (x, y) in done: if not (x, y) in done:
next.add((x, y)) next.add((x, y))
for (x, y) in next: for (x, y) in next:
next_cost = nodes[(x % x_size, y % y_size)] + \ next_node_cost = nodes[(x % x_size, y % y_size)] + \
(x // x_size) + (y // y_size) (x // x_size) + (y // y_size)
if next_cost > 9: if next_node_cost > 9:
next_cost -= 9 next_node_cost -= 9
if not (x, y) in cost or (cur_cost + next_cost) < cost[(x, y)]: if not (x, y) in cost or (cur_cost + next_node_cost) < cost[(x, y)]:
cost[(x, y)] = cur_cost + next_cost cost[(x, y)] = cur_cost + next_node_cost
heappush(queue, (cur_cost + next_cost, (x, y))) heappush(queue, (cur_cost + next_node_cost, (x, y)))
done.add(current) done.add(current)
result = cost[end] result = cost[end]
print("Part 2 result:", result) print("Part 2 result:", result)