-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathd07.py
More file actions
137 lines (107 loc) Β· 4.32 KB
/
d07.py
File metadata and controls
137 lines (107 loc) Β· 4.32 KB
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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
from dataclasses import dataclass
from enum import Enum
import re
import string
from typing import Dict, List, Optional, Self
from day import Day, register_day
PATTERN = re.compile(r"Step (\w) must be finished before step (\w) can begin\.")
@register_day(2018, 7)
class Day07(Day):
def part_one(self) -> str:
workpool = WorkPool(self.read_input(), 1)
while not all([v is WorkStatus.DONE for _, v in workpool.statuses.items()]):
workpool.tick()
return "".join(workpool.work_done)
def part_two(self) -> str:
workpool = WorkPool(self.read_input(), 5)
while not all([v is WorkStatus.DONE for _, v in workpool.statuses.items()]):
workpool.tick()
return str(workpool.curr_tick)
# -----------------------------------------------------------------------------
@dataclass
class Worker:
current_work: Optional[str]
started_at: Optional[int]
def default() -> Self:
return Worker(None, None)
class WorkStatus(Enum):
TODO = 1
IN_PROGRESS = 2
DONE = 3
class WorkPool:
curr_tick: int
dependencies: Dict[str, List[str]]
statuses: Dict[str, WorkStatus]
time_requirements: Dict[str, int]
workers: List[Worker]
work_done: List[str]
def __init__(self, input: str, workers_count: int, added_time=0) -> None:
self.curr_tick = -1
self.dependencies = {}
self.statuses = {}
self.workers = []
self.work_done = []
# `ord` - Return the Unicode code point for a one-character string.
# ord('A') == 65
# ord('A') - 64 == 1
# ord('B') - 64 == 2
# (...)
self.time_requirements = {k: (ord(k) - 64) + 60 for k in string.ascii_uppercase}
for line in input.split("\n"):
match = PATTERN.match(line)
required = match.group(1)
step = match.group(2)
# Add requirements for step
if self.dependencies.get(step) is None:
self.dependencies[step] = []
if self.dependencies.get(required) is None:
self.dependencies[required] = []
self.dependencies[step].append(required)
# Add statuses for new steps
if self.statuses.get(required) is None:
self.statuses[required] = WorkStatus.TODO
if self.statuses.get(step) is None:
self.statuses[step] = WorkStatus.TODO
for _ in range(workers_count):
self.workers.append(Worker.default())
def available_work(self) -> List[str]:
available_items = []
for item, _ in dict(
filter(lambda item: item[1] is WorkStatus.TODO, self.statuses.items())
).items():
if len(self.dependencies[item]) == 0:
available_items.append(item)
continue
statuses = [
v is WorkStatus.DONE
for k, v in self.statuses.items()
if k in self.dependencies[item]
]
if all(statuses):
available_items.append(item)
available_items.sort() # TODO: Is this necessary?
return available_items
def tick(self) -> None:
self.curr_tick += 1
available_work = self.available_work()
for worker in self.workers:
if worker.current_work is not None:
time_required = self.time_requirements[worker.current_work]
if self.curr_tick - worker.started_at == time_required:
self.statuses[worker.current_work] = WorkStatus.DONE
self.work_done.append(worker.current_work)
available_work = self.available_work()
if len(available_work) > 0:
work = available_work.pop(0)
worker.current_work = work
worker.started_at = self.curr_tick
self.statuses[work] = WorkStatus.IN_PROGRESS
else:
worker.current_work = None
worker.started_at = None
else:
if len(available_work) > 0:
work = available_work.pop(0)
worker.current_work = work
worker.started_at = self.curr_tick
self.statuses[work] = WorkStatus.IN_PROGRESS