Node.js)백준 17406: 배열 돌리기 4

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

17406번: 배열 돌리기 4

구현, 완전탐색(순열)

 

const fs = require('fs');
const input = fs.readFileSync("./dev/stdin").toString().trim().split("\n").map(v => v.split(' ').map(Number));
const [N, M, K] = input.shift();
const calc = [];
for (let i = 0; i < K; i++) {
  calc.unshift(input.pop())
}
const permutation = [];
let calcQ = [[]];
while (calcQ.length > 0) {
  const arr = calcQ.shift();
  if (arr.length == K) {
    permutation.push(arr)
  } else {
    for (let i = 0; i < K; i++) {
      if (!arr.includes(i)) {
        calcQ.push([...arr, i]);
      }
    }
  }
}

const rotateArray = (arr, r, c, s) => {
  let sx = r - s - 1;
  let sy = c - s - 1;
  let ex = r + s - 1;
  let ey = c + s - 1;
  while (sx < ex) {
    const temp1 = arr[sx][ey]
    for (let i = ey - 1; i >= sy; i--) {
      arr[sx][i + 1] = arr[sx][i]
    }
    const temp2 = arr[ex][ey];
    for (let i = ex - 1; i > sx; i--) {
      arr[i + 1][ey] = arr[i][ey]
    }
    arr[sx + 1][ey] = temp1;

    const temp3 = arr[ex][sy];
    for (let i = sy + 1; i <= ey; i++) {
      arr[ex][i - 1] = arr[ex][i];
    }
    arr[ex][ey - 1] = temp2;

    for (let i = sx + 1; i <= ex; i++) {
      arr[i - 1][sy] = arr[i][sy];
    }
    arr[ex - 1][sy] = temp3;
    sx++;
    ex--;
    sy++;
    ey--;
  }
  return arr;
}


const check = (board) => {
  let min = Infinity;
  for (let i = 0; i < N; i++) {
    const temp = board[i].reduce((r, v) => { return r + v }, 0);
    if (temp < min) min = temp;
  }
  return min;
}

let answer = Infinity;



permutation.forEach(order => {
  let arr = [];
  input.map(v => arr.push([...v]))
  order.forEach(x => {
    const [r, c, s] = calc[x]
    arr = rotateArray(arr, r, c, s);
  })
  const temp = check(arr);
  if (temp < answer) answer = temp;
})

console.log(answer)