Node.js) 백준 16920번: 확장 게임

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

16920번: 확장 게임

 

class Node {
	constructor(item) {
		this.item = item;
		this.next = null;
	}
}

class Queue {
	constructor() {
		this.head = null;
		this.tail = null;
		this.length = 0;
	}

	push(item) {
		const node = new Node(item);
		if (this.head == null) {
			this.head = node;
		} else {
			this.tail.next = node;
		}

		this.tail = node;
		this.length += 1;
	}

	pop() {
		const popItem = this.head;
		this.head = this.head.next;
		this.length -= 1;
		return popItem.item;
	}
}
const fs = require('fs');
let input = fs
	.readFileSync('./dev/stdin')
	.toString()
	.trim()
	.split('\n')
	.map((v) => v.trim());
const [N, M, P] = input.shift().split(' ').map(Number);
const S = input.shift().split(' ').map(Number);
S.unshift(0);
let board = input.map((v) => v.split(''));
const q = Array.from(Array(P + 1), () => new Queue());
let score = Array(P + 1).fill(0);

for (let i = 0; i < N; i++) {
	for (let j = 0; j < M; j++) {
		const num = Number(board[i][j]);
		if (!Number.isNaN(num)) {
			q[num].push([i, j]);
			score[num]++;
		}
	}
}

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

let CONTINUE = true;
while (CONTINUE) {
	CONTINUE = false;
	for (let p = 1; p <= P; p++) {
		for (let move = S[p]; move > 0; move--) {
			const L = q[p].length;
			if (L == 0) break;
			for (let l = 0; l < L; l++) {
				const [x, y] = q[p].pop();
				for (let k = 0; k < 4; k++) {
					const nx = x + dx[k];
					const ny = y + dy[k];
					if (nx < 0 || ny < 0 || nx >= N || ny >= M) continue;
					if (board[nx][ny] == '.') {
						q[p].push([nx, ny]);
						board[nx][ny] = p;
						score[p]++;
						CONTINUE = true;
					}
				}
			}
		}
	}
}
console.log(score.slice(1).join(' '));