Submission #1436267

---

Source Code Expand

import collections
r, c = map(int, input().split())
sy, sx = map(int, input().split())
gy, gx = map(int, input().split())
a = []
b = [[-1 for i in range(c)] for j in range(r)]
for i in range(r):
    a.append(input())

queue = collections.deque()

queue.append((sy-1, sx-1))
b[sy-1][sx-1] = 0
while len(queue) > 0 and b[gy-1][gx-1] == -1:
    point = queue.popleft()
    if a[point[0] - 1][point[1]] == '.' and b[point[0] - 1][point[1]] == -1:
        b[point[0] - 1][point[1]] = b[point[0]][point[1]] + 1
        queue.append((point[0] - 1, point[1]))
    if a[point[0]][point[1] + 1] == '.' and b[point[0]][point[1] + 1] == -1:
        b[point[0]][point[1] + 1] = b[point[0]][point[1]] + 1
        queue.append((point[0], point[1] + 1))
    if a[point[0] + 1][point[1]] == '.' and b[point[0] + 1][point[1]] == -1:
        b[point[0] + 1][point[1]] = b[point[0]][point[1]] + 1
        queue.append((point[0] + 1, point[1]))
    if a[point[0]][point[1] - 1] == '.' and b[point[0]][point[1] - 1] == -1:
        b[point[0]][point[1] - 1] = b[point[0]][point[1]] + 1
        queue.append((point[0], point[1] - 1))

print(b[gy-1][gx-1])

Submission Info

Judge Result