advent-of-code/2015-python/solutions/day_06.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

50 lines
1.6 KiB
Python

import re
from solutions import BaseSolution
from collections import defaultdict
class Solution(BaseSolution):
input_file = "06.txt"
def __str__(self):
return "Day 6: Probably a Fire Hazard"
def parse_input(self, data):
return data.strip()
def solve(self, puzzle_input):
m = defaultdict(bool)
for ase in puzzle_input.splitlines():
p = re.match(r"^(.+) (\d+),(\d+)\D+(\d+),(\d+)", ase).groups()
a, sx, sy, ex, ey = p
for r in range(int(sy), int(ey) + 1):
for c in range(int(sx), int(ex) + 1):
match a:
case "toggle":
m[(r, c)] = not m[(r, c)]
case "turn on":
m[(r, c)] = True
case "turn off":
m[(r, c)] = False
return sum(m.values())
def solve_again(self, puzzle_input):
m = defaultdict(int)
for ase in puzzle_input.splitlines():
p = re.match(r"^(.+) (\d+),(\d+)\D+(\d+),(\d+)", ase).groups()
a, sx, sy, ex, ey = p
for r in range(int(sy), int(ey) + 1):
for c in range(int(sx), int(ex) + 1):
match a:
case "toggle":
m[(r, c)] += 2
case "turn on":
m[(r, c)] += 1
case "turn off":
m[(r, c)] = max(m[(r, c)] - 1, 0)
return sum(m.values())
if __name__ == "__main__":
solution = Solution()
solution.show_results()