이코테 bfs #data class #굉장히 중요

 

import java.util.*
 
data class dot(var x: Int, var y: Int) {
 
}
 
fun main(){
 
    val(n,m)= readLine()!!.split(" ").map{it.toInt()}
 
    val graph = mutableListOf<MutableList<Int>>()
    for(i in 0 until n){
        graph.add(readLine()!!.map{it.toInt()-48}.toMutableList())
    }
   // println(graph)
    val dx = mutableListOf(-1,1,0,0)
    val dy = mutableListOf(0,0,-1,1)
 
    fun bfs(x:Int,y:Int): Int {
        var x =x
        var y = y
        var q : Queue<dot> = LinkedList<dot>()
        q.add(dot(x,y))
 
        while(!q.isEmpty()){
            val(x,y)= q.poll()
           // println(d.x)
           // println(d.y)
 
            for(i in 0 until 4){
                var nx = x+dx[i]
                var ny = y+dy[i]
 
                if(nx<0 || nx >= n || ny<0 || ny>=m){
                    continue
                }
                if(graph[nx][ny]==0)
                    continue
                if(graph[nx][ny]==1){
                    graph[nx][ny] = graph[x][y]+1
                    //println("x: $x y: $y  nx: $nx ny: $ny graph[x][y]: " +
                    //        "${graph[x][y]} graph[nx][ny]: ${graph[nx][ny]}")
                    q.add(dot(nx,ny))
                   // println(q)
                }
            }
        }
        //println(graph)
        return graph[n-1][m-1]
    }
 
    print(bfs(0,0))
}