52 lines
1.6 KiB
TypeScript
52 lines
1.6 KiB
TypeScript
|
import { Pos, HeightMap, getCell, TOP_HEIGHT, readMap, displayMap } from "./solve_1.ts";
|
||
|
|
|
||
|
|
function countReachableTop(pos: Pos, map: HeightMap): number {
|
||
|
|
const stack: {
|
||
|
|
pos: Pos;
|
||
|
|
height: number;
|
||
|
|
}[] = [];
|
||
|
|
// const visited = new Set<string>();
|
||
|
|
stack.push({ pos, height: getCell(map, pos) });
|
||
|
|
let count = 0;
|
||
|
|
while (stack.length > 0) {
|
||
|
|
const { pos, height } = stack.pop()!;
|
||
|
|
const [x, y] = pos;
|
||
|
|
if (getCell(map, pos) === TOP_HEIGHT) {
|
||
|
|
// if (visited.has(pos.toString())) {
|
||
|
|
// continue;
|
||
|
|
// }
|
||
|
|
// visited.add(pos.toString());
|
||
|
|
count++;
|
||
|
|
continue;
|
||
|
|
}
|
||
|
|
for (const [dx, dy] of [[1, 0], [-1, 0], [0, 1], [0, -1]]) {
|
||
|
|
const [nx, ny] = [x + dx, y + dy];
|
||
|
|
if (nx < 0 || nx >= map[0].length || ny < 0 || ny >= map.length) {
|
||
|
|
continue;
|
||
|
|
}
|
||
|
|
const nheight = getCell(map, [nx, ny]);
|
||
|
|
if (nheight == height + 1) {
|
||
|
|
stack.push({ pos: [nx, ny], height: nheight });
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return count;
|
||
|
|
}
|
||
|
|
|
||
|
|
if (import.meta.main) {
|
||
|
|
const map = await readMap("input.txt");
|
||
|
|
displayMap(map);
|
||
|
|
const data = map.map((row, y) => {
|
||
|
|
return row.map((cell, x) => {
|
||
|
|
if (cell === 0) {
|
||
|
|
const count = countReachableTop([x, y], map);
|
||
|
|
console.log("count reachable top from", [x, y]);
|
||
|
|
return count;
|
||
|
|
}
|
||
|
|
return -5;
|
||
|
|
});
|
||
|
|
});
|
||
|
|
displayMap(data);
|
||
|
|
console.log(data.flat().reduce((a, b) => a + (b < 0 ? 0 : b ), 0));
|
||
|
|
}
|