Node.js) 백준 11559번: Puyo Puyo

 

https://www.acmicpc.net/submit/11559/63166057

로그인

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 input = require('fs')
        .readFileSync('./dev/stdin')
        .toString()
        .trim()
        .split('\n')
        .map((v) => v.trim().split(''));

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

let board = Array.from(Array(6), () => Array(12).fill(null));

for (let i = 0; i < 12; i++) {
        for (let j = 0; j < 6; j++) {
                board[j][i] = input[i][j];
        }
}

// 뿌요가 터진다.
function puyo() {
        let flag = false;
        let visited = Array.from(Array(6), () => Array(12).fill(false));
        for (let i = 0; i < 6; i++) {
                for (let j = 0; j < 12; j++) {
                        if (board[i][j] != '.' && !visited[i][j]) {
                                const alpha = board[i][j];
                                const cnt = [];
                                const q = new Queue();
                                visited[i][j] = true;
                                cnt.push([i, j]);
                                q.push([i, j]);
                                while (q.length > 0) {
                                        const [x, y] = q.pop();
                                        for (let k = 0; k < 4; k++) {
                                                const nx = x + dx[k];
                                                const ny = y + dy[k];
                                                if (nx < 0 || nx >= 6 || ny < 0 || ny >= 12 || visited[nx][ny])
                                                        continue;
                                                if (board[nx][ny] == alpha) {
                                                        visited[nx][ny] = true;
                                                        cnt.push([nx, ny]);
                                                        q.push([nx, ny]);
                                                }
                                        }
                                }
                                if (cnt.length >= 4) {
                                        flag = true;
                                        cnt.forEach((v) => {
                                                const [x, y] = v;
                                                board[x][y] = '.';
                                        });
                                }
                        }
                }
        }
        return flag;
}

// 뿌요가 내려온다.
function next() {
        for (let i = 0; i < 6; i++) {
                board[i] = board[i].filter((v) => v != '.');
                while (board[i].length < 12) {
                        board[i].unshift('.');
                }
        }
}

let answer = 0;

while (true) {
        const result = puyo();
        if (result) {
                answer++;
                next();
        } else {
                break;
        }
}
console.log(answer);