Submission #10092973

---

Source Code Expand

r,c=map(int,input().split())
sy,sx=map(int,input().split())
gy,gx=map(int,input().split())
maze=[list(input()) for _ in range(r)]
#maze[r][c]
#bfs
from collections import deque
que=deque([])
start=(sx-1,sy-1)
goal=(gx-1,gy-1)
que.append(start)
dist=[[-1]*c for _ in range(r)]
dist[sy-1][sx-1]=0
da=[0,1,0,-1]
db=[1,0,-1,0]
while que:
    a,b=que.popleft()
    kyori = dist[b][a]
    for i in range(4):
        na=a+da[i]
        nb=b+db[i]
        if na in range(c) and nb in range(r):
            if maze[nb][na]=='.' and dist[nb][na]==-1:
                dist[nb][na]=kyori+1
                que.append((na,nb))
print(dist[gy-1][gx-1])

Submission Info

Judge Result