Node.js)백준 5427번: 불

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

5427번: 불

const fs = require('fs');
const input = fs.readFileSync('./dev/stdin').toString().trim().split('\n');

// '.': 빈 공간
// '#': 벽
// '@': 상근이의 시작 위치
// '*': 불

const T = +input.shift();

const dx = [0, 0, -1, 1];
const dy = [1, -1, 0, 0];

const answer = [];
for (let i = 0; i < T; i++) {
	const [M, N] = input.shift().split(' ').map(Number);
	let board = input.splice(0, N).map((v) => v.split(''));
	const result = sol(M, N, board);
	answer.push(result);
}

console.log(answer.join('\n'));

function sol(M, N, board) {
	let fullTime = [];
	let fire = [];
	let time = 1;
	let visited = Array.from(Array(N), () => Array(M).fill(false));
	for (let i = 0; i < N; i++) {
		for (let j = 0; j < M; j++) {
			if (board[i][j] == '@') {
				fullTime.push([i, j]);
				board[i][j] = '.';
				visited[i][j] = true;
			} else if (board[i][j] == '*') {
				fire.push([i, j]);
			}
		}
	}

	while (fullTime.length > 0) {
		// 상근이 이동하기
		const newFullTime = [];
		while (fullTime.length > 0) {
			const [x, y] = fullTime.pop();
			if (board[x][y] == '*') continue;
			for (let l = 0; l < 4; l++) {
				const nx = x + dx[l];
				const ny = y + dy[l];
				if (nx < 0 || nx >= N || ny < 0 || ny >= M) {
					return time;
				}

				if (board[nx][ny] == '.' && !visited[nx][ny]) {
					visited[nx][ny] = true;
					newFullTime.push([nx, ny]);
				}
			}
		}
		fullTime = newFullTime;

		// 불!!!!
		const newFire = [];
		while (fire.length > 0) {
			const [x, y] = fire.pop();
			for (let l = 0; l < 4; l++) {
				const nx = x + dx[l];
				const ny = y + dy[l];
				if (
					nx < 0 ||
					nx >= N ||
					ny < 0 ||
					ny >= M ||
					board[nx][ny] == '*' ||
					board[nx][ny] == '#'
				)
					continue;

				if (board[nx][ny] == '.') {
					board[nx][ny] = '*';
					newFire.push([nx, ny]);
				}
			}
		}
		fire = newFire;

		//시간++
		time++;
	}

	return 'IMPOSSIBLE';
}