Submission #11361007

---

Source Code Expand

from collections import deque

r, c = map(int, input().split())
sy, sx = map(int, input().split())
gy, gx = map(int, input().split())
maze = ['#' * (c + 2)]
for _ in range(r):
  maze.append('#' + input() + '#')
maze.append('#' * (c + 2))

queue = deque([(sy, sx, 0, 0, 0)])
while queue:
  y, x, d, py, px = queue.popleft()
  d += 1
  for dy, dx in ((1, 0), (-1, 0), (0, 1), (0, -1)):
    ny, nx = y + dy, x + dx
    if (ny, nx) == (gy, gx):
      print(d)
      break
    elif (ny, nx) != (py, px) and maze[ny][nx] != '#':
      queue.append((ny, nx, d, y, x))
  else:
    continue
  break
else:
  print('Error')

Submission Info

Judge Result