Ratsun reitit

const { format } = require('path')
const readline = require('readline')
 
const rl = readline.createInterface({
  input: process.stdin,
  output: process.stdout,
  terminal: false
})
 
let inputN
 
rl.on('line', (line) => {
  inputN = parseInt(line)
  rl.close()
})
 
rl.on('close', () => {
  first = (n) => {
    //console.time('ratsu')
    let tiles = []
    let currentTiles = [{ x: 1, y: 1, number: "0" }]
    tiles.push(currentTiles[0])
    let i = 1
    while (true) {
 
      let newTiles = []
      currentTiles.forEach(cTile => {
        const cx = cTile.x
        const cy = cTile.y
        const arrayX = [-2, 2, -1, 1]
        arrayX.forEach(numberX => {
          let arrayY
          (numberX === -2 || numberX === 2)
            ? arrayY = [-1, 1]
            : arrayY = [-2, 2]
          arrayY.forEach(numberY => {
            x = cx + numberX
            y = cy + numberY
            if (x > 0 && x <= n && (y > 0 && y <= n)) {
              if (!tiles.find(item => item.x === x && item.y === y)) {
                const tile = { x, y, number: i }
                newTiles.push(tile)
                tiles.push(tile)
              }
            }
          })
        })
      })
      currentTiles = newTiles
      i++
      if (tiles.length === n * n) {
        break
      }
    }
    tiles = tiles.sort((a, b) => a.x - b.x)
    tiles = tiles.sort((a, b) => a.y - b.y)
    let printOut = ""
    tiles.forEach(tile => {
      printOut = printOut.concat(`${tile.number} `)
      if (tile.x === n && tile.y !== n) {
        printOut = printOut.concat("\n")
      }
    })
    return (printOut)
  }
  const second = (n) => {
    let tiles = []
    for (let y = 1; y <= n; y++) {
      for (let x = 1; x <= n; x++) {
        tiles.push({ y, x })
      }
    }
    tiles[0].number = 0
    let currentTiles = [{ x: 1, y: 1 }]
    let i = 1
    while (true) {
      let possibleTiles = []
      currentTiles.forEach(cTile => {
        const cx = cTile.x
        const cy = cTile.y
        tiles.forEach((pTile, ii) => {
          if (((pTile.x === cx - 2 || pTile.x === cx + 2) && (pTile.y === cy - 1 || pTile.y === cy + 1)) || ((pTile.x === cx - 1 || pTile.x === cx + 1) && (pTile.y === cy - 2 || pTile.y === cy + 2))) {
            if (!pTile.number && pTile.number !== 0) {
              tiles[ii].number = i
              possibleTiles.push(pTile)
            }
          }
        })
      })
      currentTiles = possibleTiles
      i++
      if (tiles.filter(tile => tile.number).length + 1 === tiles.length) {
        break
      }
    }
    let printOut = ""
    tiles.forEach(tile => {
      printOut = printOut.concat(`${tile.number} `)
      if (tile.x === n && tile.y !== n) {
        printOut = printOut.concat("\n")
      }
    })
    return (printOut)
  }
  /*
  for(let i = 4; i<=100; i++){
    console.log(first(i)===second(i))
  }
  */
  //console.log(first(inputN))
  console.log(second(inputN))
})
 
 
 
 
 
 
 
 

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

Test 8

Group: 2, 3

Verdict: ACCEPTED

Test 9

Group: 2, 3

Verdict: ACCEPTED

Test 10

Group: 2, 3

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED