-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtask 14.js
220 lines (185 loc) · 4.95 KB
/
task 14.js
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
var test_input = `498,4 -> 498,6 -> 496,6
503,4 -> 502,4 -> 502,9 -> 494,9`;
const Tiles = {
Air: "⬛",
Sand: "🟡",
Wall: "🟫",
};
const make_map = (lines, floor = false) => {
const aa = { x: 1000, y: 0 };
const bb = { x: -1, y: -1 };
lines.forEach((line) =>
line.forEach(({ x, y }) => {
if (+aa.x > +x) aa.x = +x;
if (+bb.x < +x) bb.x = +x;
if (+bb.y < +y) bb.y = +y;
})
);
aa.x -= floor ? 200 : 1;
bb.x += floor ? 200 : 1;
bb.y += 2;
const width = +bb.x - +aa.x;
const height = +bb.y - +aa.y;
const tiles = Array.from({ length: +height }, (_) =>
Array.from({ length: +width }, (_) => Tiles.Air)
);
const at = (x, y) => {
if (floor && y == bb.y) return Tiles.Wall;
return tiles[+y - +aa.y][+x - +aa.x];
};
const set = (x, y, what) => {
tiles[+y - +aa.y][+x - +aa.x] = what;
};
const boundary_check = (x, y) => {
if (+x - +aa.x < 0) return false;
if (+y - +aa.y < 0) return false;
if (+x - +bb.x > 0) return false;
if (+y - +bb.y > 0) return false;
return true;
};
lines.forEach((line) => {
const [start_point, ...rest_points] = line;
const brush = { ...start_point };
set(brush.x, brush.y, Tiles.Wall);
rest_points.forEach((p) => {
do {
if (+brush.x != +p.x) brush.x += p.x > brush.x ? 1 : -1;
if (+brush.y != +p.y) brush.y += p.y > brush.y ? 1 : -1;
set(brush.x, brush.y, Tiles.Wall);
} while (+p.x != +brush.x || +p.y != +brush.y);
});
});
const start = { x: 500, y: aa.y };
return { tiles, aa, bb, at, set, start, boundary_check };
};
const sand_step = (map, { x, y }) => {
const target = { x, y };
target.y++;
if (!map.boundary_check(target.x, target.y)) {
map.set(x, y, Tiles.Air);
throw "out of bounds";
}
if (map.at(target.x, target.y) == Tiles.Air) {
map.set(x, y, Tiles.Air);
map.set(target.x, target.y, Tiles.Sand);
return target;
}
target.x--;
if (!map.boundary_check(target.x, target.y)) {
map.set(x, y, Tiles.Air);
throw "out of bounds";
}
if (map.at(target.x, target.y) == Tiles.Air) {
map.set(x, y, Tiles.Air);
map.set(target.x, target.y, Tiles.Sand);
return target;
}
target.x += 2;
if (!map.boundary_check(target.x, target.y)) {
map.set(x, y, Tiles.Air);
throw "out of bounds";
}
if (map.at(target.x, target.y) == Tiles.Air) {
map.set(x, y, Tiles.Air);
map.set(target.x, target.y, Tiles.Sand);
return target;
}
map.set(x, y, Tiles.Sand);
return null;
};
const solution_1 = (input, log = false) => {
const lines = input.split("\n").map((l) =>
l.split(" -> ").map((p) => {
const [x, y] = p.split(",");
return { x: +x, y: +y };
})
);
const map = make_map(lines);
let sand = map.start;
if (log) {
let t = setInterval(() => {
try {
sand = sand_step(map, sand);
if (!sand) sand = map.start;
print_map(map);
} catch (e) {
clearInterval(t);
console.log("Done with sand, total:", count_sand(map));
}
}, 50);
} else {
while (true) {
try {
sand = sand_step(map, sand);
if (!sand) sand = map.start;
} catch (e) {
break;
}
}
print_map(map);
return count_sand(map) - 1;
}
};
const count_sand = (map) =>
map.tiles.reduce(
(a, l) => +a + l.reduce((ac, t) => +ac + (t == Tiles.Sand ? 1 : 0), 0),
0
);
const print_map = (map) => {
// console.clear();
// map.set(500, 0, Tiles.Wall);
console.log(map.tiles.map((l) => l.join("")).join("\n"));
};
console.assert(
solution_1(test_input) == 24,
"Once all 24 units of sand shown above have come to rest, all further sand flows out the bottom, falling into the endless void"
);
// part 2
const solution_2 = (input, log = false) => {
const lines = input.split("\n").map((l) =>
l.split(" -> ").map((p) => {
const [x, y] = p.split(",");
return { x: +x, y: +y };
})
);
const map = make_map(lines, true);
let sand = map.start;
if (log) {
let t = setInterval(() => {
try {
sand = sand_step(map, sand);
if (!sand) sand = map.start;
if (map.at(map.start.x, map.start.y) == Tiles.Sand)
throw "Source blocked";
print_map(map);
} catch (e) {
clearInterval(t);
console.log("Done with sand, total:", count_sand(map));
}
}, 50);
} else {
while (true) {
try {
sand = sand_step(map, sand);
if (!sand) sand = map.start;
if (map.at(map.start.x, map.start.y) == Tiles.Sand)
throw "Source blocked";
} catch (e) {
break;
}
}
print_map(map);
return count_sand(map);
}
};
console.assert(
solution_2(test_input) == 93,
"In the example above, the situation finally looks like this after 93 units of sand come to rest"
);
const input = document.body.innerText.trim();
console.table({
"part 1": solution_1(input),
});
console.table({
"part 2": solution_2(input),
});