Node.js) 백준: 15662번: 톱니바퀴(2)

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

15662번: 톱니바퀴 (2)

const fs = require('fs');
const input = fs.readFileSync("./dev/stdin").toString().trim().split("\n")
const N = input.shift();

const gears = [];
for (let i = 0; i < N; i++) {
  const gear = input.shift().trim().split('')
  gears.push(gear)
}
const K = input.shift();
const rotation = input.map(v => v.trim().split(' ')).map(v => {
  const clockwise = v[1] == '1' ? true : false
  return { index: v[0] - 1, clockwise: clockwise }
})


const goClock = (i) => {
  gears[i].unshift(gears[i].pop())
}

const goCountClock = (i) => {
  gears[i].push(gears[i].shift())
}




for (let i = 0; i < K; i++) {
  const { index, clockwise } = rotation.shift();
  let nowLeft = gears[index][6];
  let nowRight = gears[index][2];
  let left = index - 1;
  let right = index + 1;
  let leftClock = !clockwise
  let rightClock = !clockwise
  if (clockwise) {
    goClock(index)
  } else {
    goCountClock(index)
  }

  while (left > -1) {
    const prevRight = gears[left][2];
    if (prevRight == nowLeft) break;
    nowLeft = gears[left][6];
    if (leftClock) {
      goClock(left)
    } else {
      goCountClock(left)
    }
    leftClock = !leftClock
    left--;
  }

  while (right < N) {
    const nextLeft = gears[right][6];
    if (nextLeft == nowRight) break;
    nowRight = gears[right][2];
    if (rightClock) {
      goClock(right)
    } else {
      goCountClock(right)
    }
    rightClock = !rightClock
    right++;
  }
}

let answer = 0;
gears.forEach(v => {
  if (v[0] == '1') answer++;
})
console.log(answer)