|
| 1 | +from . import SeparateRunner |
| 2 | + |
| 3 | + |
| 4 | +def parse_input(input: str) -> tuple[int, list[int]]: |
| 5 | + result = [] |
| 6 | + |
| 7 | + for line in input.strip().split("\n"): |
| 8 | + test, nums = line.split(": ") |
| 9 | + result.append((int(test), list(map(int, nums.split(" "))))) |
| 10 | + |
| 11 | + return result |
| 12 | + |
| 13 | + |
| 14 | +def is_possible(target: int, nums: list[int], cur: int) -> bool: |
| 15 | + if cur == target and not nums: |
| 16 | + return True |
| 17 | + |
| 18 | + if cur > target or not nums: |
| 19 | + return False |
| 20 | + |
| 21 | + head = nums[0] |
| 22 | + remainder = nums[1:] |
| 23 | + |
| 24 | + return is_possible(target, remainder, cur + head) or is_possible( |
| 25 | + target, remainder, cur * head |
| 26 | + ) |
| 27 | + |
| 28 | + |
| 29 | +def is_possible2(target: int, nums: list[int], cur: int) -> bool: |
| 30 | + if cur == target and not nums: |
| 31 | + return True |
| 32 | + |
| 33 | + if cur > target or not nums: |
| 34 | + return False |
| 35 | + |
| 36 | + head = nums[0] |
| 37 | + remainder = nums[1:] |
| 38 | + |
| 39 | + return ( |
| 40 | + is_possible2(target, remainder, cur + head) |
| 41 | + or is_possible2(target, remainder, cur * head) |
| 42 | + or is_possible2(target, remainder, int(f"{cur}{head}")) |
| 43 | + ) |
| 44 | + |
| 45 | + |
| 46 | +class DayRunner(SeparateRunner): |
| 47 | + @classmethod |
| 48 | + def part1(cls, input: str) -> int: |
| 49 | + lines = parse_input(input) |
| 50 | + |
| 51 | + return sum( |
| 52 | + target for target, nums in lines if is_possible(target, nums[1:], nums[0]) |
| 53 | + ) |
| 54 | + |
| 55 | + @classmethod |
| 56 | + def part2(cls, input: str) -> int: |
| 57 | + lines = parse_input(input) |
| 58 | + |
| 59 | + return sum( |
| 60 | + target for target, nums in lines if is_possible2(target, nums[1:], nums[0]) |
| 61 | + ) |
0 commit comments