Node.js) 백준 1189번: 컴백홈

 

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

1189번: 컴백홈

const fs = require('fs');
const input = fs.readFileSync("./dev/stdin").toString().trim().split("\n");
const [N, M, K] = input.shift().split(' ').map(Number);
const board = input.map(v => v.trim().split(''));

/// start: [N-1,0]
// end: [0,M-1];
const dx = [0, 0, 1, -1];
const dy = [1, -1, 0, 0];

let visited = Array.from(Array(N), () => Array(M).fill(false));
visited[N - 1][0] = true;

const answer = [];
function dfs(x, y, cnt) {
  if (x == 0 && y == M - 1) {
    answer.push(cnt);
    return;
  }
  cnt++;
  for (let i = 0; i < 4; i++) {
    const nx = x + dx[i];
    const ny = y + dy[i];
    if (nx >= 0 && nx < N && ny >= 0 && ny < M && !visited[nx][ny] && board[nx][ny] != 'T') {
      visited[x][y] = true;
      dfs(nx, ny, cnt)
      visited[x][y] = false;
    }
  }
}

dfs(N - 1, 0, 1)


console.log(answer.filter(v => v == K).length)