2020: d22: ex2: add solution

This commit is contained in:
Bruno BELANYI 2020-12-22 13:59:13 +01:00
parent bd8b216cf2
commit 8c30df4da9

57
2020/d22/ex2/ex2.py Executable file
View file

@ -0,0 +1,57 @@
#!/usr/bin/env python
import itertools
import sys
from collections import deque
from typing import Deque, List, Set, Tuple
Deck = Deque[int]
def parse_decks(raw: List[str]) -> Tuple[Deck, Deck]:
deck_1 = deque(int(n) for n in itertools.takewhile(len, raw[1:]))
deck_2 = deque(
int(n) for n in itertools.islice(itertools.dropwhile(len, raw[1:]), 2, None)
)
return deck_1, deck_2
def play(deck_1: Deck, deck_2: Deck) -> Tuple[int, Deck]:
prev: Set[Tuple[Tuple[int, ...], Tuple[int, ...]]] = set()
while len(deck_1) and len(deck_2):
state = (tuple(deck_1), tuple(deck_2))
if state in prev:
return 1, deck_1
prev |= {state}
left, right = deck_1.popleft(), deck_2.popleft()
if left <= len(deck_1) and right <= len(deck_2):
winner, __ = play(deque(list(deck_1)[:left]), deque(list(deck_2)[:right]))
if winner == 1:
deck_1.extend((left, right))
else:
deck_2.extend((right, left))
elif left > right:
deck_1.extend((left, right))
else:
deck_2.extend((right, left))
return (1, deck_1) if len(deck_1) else (2, deck_2)
def solve(raw: List[str]) -> int:
__, deck = play(*parse_decks(raw))
score = sum((i) * val for i, val in enumerate(reversed(deck), 1))
return score
def main() -> None:
input = [line.strip() for line in sys.stdin.readlines()]
print(solve(input))
if __name__ == "__main__":
main()