Node.js)백준 17143번: 낚시왕

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

17143번: 낚시왕

구현 문제

 

const fs = require('fs');
const input = fs.readFileSync("./dev/stdin").toString().trim().split("\n").map(v => v.split(' ').map(Number));
const [R, C, S] = input.shift();
if (S == 0) {
  process.exit(console.log(0));
}

let shark = Array.from(Array(R), () => Array(C).fill(false));

const dir = [
  [0, -1],
  [0, 1],
  [1, 0],
  [-1, 0]
]

input.forEach(v => {
  const [r, c, s, d, z] = v;
  shark[r - 1][c - 1] = [s, d, z]
})




let answer = 0;
for (let i = 0; i < C; i++) {
  const king = i;
  //낚시
  for (let fishing = 0; fishing < R; fishing++) {
    if (shark[fishing][king]) {
      answer += shark[fishing][king][2];
      shark[fishing][king] = false;
      break;
    }
  }

  // 상어 이동,
  let nextShark = Array.from(Array(R), () => Array(C).fill(false));
  for (let r = 0; r < R; r++) {
    for (let c = 0; c < C; c++) {
      if (shark[r][c]) {
        const [s, d, z] = shark[r][c];
        let rest = s;
        let location = { r, c };
        let direction = d;
        while (rest > 0) {
          switch (direction) {
            case 1: //위
              if (location.r - rest >= 0) {
                location.r -= rest
                rest = 0;
              } else {
                rest -= location.r;
                location.r = 0;
                direction = 2;
              }
              break;
            case 2://아래
              if (location.r + rest < R) {
                location.r += rest
                rest = 0;
              } else {
                rest -= (R - location.r - 1);
                location.r = R - 1;
                direction = 1;
              }
              break;
            case 3:// 오른쪽
              if (location.c + rest < C) {
                location.c += rest
                rest = 0;
              } else {
                rest -= (C - location.c - 1);
                location.c = C - 1;
                direction = 4;
              }
              break;
            case 4://왼쪽
              if (location.c - rest >= 0) {
                location.c -= rest
                rest = 0;
              } else {
                rest -= location.c;
                location.c = 0;
                direction = 3;
              }
              break;
          }
        }
        if (!nextShark[location.r][location.c] || (nextShark[location.r][location.c][2] < z)) {
          nextShark[location.r][location.c] = [s, direction, z];
        }
      }
    }
  }

  shark = nextShark;
}

console.log(answer)