-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathday06.ts
More file actions
266 lines (240 loc) · 4.94 KB
/
day06.ts
File metadata and controls
266 lines (240 loc) · 4.94 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
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
import { readInput } from "./util.ts";
if (import.meta.main) {
const input = await readInput();
console.log("Part 1:", part1(input));
console.log("Part 2:", part2(input));
}
function buildGrid(input: string): [string[][], number, number] {
const grid = input.split("\n").map((row) => row.split(""));
let startY = -1;
let startX = -1;
findGuard: for (let i = 0; i < grid.length; i++) {
for (let j = 0; j < grid[0].length; j++) {
if (grid[i][j] === "^") {
startY = i;
startX = j;
break findGuard;
}
}
}
return [grid, startX, startY];
}
function part1(input: string): number {
let [grid, posX, posY] = buildGrid(input);
const visited = new Set();
for (
let dY = -1, dX = 0;
grid[posY]?.[posX] !== undefined;
posX += dX, posY += dY
) {
visited.add(`${posX},${posY}`);
if (grid[posY + dY]?.[posX + dX] === "#") [dX, dY] = [-dY, dX];
}
return visited.size;
}
function part2(input: string): number {
let [grid, posX, posY] = buildGrid(input);
for (const line of grid) {
console.log(line.join(""));
}
const newObstacles = new Set();
const visited = new Set([`${posX},${posY}`]);
for (
let dY = -1, dX = 0;
grid[posY]?.[posX] !== undefined;
posX += dX, posY += dY
) {
while (grid[posY + dY]?.[posX + dX] === "#") {
[dX, dY] = [-dY, dX];
}
// Does turning right form a loop?
const vectors = new Set();
const [newX, newY] = [posX + dX, posY + dY];
if (visited.has(`${newX},${newY}`)) {
// Already been here so don't try an obstacle!
visited.add(`${posX},${posY}`);
continue;
}
if (grid[newY]?.[newX] === undefined) continue;
for (
let dX2 = dX, dY2 = dY, posY2 = posY, posX2 = posX;
grid[posY2]?.[posX2] !== undefined;
posX2 += dX2, posY2 += dY2
) {
while (
grid[posY2 + dY2]?.[posX2 + dX2] === "#" ||
(posY2 + dY2 === newY && posX2 + dX2 === newX)
) {
[dX2, dY2] = [-dY2, dX2];
}
if (vectors.has(`${posX2},${posY2},${dX2},${dY2}`)) {
// We have a loop, store location in front of actual path
newObstacles.add(`${newX},${newY}`);
break;
}
vectors.add(`${posX2},${posY2},${dX2},${dY2}`);
}
// console.log(posX, posY, newX, newY, vectors);
visited.add(`${posX},${posY}`);
}
console.log(newObstacles);
return newObstacles.size;
}
// Test
import { assertEquals } from "jsr:@std/assert@1.0.8";
Deno.test("Part 1: ", () => {
const out = part1(`....#.....
.........#
..........
..#.......
.......#..
..........
.#..^.....
........#.
#.........
......#...`);
assertEquals(out, 41);
});
Deno.test("Part 2: ", () => {
const out = part2(`....#.....
.........#
..........
..#.......
.......#..
..........
.#..^.....
........#.
#.........
......#...`);
assertEquals(out, 6);
});
Deno.test("Part 2: Straight loop", () => {
const out = part2(`......#...
.......#..
..........
.....#....
....^.#...`);
assertEquals(out, 1);
});
Deno.test("Part 2: None", () => {
const out = part2(`......#...
.......#..
..........
..........
....^.#...`);
assertEquals(out, 0);
});
Deno.test("Part 2: False Positive!", () => {
const out = part2(`...##.....
.........#
........#.
..........
...^......`);
assertEquals(out, 1);
});
Deno.test("Part 2: Out of Bounds", () => {
const out = part2(`.........#
..#.......
........#.
..........
...^......`);
assertEquals(out, 0);
});
Deno.test("Part 2: Another test", () => {
const out = part2(`...........
.#.........
.........#.
..#........
.......#...
....#......
...#...#...
......#....
...........
........#..
.^.........`);
assertEquals(out, 4);
});
Deno.test("Part 2: Electric boogaloo", () => {
const out = part2(`.#..
#..#
....
^...
#...
.#..`);
assertEquals(out, 1);
});
Deno.test("Part 2: The guard strikes back", () => {
const out = part2(`.#....
.....#
...^..
#.....
....#.`);
assertEquals(out, 1);
});
Deno.test("Part 2: Return of the guard", () => {
const out = part2(`.#..
#..#
#...
#...
#...
#...
.^..
..#.`);
assertEquals(out, 6);
});
Deno.test("Part 2: Return of the guard 2", () => {
const out = part2(`.##........
#.........#
#..........
#.....#....
#....#.....
#...#......
..^........
.........#.`);
assertEquals(out, 7);
});
Deno.test("Part 2: The 2 guards", () => {
const out = part2(`...........
.#.........
.........#.
..#........
.......#...
....#......
...#...#...
......#....
...........
........#..
.^.........`);
assertEquals(out, 4);
});
Deno.test("Part 2: None again", () => {
const out = part2(`.##.
#..#
....
..^.`);
assertEquals(out, 0);
});
Deno.test("Part 2: None again", () => {
const out = part2(`#.....
.....#
^.#..#
....#.`);
assertEquals(out, 1);
});
Deno.test("Part 2: ...", () => {
const out = part2(`########
#......#
...^...#
########`);
assertEquals(out, 6);
});
Deno.test("Part 2: Edge case", () => {
const out = part2(`..#.....
.......#
........
.#......
#...#...
#.......
..^...#.`);
assertEquals(out, 4);
});