-
Notifications
You must be signed in to change notification settings - Fork 0
/
AoC2022_22.py
309 lines (286 loc) · 9.66 KB
/
AoC2022_22.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
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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
#! /usr/bin/env python3
#
# Advent of Code 2022 Day 22
#
# TODO: make generalized part2 solution that works on sample input as well
import re
from aoc import my_aocd
from aoc.common import aoc_main
from aoc.common import log
DIRS = {"N": (-1, 0), "E": (0, 1), "S": (1, 0), "W": (0, -1)}
TURNS = {
"R": {"N": "E", "E": "S", "S": "W", "W": "N"},
"L": {"N": "W", "E": "N", "S": "E", "W": "S"},
}
def _parse(inputs: tuple[str, ...]) -> tuple[list[str], list[tuple[str, int]]]:
blocks = my_aocd.to_blocks(inputs)
moves = [
(a, int(b))
for a, b in re.findall(r"([LR])([0-9]+)", "R" + blocks[1][0])
]
return blocks[0], moves
def _ans(r: int, c: int, facing: str) -> int:
return 1000 * (r + 1) + 4 * (c + 1) + "ESWN".index(facing)
def _get_rows(grid: list[str], col: int) -> tuple[int, ...]:
return tuple(
r
for r, line in enumerate(grid)
if col < len(line) and line[col] != " "
)
def _get_cols(grid: list[str], row: int) -> tuple[int, ...]:
return tuple(c for c, _ in enumerate(grid[row]) if _ != " ")
def part_1(inputs: tuple[str, ...]) -> int:
grid, moves = _parse(inputs)
size = len(grid) // 3
start = 0, 2 * size
log(start)
r, c = start
facing = "N"
rows_cache = dict[int, tuple[int, ...]]()
cols_cache = dict[int, tuple[int, ...]]()
for turn, steps in moves:
facing = TURNS[turn][facing]
for i in range(steps):
dr, dc = DIRS[facing]
rr = r + dr
cc = c + dc
if facing == "N" or facing == "S":
if c not in rows_cache:
rows_cache[c] = _get_rows(grid, c)
rows = rows_cache[c]
if rr < rows[0]:
rr = rows[-1]
elif rr > rows[-1]:
rr = rows[0]
else:
if r not in cols_cache:
cols_cache[r] = _get_cols(grid, r)
cols = cols_cache[r]
if cc < cols[0]:
cc = cols[-1]
elif cc > cols[-1]:
cc = cols[0]
if grid[rr][cc] == "#":
break
else:
r, c = rr, cc
log((r, c))
return _ans(r, c, facing)
def part_2(inputs: tuple[str, ...]) -> int:
grid, moves = _parse(inputs)
start = 0, next(c for c, _ in enumerate(grid[0]) if _ != " ")
log(start)
r, c = start
facing = "N"
for turn, steps in moves:
facing = TURNS[turn][facing]
for i in range(steps):
# assert cnt < 10
dr, dc = DIRS[facing]
log((r, c, dr, dc))
rr = r + dr
cc = c + dc
ff = facing
# top edge 1
if rr == -1 and 50 <= cc < 100:
assert ff == "N", ((r, c, facing), (rr, cc))
rr = cc + 100
cc = 0
assert rr >= 0 and cc >= 0, ((r, c, facing), (rr, cc))
# assert 6
assert 150 <= rr < 200 and 0 <= cc < 50, (
(r, c, facing),
(rr, cc),
)
ff = "E"
# left edge 1
elif cc == 49 and 0 <= rr < 50:
assert ff == "W", ((r, c, facing), (rr, cc))
rr = 149 - rr
cc = 0
assert rr >= 0 and cc >= 0, ((r, c, facing), (rr, cc))
# assert 4
assert 100 <= rr < 150 and 0 <= cc < 50, (
(r, c, facing),
(rr, cc),
)
ff = "E"
# top edge 2
elif rr == -1 and 100 <= cc < 150:
assert ff == "N", ((r, c, facing), (rr, cc))
rr = 199
cc -= 100
assert rr >= 0 and cc >= 0, ((r, c, facing), (rr, cc))
# assert 6
assert 150 <= rr < 200 and 0 <= cc < 50, (
(r, c, facing),
(rr, cc),
)
ff = "N"
# right edge 2
elif cc == 150 and 0 <= rr < 50:
assert ff == "E", ((r, c, facing), (rr, cc))
rr = 149 - rr
cc = 99
assert rr >= 0 and cc >= 0, ((r, c, facing), (rr, cc))
# assert 5
assert 100 <= rr < 150 and 50 <= cc < 100, (
(r, c, facing),
(rr, cc),
)
ff = "W"
# bottom edge 2
elif rr == 50 and 100 <= cc < 150 and ff == "S":
assert ff == "S", ((r, c, facing), (rr, cc))
rr = cc - 50
cc = 99
assert rr >= 0 and cc >= 0, ((r, c, facing), (rr, cc))
# assert 3
assert 50 <= rr < 100 and 50 <= cc < 100, (
(r, c, facing),
(rr, cc),
)
ff = "W"
# left edge 3
elif cc == 49 and 50 <= rr < 100:
assert ff == "W", ((r, c, facing), (rr, cc))
cc = rr - 50
rr = 100
assert rr >= 0 and cc >= 0, ((r, c, facing), (rr, cc))
# assert 4
assert 100 <= rr < 150 and 0 <= cc < 50, (
(r, c, facing),
(rr, cc),
)
ff = "S"
# right edge 3
elif cc == 100 and 50 <= rr < 100 and ff == "E":
assert ff == "E", ((r, c, facing), (rr, cc))
cc = rr + 50
rr = 49
assert rr >= 0 and cc >= 0, ((r, c, facing), (rr, cc))
# assert 2
assert 0 <= rr < 50 and 100 <= cc < 150, (
(r, c, facing),
(rr, cc),
)
ff = "N"
# left edge 4
elif cc == -1 and 100 <= rr < 150:
assert ff == "W", ((r, c, facing), (rr, cc))
rr = 149 - rr
cc = 50
assert rr >= 0 and cc >= 0, ((r, c, facing), (rr, cc))
# assert 1
assert 0 <= rr < 50 and 50 <= cc < 100, (
(r, c, facing),
(rr, cc),
)
ff = "E"
# top edge 4
elif rr == 99 and 0 <= cc < 50:
assert ff == "N", ((r, c, facing), (rr, cc))
rr = cc + 50
cc = 50
assert rr >= 0 and cc >= 0, ((r, c, facing), (rr, cc))
# assert 3
assert 50 <= rr < 100 and 50 <= cc < 100, (
(r, c, facing),
(rr, cc),
)
ff = "E"
# right edge 5
elif cc == 100 and 100 <= rr < 150:
assert ff == "E", ((r, c, facing), (rr, cc))
rr = 149 - rr
cc = 149
assert rr >= 0 and cc >= 0, ((r, c, facing), (rr, cc))
# assert 2
assert 0 <= rr < 50 and 100 <= cc < 150, (
(r, c, facing),
(rr, cc),
)
ff = "W"
# bottom edge 5
elif rr == 150 and 50 <= cc < 100 and ff == "S":
assert ff == "S", ((r, c, facing), (rr, cc))
rr = 100 + cc
cc = 49
assert rr >= 0 and cc >= 0, ((r, c, facing), (rr, cc))
# assert 6
assert 150 <= rr < 200 and 0 <= cc < 50, (
(r, c, facing),
(rr, cc),
)
ff = "W"
# left edge 6
elif cc == -1 and 150 <= rr < 200:
assert ff == "W", ((r, c, facing), (rr, cc))
cc = rr - 100
rr = 0
assert rr >= 0 and cc >= 0, ((r, c, facing), (rr, cc))
# assert 1
assert 0 <= rr < 50 and 50 <= cc < 100, (
(r, c, facing),
(rr, cc),
)
ff = "S"
# right edge 6
elif cc == 50 and 150 <= rr < 200 and ff == "E":
assert ff == "E", ((r, c, facing), (rr, cc))
cc = rr - 100
rr = 149
assert rr >= 0 and cc >= 0, ((r, c, facing), (rr, cc))
# assert 5
assert 100 <= rr < 150 and 50 <= cc < 100, (
(r, c, facing),
(rr, cc),
)
ff = "N"
# bottom edge 6
elif rr == 200 and 0 <= cc < 50:
assert ff == "S", ((r, c, facing), (rr, cc))
rr = 0
cc = cc + 100
assert rr >= 0 and cc >= 0, ((r, c, facing), (rr, cc))
# assert 2
assert 0 <= rr < 50 and 100 <= cc < 150, (
(r, c, facing),
(rr, cc),
)
ff = "S"
try:
val = grid[rr][cc]
except IndexError as e:
log(((r, c, facing), (rr, cc)))
raise e
if val == "#":
break
else:
r = rr
c = cc
facing = ff
return _ans(r, c, facing)
TEST = tuple(
"""\
...#
.#..
#...
....
...#.......#
........#...
..#....#....
..........#.
...#....
.....#..
.#......
......#.
10R5L5R10L4R5L5
""".splitlines()
)
@aoc_main(2022, 22, part_1, part_2)
def main() -> None:
assert part_1(TEST) == 6032
# assert part_2(TEST) == 5031
if __name__ == "__main__":
main()