Submission #4313446

---

Source Code Expand

import scala.io.{StdIn => in}

object Main extends App {
  val Array(r, c) = in.readLine.split(" ").map(_.toInt)
  val Array(sy, sx) = in.readLine.split(" ").map(_.toInt - 1)
  val Array(gy, gx) = in.readLine.split(" ").map(_.toInt - 1)
  val maze = Iterator.continually(in.readLine)
    .take(r)
    .map(_.map(ch => if(ch == '.') true else false).toArray)
    .toArray


  val ans = {
    val dx = Array( 0, 1, 0,-1)
    val dy = Array( 1, 0,-1, 0)
    val map = Array.ofDim[Int](r,c)
    val que = collection.mutable.Queue.empty[(Int,Int)]
    val s = (sy,sx)
    que += s
    maze(sy)(sx) = false

    while(!que.isEmpty) {
      val(y,x) = que.dequeue

      if(y == gy && x == gx) que.clear
      else {
        for(i <- 0 until 4) {
          val nx = x + dx(i)
          val ny = y + dy(i)
          if(0 <= nx && nx < c && 0 <= ny && ny < r && maze(ny)(nx)) {
            map(ny)(nx) = map(y)(x) + 1
            maze(ny)(nx) = false
            val next = (ny, nx)
            que += next
          }
        }
      }
    }
    // map.foreach(e => println(e.mkString))
    map(gy)(gx)
  }

  println(ans)
}

Submission Info

Judge Result