Submission #11361086

---

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 = [[False] * (c + 2)]
for _ in range(r):
  row = [False]
  for mark in input():
    if mark == '#':
      row.append(False)
    else:
      row.append(True)
  row.append(False)
  maze.append(row)
maze.append([False] * (c + 2))

queue = deque([(sy, sx, 0)])
maze[sy][sx] = False
while queue:
  y, x, d = 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 maze[ny][nx]:
      queue.append((ny, nx, d))
      maze[ny][nx] = False
  else:
    continue
  break
else:
  print('Error')

Submission Info

Judge Result