Submission #3040596

---

Source Code Expand

R, C = list(map(int, input().split()))
sy, sx = list(map(int, input().split()))
gy, gx = list(map(int, input().split()))
c = [input() for _ in range(R)]

moves = [(-1, 0), (1, 0), (0, -1), (0, 1)]

def bfs():
    visited = [[False for _ in range(C)] for _ in range(R)]
    dist = [[1 for _ in range(C)] for _ in range(R)]
    routes = [(sx-1, sy-1)]
    visited[sy-1][sx-1] = True

    hop_count = 0
    while len(routes) > 0:
        x, y = routes.pop(0)
        for move in moves:
            cx, cy = x + move[0], y + move[1]
            if cx < 0 or cy < 0 or cx >= C or cy >= R or c[cy][cx] == '#' or visited[cy][cx]:
                continue
            if cx == gx-1 and cy == gy-1:
                return dist[y][x]
            visited[cy][cx] = True
            routes.append((cx, cy))
            dist[cy][cx] = dist[y][x] + 1

print(bfs())

Submission Info

Judge Result