-
Notifications
You must be signed in to change notification settings - Fork 0
/
Day16.py
69 lines (58 loc) · 2.02 KB
/
Day16.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
from DataReader import AdventDay
import re
class AdventDaySixteen(AdventDay):
def __init__(self):
AdventDay.__init__(self, 16)
self.aunts = {}
self.aunt_known = {
'children': '3',
'cats': '7',
'samoyeds': '2',
'pomeranians': '3',
'akitas': '0',
'vizslas': '0',
'goldfish': '5',
'trees': '3',
'cars': '2',
'perfumes': '1'
}
def answer_part1(self):
self.parse_all_aunts()
for key in self.aunts:
if self.is_match(self.aunts[key]):
return key
def answer_part2(self):
self.parse_all_aunts()
for key in sorted(self.aunts):
if self.is_match_part2(self.aunts[key]):
return key
def parse_all_aunts(self):
for one_string in self.read_data():
self.parse_one_aunt(one_string)
def is_match(self, one_aunt):
for key in one_aunt:
if one_aunt[key] != self.aunt_known[key]:
return False
return True
def is_match_part2(self, one_aunt):
for key in one_aunt:
if key in ['cats', 'trees']:
if self.aunt_known[key] >= one_aunt[key]:
return False
elif key in ['pomeranians', 'goldfish']:
if self.aunt_known[key] <= one_aunt[key]:
return False
elif one_aunt[key] != self.aunt_known[key]:
return False
return True
def parse_one_aunt(self, one_string):
parts = re.findall('Sue (\d+): (\w+): (\d+), (\w+): (\d+), (\w+): (\d+)', one_string)[0]
self.aunts[int(parts[0])] = {
parts[1]: parts[2],
parts[3]: parts[4],
parts[5]: parts[6]
}
adventDay16_1 = AdventDaySixteen()
adventDay16_2 = AdventDaySixteen()
print("Day 16 Part 1: {answer}".format(answer=adventDay16_1.answer_part1()))
print("Day 16 Part 2: {answer}".format(answer=adventDay16_2.answer_part2()))