Submission #423528

---

Source Code Expand

import scala.collection.immutable.Stack
import scala.annotation.tailrec

object Main {

  val Array(h,w,_*) = readLine.split(" ").map(_.toInt)
  val grid = (for(i <- 0 until h) yield readLine).toArray

  type Cell = (Int,Int)

  def next(now: Cell, used: Set[Cell]): List[Cell] = {
    List((0,-1), (1,0), (0,1), (-1,0))
    .flatMap{case (dx:Int, dy:Int) => List((now._1 + dx, now._2 + dy))}
    .filter((d:Cell) => 0 <= d._1 && 0 <= d._2 && d._1 < w && d._2 < h)
    .filter((d:Cell) => grid(d._2)(d._1)!='#' && !used.contains(d))
  }

  @tailrec
  def dfs(stk: Stack[Cell], used: Set[Cell] = Set.empty[Cell]): Boolean = {

    val (now, res) = stk.pop2

    if(grid(now._2)(now._1)=='g') true
    else {
      val nx = next(now,used)
      if(res.size + nx.size == 0) false
      else dfs(res.pushAll(nx), used + now)
    }
  }

  def main (args: Array[String]): Unit = {
    val res = for{
      sy <- 0 until h
      sx <- 0 until w
      if(grid(sy)(sx)=='s')
    } yield dfs(Stack((sx,sy)))

    println(if(res.fold(false)(_ | _))"Yes" else "No")
  }
}

Submission Info

Compile Error

warning: there were four deprecation warnings; re-run with -deprecation for details
one warning found

Judge Result