gaugendre/advent-of-code
1
0
Fork 0
mirror of https://github.com/Crocmagnon/advent-of-code.git synced 2024-11-24 23:48:13 +01:00
Code Issues Projects Releases Packages Wiki Activity

Solve day13 part 2

Browse source
This commit is contained in:
Gabriel Augendre 2022-12-16 12:19:56 +01:00
parent ee84b28f5a
commit 94521523db
1 changed files with 21 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

24
2022/day13_distress.py
View file

@ -1,6 +1,7 @@
from __future__ import annotations from __future__ import annotations
import ast import ast
from functools import cmp_to_key
def main(filename: str, expected_part_1: int = None, expected_part_2: int = None): def main(filename: str, expected_part_1: int = None, expected_part_2: int = None):
@ -69,10 +70,27 @@ def lower_than(left: list, right: list) -> bool | None: # noqa: C901
return len(left) < len(right) return len(left) < len(right)
def cmp(left: list, right: list) -> int:
if lower_than(left, right):
return -1
else:
return 1
def solve_part_2(data: DataType) -> int: def solve_part_2(data: DataType) -> int:
return 0 dividers = [[[2]], [[6]]]
packets = dividers[::]
for left, right in data:
packets.append(left)
packets.append(right)
packets.sort(key=cmp_to_key(cmp))
indices = []
for index, packet in enumerate(packets):
if packet in dividers:
indices.append(index + 1)
return indices[0] * indices[1]
if __name__ == "__main__": if __name__ == "__main__":
main("inputs/day13-test1", expected_part_1=13) main("inputs/day13-test1", expected_part_1=13, expected_part_2=140)
main("inputs/day13", expected_part_1=5503) main("inputs/day13", expected_part_1=5503, expected_part_2=20952)