Node.js) 백준 1926번: 그림

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

1926번: 그림

 

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');
const input = fs.readFileSync('./dev/stdin').toString().trim().split('\n').map(v=>v.split(' ').map(Number));
const [N,M] = input.shift();

let art = input;
const dx = [0,0,1,-1];
const dy = [1,-1,0,0,];
let cnt = 0;
let max = 0;
for(let i = 0; i<N; i++){
    for(let j = 0; j<M; j++){
        if(art[i][j]==1){
            cnt++;
            const q = new Queue();
            q.push([i,j]);
            art[i][j] = 0;
            let size = 1;
            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>=N  || ny<0 || ny>=M || art[nx][ny]==0) continue;

                    art[nx][ny] = 0;
                    size++;
                    q.push([nx,ny])
                }

            }
            if(size>max) max = size;
        }
    }
}

console.log(cnt+'\n'+max)