Node.js) 백준 29733번: 3차원 지뢰찾기

https://www.acmicpc.net/problem/29733

29733번: 3차원 지뢰찾기

const [RCH, ..._mine] = require('fs')
	.readFileSync('./dev/stdin')
	.toString()
	.trim()
	.split('\n')
	.map((v) => v.trim());
const [R, C, H] = RCH.split(' ').map(Number);
const mine = Array.from(Array(H), () => Array());
const answer = Array.from(Array(H), () => Array.from(Array(R), () => Array(C).fill(0)));
let index = 0;
for (let i = 0; i < H; i++) {
	for (let j = 0; j < R; j++) {
		mine[i].push(_mine[index].split(''));
		index++;
	}
}

const dh = [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1];
const dr = [1, 1, 1, 0, 0, 0, -1, -1, -1, 1, 1, 1, 0, 0, -1, -1, -1, 1, 1, 1, 0, 0, 0, -1, -1, -1];
const dc = [1, 0, -1, 1, 0, -1, 1, 0, -1, 1, 0, -1, 1, -1, 1, 0, -1, 1, 0, -1, 1, 0, -1, 1, 0, -1];

for (let h = 0; h < H; h++) {
	for (let r = 0; r < R; r++) {
		for (let c = 0; c < C; c++) {
			if (mine[h][r][c] == '*') {
				answer[h][r][c] = '*';
				continue;
			}
			for (let k = 0; k < 26; k++) {
				const nh = h + dh[k];
				const nr = r + dr[k];
				const nc = c + dc[k];

				if (nh < 0 || nh >= H) continue;
				if (nr < 0 || nr >= R) continue;
				if (nc < 0 || nc >= C) continue;
				if (mine[nh][nr][nc] == '*') {
					answer[h][r][c]++;
					answer[h][r][c] %= 10;
				}
			}
		}
	}
}
console.log(answer.map((v) => v.map((y) => y.join('')).join('\n')).join('\n'));