Submission #2387515

---

Source Code Expand

import queue
def rectlist(x,A,B):
    return [[x for i in range(B)] for i in range(A)]
INF = 10**2
R,C=map(int,input().split())
sx,sy=map(int,input().split())
gx,gy=map(int,input().split())
maze=[list(input()) for i in range(R)]
d=rectlist(INF,R,C)
s=(sx-1,sy-1)
g=(gx-1,gy-1)
dR=[(1,0),(-1,0),(0,1),(0,-1)]
d[s[0]][s[1]]=0
q=queue.Queue()
q.put(s)
while(not(q.empty())):
    r=q.get()
    x=r[0];y=r[1]
    if (x==g[0] and y==g[1]):
        break
    for dr in dR:
        nx=x+dr[0]
        ny=y+dr[1]
        if 0<=nx<R and 0<=ny<C:
            if maze[nx][ny]!="#" and d[nx][ny]==INF:
                q.put((nx,ny))
                d[nx][ny]=d[r[0]][r[1]]+1
print(d[g[0]][g[1]])

Submission Info

Judge Result