-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathday4.py
50 lines (38 loc) · 1.38 KB
/
day4.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
from typing import Optional
from pydantic.dataclasses import dataclass
from common.aoc import AoCDay
@dataclass
class Card:
original: str
name: Optional[str] = None
win: Optional[set] = None
have: Optional[set] = None
def __post_init__(self) -> None:
self.name = self.original.split(": ")[0]
self.win = {
x for x in self.original.split(": ")[1].split(" | ")[0].split(" ") if x
}
self.have = {
x for x in self.original.split(": ")[1].split(" | ")[1].split(" ") if x
}
class Day(AoCDay):
def __init__(self, test=0):
super().__init__(__name__, test)
def _preprocess_input(self):
self.__input_data = []
self.__input_data.extend(Card(i) for i in self._input_data[0])
def _calculate_1(self) -> int:
result = 0
for i in self.__input_data:
if len(i.win.intersection(i.have)) > 0:
res = pow(2, len(i.win.intersection(i.have)) - 1)
result += res
return result
def _calculate_2(self) -> int:
original_deck = self.__input_data
deck = {i.name: 1 for i in original_deck}
for c, i in enumerate(original_deck):
res = len(i.win.intersection(i.have))
for j in range(res):
deck[original_deck[c + j + 1].name] += 1 * deck[i.name]
return sum(deck.values())