Node.js)백준 16197번: 두 동전

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

16197번: 두 동전

const input = require('fs').readFileSync('./dev/stdin').toString().trim().split('\n')
const [R,C]= input[0].split(' ').map(Number)
let board = input.splice(1).map(v=>v.trim().split(''));
const coin = [];
const dirSet = [[0,1],[0,-1],[1,0],[-1,0]]


for(let i = 0; i<R; i++){
  for(let j = 0; j<C; j++){
    if(board[i][j]=='o'){
      coin.push([i,j])
      board[i][j] = '.'
    }
  }
}
let answer = 999;
function twoCoin(a,b,cnt){
  if(cnt<=10){
    for(let i = 0; i<4; i++){
      const dir = dirSet[i];
      let moveA = [a[0]+dir[0],a[1]+dir[1]]
      let moveB = [b[0]+dir[0],b[1]+dir[1]]
      let stateA = false;
      let stateB = false;
      if(moveA[0]>-1 && moveA[0]<R && moveA[1]>-1 && moveA[1]<C) stateA = true;    
      if(moveB[0]>-1 && moveB[0]<R && moveB[1]>-1 && moveB[1]<C) stateB = true;

      if(stateA^stateB){ //종료: 하나만 true; 
        if(cnt<answer)
        answer = cnt;
        return;
      }else if(stateA&stateB){ // 둘다 true, 
        if(board[moveA[0]][moveA[1]]=='#'){
          moveA = a;
        }
        if(board[moveB[0]][moveB[1]]=='#'){
          moveB = b;
        }

        if(!(moveA[0]==moveB[0] && moveA[1]==moveB[1])){
          twoCoin(moveA,moveB,cnt+1)
        }
      }
    }
  }
}


twoCoin(coin[0],coin[1],1);
if(answer==999) answer = -1
console.log(answer)