diff options
| author | 2025-12-02 07:57:38 +0100 | |
|---|---|---|
| committer | 2025-12-02 09:40:04 +0100 | |
| commit | f315ef05c548da80410cb4f6665a9bba7a953f94 (patch) | |
| tree | a727c6ad862a4a9c237c320705483b3def7acc11 /day1/__init__.py | |
| parent | d7e30321ae6ae4c82a8ab7455f6ce33afd719c67 (diff) | |
| download | 2025-f315ef05c548da80410cb4f6665a9bba7a953f94.tar.gz 2025-f315ef05c548da80410cb4f6665a9bba7a953f94.tar.bz2 2025-f315ef05c548da80410cb4f6665a9bba7a953f94.zip | |
Day 1 and 2
Diffstat (limited to 'day1/__init__.py')
| -rw-r--r-- | day1/__init__.py | 60 |
1 files changed, 60 insertions, 0 deletions
diff --git a/day1/__init__.py b/day1/__init__.py new file mode 100644 index 0000000..6e95329 --- /dev/null +++ b/day1/__init__.py | |||
| @@ -0,0 +1,60 @@ | |||
| 1 | # -*- coding: utf-8 -*- | ||
| 2 | from abc import ABC | ||
| 3 | from typing import Iterator | ||
| 4 | |||
| 5 | from aoc import BaseAssignment, I | ||
| 6 | |||
| 7 | |||
| 8 | class Assignment(BaseAssignment, ABC): | ||
| 9 | def parse_item(self, item: str) -> Iterator[I]: | ||
| 10 | [rotation, *places] = item | ||
| 11 | places = int("".join(places)) | ||
| 12 | |||
| 13 | yield -places if rotation == "L" else places | ||
| 14 | |||
| 15 | |||
| 16 | class AssignmentOne(Assignment): | ||
| 17 | example_result = 3 | ||
| 18 | |||
| 19 | def run(self, input: Iterator[int]) -> int: | ||
| 20 | seen_0 = 0 | ||
| 21 | position = 50 | ||
| 22 | for rotation in input: | ||
| 23 | position = (position + rotation) % 100 | ||
| 24 | if position == 0: | ||
| 25 | seen_0 += 1 | ||
| 26 | |||
| 27 | return seen_0 | ||
| 28 | |||
| 29 | |||
| 30 | class AssignmentTwo(Assignment): | ||
| 31 | example_result = 6 | ||
| 32 | |||
| 33 | @staticmethod | ||
| 34 | def calculate_new_position(position, rotation) -> tuple[int, int]: | ||
| 35 | previous_position = position | ||
| 36 | new_position = position + rotation | ||
| 37 | |||
| 38 | overturned = new_position >= 100 or new_position < 0 | ||
| 39 | |||
| 40 | multiplier = position - (0 - -previous_position) // 100 | ||
| 41 | |||
| 42 | if overturned: | ||
| 43 | new_position = new_position % 100 | ||
| 44 | |||
| 45 | seen_0 = 0 | ||
| 46 | if new_position == 0 and multiplier == 0: | ||
| 47 | seen_0 += multiplier + 1 | ||
| 48 | elif overturned: | ||
| 49 | seen_0 += multiplier | ||
| 50 | |||
| 51 | return new_position, seen_0 | ||
| 52 | |||
| 53 | def run(self, input: Iterator[int]) -> int: | ||
| 54 | seen_0_total = 0 | ||
| 55 | position = 50 | ||
| 56 | for rotation in input: | ||
| 57 | position, seen_0 = self.calculate_new_position(position, rotation) | ||
| 58 | seen_0_total += seen_0 | ||
| 59 | |||
| 60 | return seen_0_total | ||
