Compare commits
2 Commits
b3258a61ad
...
27147cd9bd
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
27147cd9bd | ||
|
|
36deee750f |
@@ -3,10 +3,11 @@ import string
|
||||
from aocd.models import Puzzle
|
||||
from aocd import submit
|
||||
|
||||
def eval_priority(rucksack: str) -> int:
|
||||
'''
|
||||
evaluates the priority of a duplicate item
|
||||
'''
|
||||
|
||||
def eval_item_priority(rucksack: str) -> int:
|
||||
"""
|
||||
evaluates the priority of a common item
|
||||
"""
|
||||
|
||||
# create a map of priority values
|
||||
priorities = dict(zip(string.ascii_letters, range(1, 53)))
|
||||
@@ -15,30 +16,50 @@ def eval_priority(rucksack: str) -> int:
|
||||
size = len(rucksack)
|
||||
a, b = rucksack[: size // 2], rucksack[size // 2 :]
|
||||
|
||||
# find the duplicate item
|
||||
duplicate = ''.join(
|
||||
set(a).intersection(b)
|
||||
)
|
||||
# find the common item
|
||||
common = "".join(set(a).intersection(b))
|
||||
|
||||
# return the priority
|
||||
return priorities[duplicate]
|
||||
return priorities[common]
|
||||
|
||||
|
||||
def eval_badge_priority(rucksacks: list) -> int:
|
||||
"""
|
||||
evaluate the priority of duplicate items over groups of three rucksacks
|
||||
"""
|
||||
|
||||
# create a map of priority values
|
||||
priorities = dict(zip(string.ascii_letters, range(1, 53)))
|
||||
|
||||
# find common item amongst three sets
|
||||
common = "".join(set(rucksacks[0]) & set(rucksacks[1]) & set(rucksacks[2]))
|
||||
|
||||
# convert to priority list
|
||||
return priorities[common]
|
||||
|
||||
|
||||
def parse_input(data: list) -> list:
|
||||
'''
|
||||
"""
|
||||
parses the input data and generates a list
|
||||
'''
|
||||
"""
|
||||
# split move set into a list of rounds
|
||||
return [ move for move in data.split('\n')]
|
||||
return [move for move in data.split("\n")]
|
||||
|
||||
|
||||
if __name__ == "__main__":
|
||||
# get puzzle and parse data
|
||||
puzzle = Puzzle(year=2022, day=3)
|
||||
supplies = parse_input(puzzle.input_data)
|
||||
|
||||
# part a: determine the priority of all duplicate items
|
||||
answer = sum([eval_priority(rucksack) for rucksack in supplies])
|
||||
print(f'sum of priorities of all duplicate items: {answer}')
|
||||
submit(answer, part='a', day=3, year=2022)
|
||||
# part a: determine the priority of dupplicate items in compartments
|
||||
answer_a = sum([eval_item_priority(rucksack) for rucksack in supplies])
|
||||
print(f"sum of priorities of all common items amongst compartments: {answer_a}")
|
||||
submit(answer_a, part="a", day=3, year=2022)
|
||||
|
||||
# part b:
|
||||
#submit(total, part='b', day=3, year=2022)
|
||||
# part b: determine the priority of common items in groups of three
|
||||
# split the supply list into groups of three
|
||||
groups = [supplies[i : i + 3] for i in range(0, len(supplies), 3)]
|
||||
# create a list of each groups priority and sum it all up
|
||||
answer_b = sum([eval_badge_priority(group) for group in groups])
|
||||
print(f"sum of priorities of all common items amongst groups of three: {answer_b}")
|
||||
submit(answer_b, part="b", day=3, year=2022)
|
||||
|
||||
Reference in New Issue
Block a user