Problem: A maze is composed of a grid of H \times W squares - H vertical, W horizontal.  The square at the i-th row from the top and the j-th column from the left - (i,j) \- is a wall if S_{ij} is `#` and a road if S_{ij} is `.`.  There is a magician in (C_h,C_w). He can do the following two kinds of moves:    * Move A: Walk to a road square that is vertically or horizontally adjacent to the square he is currently in.   * Move B: Use magic to warp himself to a road square in the 5\times 5 area centered at the square he is currently in.  In either case, he cannot go out of the maze.  At least how many times does he need to use the magic to reach (D_h, D_w)?

Submission attempts (in order):

from collections import deque

h, w = map(int, input().split())
ch, cw = map(int, input().split())
dh, dw = map(int, input().split())



base = ["#" * (w + 4)]
base.append("#" * (w + 4))
for n in range(h):
    base.append("##" + input() + "##")
base.append("#" * (w + 4))
base.append("#" * (w + 4))
ans = [[-1] * (w + 4) for _ in range(h + 4)]
for i in range(h + 4):
    for j in range(w + 4):
        if base[i][j] == "#":
            ans[i][j] = -2
ch += 1
cw += 1
dh += 1
dw += 1

ans[ch][cw] = 0
move1 = [[1, 0], [-1, 0], [0, 1], [0, -1]]
move2 = [
        [-2, -2], [-2, -1], [-2, 0], [-2, 1], [-2, 2], [-1, -2], [-1, -1],
        [-1, 1], [-1, 2], [0, -2], [0, 2], [1, -2], [1, -1], [1, 1],
        [1, 2], [2, -2], [2, -1], [2, 0], [2, 1], [2, 2]
        ]
q1 = deque([[ch, cw]])
q2 = deque([])

while q1:
    x1, y1 = q1.popleft()
    q2.append([x1, y1])
    for i, j in move1:
        nx, ny = x1 + i, y1 + j
        if nx < 0 or h <= nx or ny < 0 or w <= ny:
            continue
        if ans[nx][ny] == -1:
            ans[nx][ny] = ans[x1][y1]
            q1.append([nx, ny])
    if len(q1) == 0:
        while q2:
            x2, y2 = q2.popleft()
            for i, j in move2:
                mx, my = x2 + i, y2 + j
                if mx < 0 or h <= mx or my < 0 or w <= my:
                    continue
                if ans[mx][my] == -1:
                    ans[mx][my] = ans[x2][y2] + 1
                    q1.append([mx, my])
print(ans[dh][dw])






from collections import deque


def main():
    h, w = map(int, input().split())
    ch, cw = map(int, input().split())
    dh, dw = map(int, input().split())

    

    base = ["#" * (w + 4)]
    base.append("#" * (w + 4))
    for n in range(h):
        base.append("##" + input() + "##")
    base.append("#" * (w + 4))
    base.append("#" * (w + 4))
    ans = [[-1] * (w + 4) for _ in range(h + 4)]
    for i in range(h + 4):
        for j in range(w + 4):
            if base[i][j] == "#":
                ans[i][j] = -2
    ch += 1
    cw += 1
    dh += 1
    dw += 1
    
    ans[ch][cw] = 0
    move1 = [[1, 0], [-1, 0], [0, 1], [0, -1]]
    move2 = [
        [-2, -2], [-2, -1], [-2, 0], [-2, 1], [-2, 2], [-1, -2], [-1, -1],
        [-1, 1], [-1, 2], [0, -2], [0, 2], [1, -2], [1, -1], [1, 1],
        [1, 2], [2, -2], [2, -1], [2, 0], [2, 1], [2, 2]
    ]
    q1 = deque([[ch, cw]])
    q2 = deque([])

    while q1:
        x1, y1 = q1.popleft()
        q2.append([x1, y1])
        for i, j in move1:
            nx, ny = x1 + i, y1 + j
            """
            if nx < 0 or h <= nx or ny < 0 or w <= ny:
                continue
            """
            if ans[nx][ny] == -1:
                ans[nx][ny] = ans[x1][y1]
                q1.append([nx, ny])
        if len(q1) == 0:
            while q2:
                x2, y2 = q2.popleft()
                for i, j in move2:
                    mx, my = x2 + i, y2 + j
                    """
                    if mx < 0 or h <= mx or my < 0 or w <= my:
                        continue
                    """
                    if ans[mx][my] == -1:
                        ans[mx][my] = ans[x2][y2] + 1
                        q1.append([mx, my])
    print(ans[dh][dw])


if __name__ == "__main__":
    main()




Verdicts: Wrong Answer

Accepted