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

nix: bump flake inputs

Browse source
This commit is contained in:
Bruno BELANYI 2022-12-01 10:01:42 +01:00
parent fcb74b375f
commit 46864fc490
4 changed files with 56 additions and 13 deletions
Download patch file Download diff file Expand all files Collapse all files

4
2019/d18/ex1/ex1.py
View file

@ -65,7 +65,7 @@ def build_graph(grid: RawGrid) -> Graph:
def solve(G: Graph, start: str) -> int:
@lru_cache(2 ** 20)
@lru_cache(2**20)
def reachable_keys(src: str, found: FrozenSet[str]) -> List[Tuple[str, int]]:
queue = []
distance: DefaultDict[str, Union[float, int]] = defaultdict(lambda: inf)
@ -97,7 +97,7 @@ def solve(G: Graph, start: str) -> int:
return reachable
@lru_cache(2 ** 20)
@lru_cache(2**20)
def min_steps(
src: str, keys_to_find: int, found: FrozenSet[str] = frozenset()
) -> int:

4
2019/d18/ex2/ex2.py
View file

@ -65,7 +65,7 @@ def build_graph(grid: RawGrid) -> Graph:
def solve(G: Graph, start: str) -> int:
@lru_cache(2 ** 20)
@lru_cache(2**20)
def reachable_keys(src: str, found: FrozenSet[str]) -> GraphInfo:
queue = []
distance: DefaultDict[str, Union[float, int]] = defaultdict(lambda: inf)
@ -97,7 +97,7 @@ def solve(G: Graph, start: str) -> int:
return reachable
@lru_cache(2 ** 20)
@lru_cache(2**20)
def min_steps(
sources: str, keys_to_find: int, found: FrozenSet[str] = frozenset()
) -> Union[float, int]: