Update all python solutions to use timer function

Author: MeanderingProgrammer

2015/01/solver.py

@@ -2,6 +2,7 @@
 from aoc.parser import Parser
 
 
+@answer.timer
 def main() -> None:
     data = Parser().string()
     answer.part1(232, get_floor(data, False))

2015/02/solver.py

@@ -22,6 +22,7 @@ def ribbon_needed(self) -> int:
         return perimeter + volume
 
 
+@answer.timer
 def main() -> None:
     paper, ribbon = [], []
     for line in Parser().lines():

2015/03/solver.py

@@ -5,6 +5,7 @@
 DIRECTIONS = {"^": Point(0, 1), "v": Point(0, -1), "<": Point(-1, 0), ">": Point(1, 0)}
 
 
+@answer.timer
 def main() -> None:
     answer.part1(2081, run(1))
     answer.part2(2341, run(2))

2015/04/solver.py

@@ -4,6 +4,7 @@
 from aoc.parser import Parser
 
 
+@answer.timer
 def main() -> None:
     prefix = Parser(strip=True).string()
     five_leading_0s = first_index(prefix, 5, 1)

2015/05/solver.py

@@ -63,6 +63,7 @@ def creates_tripple(self) -> bool:
         return False
 
 
+@answer.timer
 def main() -> None:
     words = [Word(line) for line in Parser().lines()]
     answer.part1(238, total_nice_words(words, False))

2015/06/solver.py

@@ -37,6 +37,7 @@ def to_point(coords: str) -> tuple[int, int]:
         return (int(values[0]), int(values[1]))
 
 
+@answer.timer
 def main() -> None:
     directions = [Direction(line) for line in Parser().lines()]
     answer.part1(400410, apply_all(directions, SINGLE))

2015/07/solver.py

@@ -41,6 +41,7 @@ def get_value(self, diagram: dict[str, Self], index: int):
             return int(variable)
 
 
+@answer.timer
 def main() -> None:
     first = evaluate(None)
     answer.part1(3176, first)

2015/08/solver.py

@@ -34,6 +34,7 @@ def encode(self) -> int:
         return len(result)
 
 
+@answer.timer
 def main() -> None:
     strings: list[String] = [String(line) for line in Parser().lines()]
     total = sum([s.total() for s in strings])

2015/09/solver.py

@@ -4,6 +4,7 @@
 from aoc.parser import Parser
 
 
+@answer.timer
 def main() -> None:
     distances = get_distances()
     locations = get_locations(distances)

2015/10/solver.py

@@ -18,6 +18,7 @@ def play(self) -> None:
         self.value = next_value
 
 
+@answer.timer
 def main() -> None:
     game = Game(Parser(strip=True).int_string())
     answer.part1(360154, run(game, 40))

2015/11/solver.py

@@ -68,6 +68,7 @@ def to_index(character: str) -> int:
         return ord(character) - ord("a")
 
 
+@answer.timer
 def main() -> None:
     value = Parser(strip=True).string()
     generator = PasswordGenerator(value)

2015/12/solver.py

@@ -5,6 +5,7 @@
 from aoc.parser import Parser
 
 
+@answer.timer
 def main() -> None:
     answer.part1(111754, get_total(False))
     answer.part2(65402, get_total(True))

2015/13/solver.py

@@ -21,6 +21,7 @@ def __getitem__(self, i: int) -> str:
         return self.people[i % len(self.people)]
 
 
+@answer.timer
 def main() -> None:
     graph = get_graph()
     answer.part1(709, max_score(graph, False))

2015/14/solver.py

@@ -15,6 +15,7 @@ def distance(self, elapsed_time: int) -> int:
         return self.speed * ((complete * self.time) + min(remainder, self.time))
 
 
+@answer.timer
 def main() -> None:
     reindeers = get_reindeers()
     answer.part1(2655, max(distances_after(reindeers, 2_503)))

2015/15/solver.py

@@ -48,6 +48,7 @@ def get_values(self, proportion: list[int]) -> tuple[int, int]:
         return score, calories
 
 
+@answer.timer
 def main() -> None:
     recipe = Recipe(get_ingredients(), 100)
     answer.part1(18965440, recipe.best_score())

2015/16/solver.py

@@ -35,6 +35,7 @@ def does_match(self, aunt: Aunt, calibrate: bool) -> bool:
         return True
 
 
+@answer.timer
 def main() -> None:
     groups = Parser().line_groups()
     match, aunts = get_match(groups[0]), get_aunts(groups[1])

2015/17/solver.py

@@ -4,6 +4,7 @@
 from aoc.parser import Parser
 
 
+@answer.timer
 def main() -> None:
     combinations = get_combinations(Parser().int_lines(), 150)
     answer.part1(1304, len(combinations))

2015/18/solver.py

@@ -58,6 +58,7 @@ def lights_on(self) -> int:
         return len(self.on)
 
 
+@answer.timer
 def main() -> None:
     grid = Parser().as_grid()
     answer.part1(1061, run(grid, False))

2015/19/solver.py

@@ -20,6 +20,7 @@ def replace_at(self, value: str, index: int) -> str:
         return before + after.replace(self.start, self.end, 1)
 
 
+@answer.timer
 def main() -> None:
     groups = Parser().line_groups()
     rules = get_rules(groups[0])

2015/20/solver.py

@@ -2,6 +2,7 @@
 from aoc.parser import Parser
 
 
+@answer.timer
 def main() -> None:
     goal = Parser().integer()
     answer.part1(665280, find_first(goal, False))

2015/21/solver.py

@@ -64,6 +64,7 @@ def attack(self, opponent: Self) -> None:
         opponent.hp -= max(damage, 1)
 
 
+@answer.timer
 def main() -> None:
     groups = Parser().line_groups()
     inventory = Inventory(

2015/22/solver.py

@@ -129,6 +129,7 @@ def run_spells(
         return player, enemy, active_spells
 
 
+@answer.timer
 def main() -> None:
     lines = Parser().lines()
     hp, attack = int(lines[0].split()[-1]), int(lines[1].split()[-1])

2015/23/solver.py

@@ -54,6 +54,7 @@ def run(self, computer: Computer) -> int:
             raise Exception(f"Unknown operation: {self.op}")
 
 
+@answer.timer
 def main() -> None:
     answer.part1(170, run_computer(0))
     answer.part2(247, run_computer(1))

2015/24/solver.py

@@ -45,6 +45,7 @@ def entaglement(values: tuple[int]) -> int:
         return result
 
 
+@answer.timer
 def main() -> None:
     organizer = Organizer(weights=Parser().int_lines())
     answer.part1(10439961859, organizer.run(3))

2015/25/solver.py

@@ -2,6 +2,7 @@
 from aoc.parser import Parser
 
 
+@answer.timer
 def main() -> None:
     values = Parser().entries()
     index = get_index(int(values[-3][:-1]), int(values[-1][:-1]))

2016/01/solver.py

@@ -5,6 +5,7 @@
 DIRECTIONS: list[Point] = [Point(0, 1), Point(1, 0), Point(0, -1), Point(-1, 0)]
 
 
+@answer.timer
 def main() -> None:
     visited = traverse()
     answer.part1(252, len(visited[-1]))

2016/02/solver.py

@@ -10,6 +10,7 @@
 )
 
 
+@answer.timer
 def main() -> None:
     answer.part1("47978", get_code([[1, 2, 3], [4, 5, 6], [7, 8, 9]]))
     answer.part2(

2016/03/solver.py

@@ -14,6 +14,7 @@ def valid(self) -> bool:
         return (sides[0] + sides[1]) > sides[2]
 
 
+@answer.timer
 def main() -> None:
     answer.part1(862, num_valid(vertically()))
     answer.part2(1577, num_valid(horizontally()))

2016/04/solver.py

@@ -31,6 +31,7 @@ def decrypt(self) -> str:
         return "".join(decrypted)
 
 
+@answer.timer
 def main() -> None:
     rooms = [room for room in get_rooms() if room.valid()]
     answer.part1(278221, sum([room.sector_id for room in rooms]))

2016/05/solver.py

@@ -4,6 +4,7 @@
 from aoc.parser import Parser
 
 
+@answer.timer
 def main() -> None:
     door_id = Parser().string()
     answer.part1("d4cd2ee1", generate_password(door_id, populate_v1))

2016/06/solver.py

@@ -4,6 +4,7 @@
 from aoc.parser import Parser
 
 
+@answer.timer
 def main() -> None:
     answer.part1("liwvqppc", error_correct_message(-1))
     answer.part2("caqfbzlh", error_correct_message(0))

2016/07/solver.py

@@ -40,6 +40,7 @@ def subsequence(self, sequence: str, length: int) -> list[str]:
         return result
 
 
+@answer.timer
 def main() -> None:
     ips = get_ip_addresses()
     answer.part1(118, sum([ip.tls() for ip in ips]))

2016/08/solver.py

@@ -36,6 +36,7 @@ def apply(self, display: Grid) -> None:
             raise Exception("Unknwon operation: {}".format(self.value))
 
 
+@answer.timer
 def main() -> None:
     w, h = 50, 6
     display = create_display(w, h)

2016/09/solver.py

@@ -33,6 +33,7 @@ def get_repeat_details(self, start: int) -> tuple[int, int, int]:
         return end, int(length), int(times)
 
 
+@answer.timer
 def main() -> None:
     answer.part1(102239, decompress(False))
     answer.part2(10780403063, decompress(True))

2016/10/solver.py

@@ -46,6 +46,7 @@ def held_all_values(self, values: list[int]) -> bool:
         return True
 
 
+@answer.timer
 def main() -> None:
     initial_values, bots = get_data()
     outputs = defaultdict(list)

2016/11/solver.py

@@ -105,6 +105,7 @@ def __lt__(self, o: Self) -> bool:
         return len(self.get(3)) < len(o.get(3))
 
 
+@answer.timer
 def main() -> None:
     answer.part1(37, count_steps([]))
     additional_items = [

2016/12/solver.py

@@ -3,6 +3,7 @@
 from aoc.parser import Parser
 
 
+@answer.timer
 def main() -> None:
     answer.part1(318117, run(0))
     answer.part2(9227771, run(1))

2016/13/solver.py

@@ -29,6 +29,7 @@ def is_wall(self, point: Point) -> bool:
         return num_ones % 2 == 1
 
 
+@answer.timer
 def main() -> None:
     maze = Maze(grid=Grid(), favorite_number=Parser().integer())
     start, goal = Point(1, 1), Point(31, 39)

2016/14/solver.py

@@ -12,6 +12,7 @@ class HashInfo:
     cinqs: list[str]
 
 
+@answer.timer
 def main() -> None:
     prefix = Parser(strip=True).string()
     answer.part1(15168, generate(prefix, 1))

2016/15/solver.py

@@ -15,6 +15,7 @@ def passes(self, time: int) -> bool:
         return position % self.positions == 0
 
 
+@answer.timer
 def main() -> None:
     answer.part1(121834, calculate_first_pass(False))
     answer.part2(3208099, calculate_first_pass(True))

2016/16/solver.py

@@ -2,6 +2,7 @@
 from aoc.parser import Parser
 
 
+@answer.timer
 def main() -> None:
     answer.part1("10010101010011101", fill_disk(272))
     answer.part2("01100111101101111", fill_disk(35_651_584))

2016/17/solver.py

@@ -13,6 +13,7 @@
 ]
 
 
+@answer.timer
 def main() -> None:
     code = Parser(strip=True).string()
     paths = search.bfs_paths(((-3, 3), code), (0, 0), get_adjacent)

2016/18/solver.py

@@ -2,6 +2,7 @@
 from aoc.parser import Parser
 
 
+@answer.timer
 def main() -> None:
     starting_row = [v == "." for v in Parser(strip=True).string()]
     answer.part1(2013, total_safe(starting_row, 40))

2016/19/solver.py

@@ -4,6 +4,7 @@
 from aoc.parser import Parser
 
 
+@answer.timer
 def main() -> None:
     num_elves = Parser().integer()
     answer.part1(1834903, solve_by_pattern(num_elves, True))

2016/20/solver.py

@@ -23,6 +23,7 @@ def join(self, os: list[Self]) -> Self:
         return type(self)(min(starts), max(ends))
 
 
+@answer.timer
 def main() -> None:
     data_ranges = get_data_ranges()
     data_ranges = combine_all(data_ranges)

2016/21/solver.py

@@ -99,6 +99,7 @@ def __str__(self) -> str:
         return "".join(self.value)
 
 
+@answer.timer
 def main() -> None:
     lines = Parser().lines()
     answer.part1("bdfhgeca", scramble(lines, "abcdefgh"))

2016/22/solver.py

@@ -24,6 +24,7 @@ def could_store(self, o) -> bool:
 Nodes = dict[Point, Node]
 
 
+@answer.timer
 def main() -> None:
     nodes = get_nodes()
     answer.part1(910, viable_connections(nodes))

2016/23/solver.py

@@ -5,6 +5,7 @@
 from aoc.parser import Parser
 
 
+@answer.timer
 def main() -> None:
     answer.part1(11662, run(7))
     # Ends up simplifying to n! + 77*86

2016/24/solver.py

@@ -47,6 +47,7 @@ def get_adjacent(self, p: Point) -> list[Point]:
         return result
 
 
+@answer.timer
 def main() -> None:
     distances = get_grid().compute_distances()
     answer.part1(498, traverse(distances, False))

2016/25/solver.py

@@ -3,6 +3,7 @@
 from aoc.parser import Parser
 
 
+@answer.timer
 def main() -> None:
     answer.part1(198, run_until_success())