mirror of
https://github.com/bertptrs/adventofcode.git
synced 2025-12-25 21:00:31 +01:00
Implement 2024 day 19
This commit is contained in:
37
2024/src/aoc/days/day19.py
Normal file
37
2024/src/aoc/days/day19.py
Normal file
@@ -0,0 +1,37 @@
|
||||
import functools
|
||||
|
||||
from . import CombinedRunner
|
||||
|
||||
|
||||
def parse_input(data: str) -> tuple[tuple[str, ...], list[str]]:
|
||||
patterns, designs = data.strip().split("\n\n")
|
||||
|
||||
return tuple(patterns.split(", ")), designs.split("\n")
|
||||
|
||||
|
||||
@functools.cache
|
||||
def is_possible(design: str, patterns: tuple[str, ...]) -> bool:
|
||||
if not design:
|
||||
return 1
|
||||
|
||||
return sum(
|
||||
is_possible(design[len(pat) :], patterns)
|
||||
for pat in patterns
|
||||
if design.startswith(pat)
|
||||
)
|
||||
|
||||
|
||||
class DayRunner(CombinedRunner):
|
||||
@classmethod
|
||||
def run_both(cls, input: str) -> int:
|
||||
patterns, designs = parse_input(input)
|
||||
|
||||
possible = 0
|
||||
ways = 0
|
||||
|
||||
for design in designs:
|
||||
if (solve := is_possible(design, patterns)) > 0:
|
||||
possible += 1
|
||||
ways += solve
|
||||
|
||||
return possible, ways
|
||||
Reference in New Issue
Block a user