advent-of-code/2015-python/solutions/day_16.py
Anders Englöf Ytterström 5a5e843129
2015, day 16-25 (first completed calendar!) (#11)
* Solve 2015:16 "Aunt Sue"

* Make 2023:08 future compatible

Code used to work with another version of python.

* Solve 2015:17 "No such Thing as Too much"

* Solve 2015:18 "Like a GIF For Your Yard"

Also solve 2015:06 just in case, was just a ref
in the end.

* Solve 2015:19 "Medicine for Rudolph"

* Solve 2015:20 "Infinite Elves and Infinite Houses"

* Solve 2023:21 "RPG Simulator 20XX"

* Solve 2015:22 "Wizard Simulator 20XX"

* Solve 2015:23 "Opening the Turing Lock"

* Solve 2015:25 "Let it Snow"

Wrote p2rc and rc2p just for academic purposes.
Puzzles could be solved anyway.

* Solve 2015:24 "Hangs in the Balance"

---------

Co-authored-by: Anders Englöf Ytterström <anders@playmaker.ai>
2023-12-19 14:24:28 +01:00

56 lines
1.5 KiB
Python

import re
from collections import defaultdict
from solutions import BaseSolution
S = {
"children": 3,
"cats": 7,
"samoyeds": 2,
"pomeranians": 3,
"akitas": 0,
"vizslas": 0,
"goldfish": 5,
"trees": 3,
"cars": 2,
"perfumes": 1,
}
class Solution(BaseSolution):
input_file = "16.txt"
def __str__(self):
return "Day 16: Aunt Sue"
def parse_input(self, data):
return data.strip()
def solve(self, puzzle_input):
s = defaultdict(int)
for i, l in enumerate(puzzle_input.splitlines(), 1):
for kv in re.findall(r"\w+: \d+", l):
k, v = kv.split(": ")
v = int(v)
s[i] += 1 if k in S and S[k] == v else 0
return max(s.items(), key=lambda x: x[1])[0]
def solve_again(self, puzzle_input):
s = defaultdict(int)
for i, l in enumerate(puzzle_input.splitlines(), 1):
for kv in re.findall(r"\w+: \d+", l):
k, v = kv.split(": ")
v = int(v)
match k:
case "cats" | "trees":
s[i] += 1 if k in S and S[k] < v else 0
case "pomeranians" | "goldfish":
s[i] += 1 if k in S and S[k] > v else 0
case _:
s[i] += 1 if k in S and S[k] == v else 0
return max(s.items(), key=lambda x: x[1])[0]
if __name__ == "__main__":
solution = Solution()
solution.show_results()