ambroisie/advent-of-code
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Compare commits

base: ambroisie:56a29c6d9abcd5fec2e05742063282a5b91bf287
Branches Tags
ambroisie:main
..
compare: ambroisie:aee13702a5b81973c8d9e77e1729a66aec3e66f0
Branches Tags
ambroisie:main

No commits in common. "56a29c6d9abcd5fec2e05742063282a5b91bf287" and "aee13702a5b81973c8d9e77e1729a66aec3e66f0" have entirely different histories.
56a29c6d9a ... aee13702a5

4 changed files with 0 additions and 153 deletions
Show stats Expand all files Collapse all files

66
2021/d11/ex1/ex1.py
View file

@ -1,66 +0,0 @@
#!/usr/bin/env python
import itertools
import sys
from copy import deepcopy
from typing import Iterator, List, Set, Tuple
Grid = List[List[int]]
Point = Tuple[int, int]
def solve(input: List[str]) -> int:
levels = [[int(c) for c in line] for line in input]
def step(levels: Grid) -> Tuple[Grid, int]:
# First step, increase levels
levels = [[l + 1 for l in line] for line in levels]
def excited(levels: Grid) -> Set[Point]:
return set(
(i, j)
for i in range(len(levels))
for j in range(len(levels[i]))
if levels[i][j] > 9
)
def neighbours_of(point: Point) -> Iterator[Point]:
for dx, dy in itertools.product((-1, 0, 1), repeat=2):
if dx == 0 and dy == 0:
continue
x = point[0] + dx
y = point[1] + dy
if x < 0 or x >= len(levels):
continue
if y < 0 or y >= len(levels[x]):
continue
yield x, y
# Second step, do flashes
has_flashed: Set[Point] = set()
while len(flashes := (excited(levels) - has_flashed)) > 0:
for (i, j) in flashes:
has_flashed.add((i, j))
for x, y in neighbours_of((i, j)):
levels[x][y] += 1
# Finally, bring back energy levels to 0
for i, j in has_flashed:
levels[i][j] = 0
return levels, len(has_flashed)
res = 0
for __ in range(100):
levels, flashes = step(levels)
res += flashes
return res
def main() -> None:
input = [line.strip() for line in sys.stdin.readlines()]
print(solve(input))
if __name__ == "__main__":
main()

10
2021/d11/ex1/input
View file

@ -1,10 +0,0 @@
4341347643
5477728451
2322733878
5453762556
2718123421
4237886115
5631617114
2217667227
4236581255
4482627641

67
2021/d11/ex2/ex2.py
View file

@ -1,67 +0,0 @@
#!/usr/bin/env python
import itertools
import sys
from copy import deepcopy
from typing import Iterator, List, Set, Tuple
Grid = List[List[int]]
Point = Tuple[int, int]
def solve(input: List[str]) -> int:
levels = [[int(c) for c in line] for line in input]
def step(levels: Grid) -> Tuple[Grid, int]:
# First step, increase levels
levels = [[l + 1 for l in line] for line in levels]
def excited(levels: Grid) -> Set[Point]:
return set(
(i, j)
for i in range(len(levels))
for j in range(len(levels[i]))
if levels[i][j] > 9
)
def neighbours_of(point: Point) -> Iterator[Point]:
for dx, dy in itertools.product((-1, 0, 1), repeat=2):
if dx == 0 and dy == 0:
continue
x = point[0] + dx
y = point[1] + dy
if x < 0 or x >= len(levels):
continue
if y < 0 or y >= len(levels[x]):
continue
yield x, y
# Second step, do flashes
has_flashed: Set[Point] = set()
while len(flashes := (excited(levels) - has_flashed)) > 0:
for (i, j) in flashes:
has_flashed.add((i, j))
for x, y in neighbours_of((i, j)):
levels[x][y] += 1
# Finally, bring back energy levels to 0
for i, j in has_flashed:
levels[i][j] = 0
return levels, len(has_flashed)
for i in itertools.count(1):
levels, flashes = step(levels)
if flashes == len(list(itertools.chain.from_iterable(levels))):
return i
assert False # Sanity check
def main() -> None:
input = [line.strip() for line in sys.stdin.readlines()]
print(solve(input))
if __name__ == "__main__":
main()

10
2021/d11/ex2/input
View file

@ -1,10 +0,0 @@
4341347643
5477728451
2322733878
5453762556
2718123421
4237886115
5631617114
2217667227
4236581255
4482627641