Submission #4323227

---

Source Code Expand

h, w = map(int, input().split())
sx, sy = map(int, input().split())
sx, sy = sx - 1, sy - 1
gx, gy = map(int, input().split())
gx, gy = gx - 1, gy -1
A = [list(input()) for i in range(h)]

INF = 100000000
D = [[INF] * w for i in range(h)]
dx = [1, 0, -1, 0]
dy = [0, 1, 0 , -1]

def bfs():
    que = []
    que.append([sx, sy])
    D[sx][sy] = 0
    
    while que != []:
        p = que.pop(0)
        if p[0] == gx and p[1] == gy:
            break
        for i in range(4):
            nx = p[0] + dx[i]
            ny = p[1] + dy[i]
            if 0 <= nx < h and 0 <= ny < w and A[nx][ny] != '#' and D[nx][ny] == INF:
                que.append([nx, ny])
                D[nx][ny] = D[p[0]][p[1]] + 1
            
    return D[gx][gy]

print(bfs())

Submission Info

Judge Result