Problem:


Score : 400 points

Problem Statement

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)?

Constraints

1 \leq H,W \leq 10^3

1 \leq C_h,D_h \leq H

1 \leq C_w,D_w \leq W

S_{ij} is # or ..

S_{C_h C_w} and S_{D_h D_w} are ..

(C_h,C_w) \neq (D_h,D_w)

Input

Input is given from Standard Input in the following format:

H W
C_h C_w
D_h D_w
S_{11}\ldots S_{1W}
\vdots
S_{H1}\ldots S_{HW}

Output

Print the minimum number of times the magician needs to use the magic. If he cannot reach (D_h,D_w), print -1 instead.

Sample Input 1

4 4
1 1
4 4
..#.
..#.
.#..
.#..

Sample Output 1

1

For example, by walking to (2,2) and then using the magic to travel to (4,4), just one use of magic is enough.

Note that he cannot walk diagonally.

Sample Input 2

4 4
1 4
4 1
.##.
####
####
.##.

Sample Output 2

-1

He cannot move from there.

Sample Input 3

4 4
2 2
3 3
....
....
....
....

Sample Output 3

0

No use of magic is needed.

Sample Input 4

4 5
1 2
2 5
#.###
####.
#..##
#..##

Sample Output 4

2



Sample input:
4 4
1 1
4 4
..#.
..#.
.#..
.#..


Sample output:
1

Submission status: Time Limit Exceeded

Solution code:
import sys
from collections import deque

def input(): return sys.stdin.readline().strip()

icase=0
if icase==0:
    h,w=map(int,input().split())
    ch,cw=map(int,input().split())
    ch-=1
    cw-=1
    dh,dw=map(int,input().split())
    dh-=1
    dw-=1
    s=[[] for i in range(h)]
    for i in range(h):
        s[i]=input()
        
ij=[(1,0),(-1,0),(0,1),(0,-1)]
wpij=[(1,1),(-1,-1),(-1,1),(1,-1),
      (2,-2),(2,-1),(2,0),(2,1),(2,2),
      (-2,-2),(-2,-1),(-2,0),(-2,1),(-2,2),
      (1,2),(0,2),(-1,2),(1,-2),(0,-2),(-1,-2)]

g=[[[] for i in range(w)] for i in range(h)]
gg=[[[] for i in range(w)] for i in range(h)]
wpg2=[[0]*w for i in range(h)]
wpg=[]
for i in range(h):
    for j in range(w):
        for ii,jj in ij:
            if 0>i+ii or i+ii>=h or 0>j+jj or j+jj>=w:
                continue
            if s[i+ii][j+jj]==".":
                g[i][j].append((i+ii,j+jj))        
            else:
#                wpg.append((i,j))
                wpg2[i][j]=1

for i in range(h):
    for j in range(w):
        if wpg2[i][j]==1:
            wpg.append((i,j))
                
#wpg=tuple(set(wpg))

for i,j in wpg:
    for ii,jj in wpij:
         if 0<=i+ii and i+ii<h and 0<=j+jj \
            and j+jj<w and s[i+ii][j+jj]==".":
                gg[i][j].append((i+ii,j+jj))        

q=deque([(ch,cw)])
qq=deque()
parent=[[-1]*w for i in range(h)]
parent[ch][cw]=0
dist=[[-1]*w for i in range(h)]
dist[ch][cw]=0
while True:
    while q:
#        print("q1:",q)
        hi,wi = q.popleft()
        if len(gg[hi][wi])>0:
            qq.append((hi,wi))
        for hj,wj in g[hi][wi]:
            if parent[hj][wj] !=-1:
                continue
            else:
                parent[hj][wj]=(hi,wi)
                dist[hj][wj]=dist[hi][wi]+1
                q.append((hj,wj))
                if hj==dh and wj==dw:
                    print(dist[dh][dw]//(10**7))   
                    sys.exit()

    while qq:
        hi,wi = qq.popleft()
        for hj,wj in gg[hi][wi]:
            if parent[hj][wj]!=-1:
                continue
            parent[hj][wj]=(hi,wi)
            dist[hj][wj]=dist[hi][wi]+10**7
            q.append((hj,wj))
            if hj==dh and wj==dw:
                print(dist[dh][dw]//(10**7))   
                sys.exit()

    if len(q)==0:
        break
print(-1)

Submission status: Time Limit Exceeded

Solution code:
def num():
    from collections import deque
    h, w = map(int, input().split())
    c0, c1 = map(int, input().split())
    d0, d1 = map(int, input().split())
    s = [["#"]*(w+4)]*2+[["#"]*2+list(input())+["#"]*2 for _ in range(h)]+[["#"]*(w+4)]*2
    q = deque([[c0+1, c1+1, 0]])
    q1 = deque()
    ans = -1
    move = [(1, 0), (0, 1), (-1, 0), (0, -1)]
    warp = [(i, j) for i in range(-2, 3) for j in range(-2, 3) if (i, j) not in [(0, 0)]+move]
    
    while q:
        a0, a1, a2 = q.pop()
        q1.append((a0, a1, a2))
        s[a0][a1] = '#'
        if a0 == d0+1 and a1 == d1+1:
            ans = a2
            break

        for i, j in move:
            x, y = a0+i, a1+j
            if s[x][y] == '.':
                q.append((x, y, a2))
        if len(q) == 0:
            while q1:
                a0, a1, a2 = q1.pop()
                for i, j in warp:
                    x, y = a0+i, a1+j
                    if s[x][y] == '.':
                        q.append((x, y, a2+1))    
    print(ans)

if __name__ == "__main__":
    num()

Submission status: Time Limit Exceeded

Solution code:

import sys
from collections import deque

#def input(): return sys.stdin.readline().strip()

icase=0
if icase==0:
    h,w=map(int,input().split())
    ch,cw=map(int,input().split())
    ch-=1
    cw-=1
    dh,dw=map(int,input().split())
    dh-=1
    dw-=1
    s=[[] for i in range(h)]
    for i in range(h):
        s[i]=input()
        
ij=[(1,0),(-1,0),(0,1),(0,-1)]
wpij=[(1,1),(-1,-1),(-1,1),(1,-1),
      (2,-2),(2,-1),(2,0),(2,1),(2,2),
      (-2,-2),(-2,-1),(-2,0),(-2,1),(-2,2),
      (1,2),(0,2),(-1,2),(1,-2),(0,-2),(-1,-2)]

g=[[[] for i in range(w)] for i in range(h)]
gg=[[[] for i in range(w)] for i in range(h)]
wpg2=[[0]*w for i in range(h)]
wpg=[]
for i in range(h):
    for j in range(w):
        for ii,jj in ij:
            if 0>i+ii or i+ii>=h:
                continue
            if 0>j+jj or j+jj>=w:
                continue
            if s[i+ii][j+jj]==".":
                g[i][j].append((i+ii,j+jj))        
            else:
#                wpg.append((i,j))
                wpg2[i][j]=1
                
for i in range(h):
    for j in range(w):
        if wpg2[i][j]==1:
            wpg.append((i,j))
                
#wpg=tuple(set(wpg))

for i,j in wpg:
    for ii,jj in wpij:
         if 0<=i+ii and i+ii<h and 0<=j+jj \
            and j+jj<w and s[i+ii][j+jj]==".":
                gg[i][j].append((i+ii,j+jj))        

q=deque([(ch,cw)])
qq=deque()
parent=[[-1]*w for i in range(h)]
parent[ch][cw]=0
dist=[[-1]*w for i in range(h)]
dist[ch][cw]=0
while True:
    while q:
#        print("q1:",q)
        hi,wi = q.popleft()
        if len(gg[hi][wi])>0:
            qq.append((hi,wi))
        for hj,wj in g[hi][wi]:
            if parent[hj][wj] !=-1:
                continue
            else:
                parent[hj][wj]=(hi,wi)
                dist[hj][wj]=dist[hi][wi]+1
                q.append((hj,wj))
                if hj==dh and wj==dw:
                    print(dist[dh][dw]//(10**7))   
                    sys.exit()

    while qq:
        hi,wi = qq.popleft()
        for hj,wj in gg[hi][wi]:
            if parent[hj][wj]!=-1:
                continue
            parent[hj][wj]=(hi,wi)
            dist[hj][wj]=dist[hi][wi]+10**7
            q.append((hj,wj))
            if hj==dh and wj==dw:
                print(dist[dh][dw]//(10**7))   
                sys.exit()

    if len(q)==0:
        break
print(-1)

Submission status: Time Limit Exceeded

Solution code:
def num():
    h, w = map(int, input().split())
    c0, c1 = map(int, input().split())
    d0, d1 = map(int, input().split())
    s = [["#"]*(w+4)]*2+[["#"]*2+list(input())+["#"]*2 for _ in range(h)]+[["#"]*(w+4)]*2
    q = [(c0+1, c1+1, 0)]
    q1 = []
    ans = -1
    move = [(1, 0), (0, 1), (-1, 0), (0, -1)]
    warp = [(i, j) for i in range(-2, 3) for j in range(-2, 3) if (i, j) not in [(0, 0)]+move]
    
    while q:
        a0, a1, a2 = q.pop()
        q1.append([a0, a1, a2])
        s[a0][a1] = '#'
        if a0 == d0+1 and a1 == d1+1:
            ans = a2
            break

        for i, j in move:
            x, y = a0+i, a1+j
            if s[x][y] == '.':
                q.append((x, y, a2))
        if len(q) == 0:
            while q1:
                a0, a1, a2 = q1.pop()
                for i, j in warp:
                    x, y = a0+i, a1+j
                    if s[x][y] == '.':
                        q.append((x, y, a2+1))    
    print(ans)

if __name__ == "__main__":
    num()

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

def num():
    h, w = map(int, input().split())
    c0, c1 = map(int, input().split())
    d0, d1 = map(int, input().split())
    s = [["#"]*(w+4)]
    s += [["#"]*(w+4)]
    s += [["#"]*2+list(input())+["#"]*2 for _ in range(h)]
    s += [["#"]*(w+4)]
    s += [["#"]*(w+4)]
    s = np.array(s)
    q = [(c0+1, c1+1, 0)]
    q1 = []
    ans = -1
    
    while q:
        a0, a1, a2 = q.pop()
        q1.append([a0, a1, a2])
        s[a0][a1] = '#'
        if a0 == d0+1 and a1 == d1+1:
            ans = a2
            break

        for i, j in ((1, 0), (-1, 0), (0, 1), (0, -1)):
            x, y = a0+i, a1+j
            if s[x][y] == '.':
                q.append((x, y, a2))
        if len(q) == 0:
            while q1:
                a0, a1, a2 = q1.pop()
                for i in range(-2, 3):
                    for j in range(-2, 3):
                        x, y = a0+i, a1+j
                        if s[x][y] == '.':
                            q.append((x, y, a2+1))    
    print(ans)

if __name__ == "__main__":
    num()

Submission status: Time Limit Exceeded

Solution code:
def num():
    h, w = map(int, input().split())
    c0, c1 = map(int, input().split())
    d0, d1 = map(int, input().split())
    s = [["#"]*(w+4)]
    s += [["#"]*(w+4)]
    s += [["#"]*2+list(input())+["#"]*2 for _ in range(h)]
    s += [["#"]*(w+4)]
    s += [["#"]*(w+4)]
    q = [(c0+1, c1+1, 0)]
    q1 = []
    ans = -1
    
    while q:
        a0, a1, a2 = q.pop()
        q1.append([a0, a1, a2])
        s[a0][a1] = '#'
        if a0 == d0+1 and a1 == d1+1:
            ans = a2
            break

        for i, j in ((1, 0), (-1, 0), (0, 1), (0, -1)):
            x, y = a0+i, a1+j
            if s[x][y] == '.':
                q.append((x, y, a2))
        if len(q) == 0:
            while q1:
                a0, a1, a2 = q1.pop()
                for i in range(-2, 3):
                    for j in range(-2, 3):
                        x, y = a0+i, a1+j
                        if s[x][y] == '.':
                            q.append((x, y, a2+1))    
    print(ans)

if __name__ == "__main__":
    num()

Submission status: Time Limit Exceeded

Solution code:
def num():
    h, w = map(int, input().split())
    ch = list(map(int, input().split()))
    dh = list(map(int, input().split()))
    s = [list(input()) for _ in range(h)]

    q = [[ch[0]-1, ch[1]-1, 0]]
    q1 = []
    ans = float('inf')
    
    while q:
        a0, a1, a2 = q.pop()
        q1.append([a0, a1, a2])
        s[a0][a1] = '#'
        if a0 == dh[0]-1 and a1 == dh[1]-1:
            ans = a2
            break

        for i, j in ((1, 0), (-1, 0), (0, 1), (0, -1)):
            x, y = a0+i, a1+j
            if 0 <= x < h and 0 <= y < w:
                if s[x][y] == '.' and ans > a2:
                    q.append([x, y, a2])
        if len(q) == 0:
            while q1:
                a0, a1, a2 = q1.pop()
                for i in range(-2, 3):
                    for j in range(-2, 3):
                        x, y = a0+i, a1+j
                        if 0 <= x < h and 0 <= y < w:
                            if s[x][y] == '.' and ans > a2+1:
                                q.append([x, y, a2+1])
    
    if ans == float('inf'):
        ans = -1
    print(ans)

if __name__ == "__main__":
    num()

Submission status: Time Limit Exceeded

Solution code:
from collections import deque

h, w = map(int, input().split())
c = list(map(int, input().split()))
d = list(map(int, input().split()))
s = [list(input()) for _ in range(h)]

c = [i-1 for i in c]
d = [i-1 for i in d]

t0 = [(0, 1), (0, -1), (1, 0), (-1, 0)]
t1 = []
for i in range(-2, 3):
    for j in range(-2, 3):
        t1.append((i, j))
for i in t0:
    t1.remove(i)
t1.remove((0, 0))

check = [[-1]*w for _ in range(h)]
q = deque()
q.appendleft((c[0], c[1], 0))

while q:
    y, x, b = q.pop()
    if x == d[1] and y == d[0]:
        print(b)
        exit()
    if check[y][x] == -1:
        check[y][x] = b
        for dy, dx in t0:
            ydy, xdx = y+dy, x+dx
            if (0 <= xdx < w) and (0 <= ydy < h):
                if s[ydy][xdx] == '.' and check[ydy][xdx] == -1:
                    q.append((ydy, xdx, b))
        for dy, dx in t1:
            ydy, xdx = y+dy, x+dx
            if (0 <= xdx < w) and (0 <= ydy < h):
                if s[ydy][xdx] == '.' and check[ydy][xdx] == -1:
                    q.appendleft((ydy, xdx, b+1))
print(-1)

Submission status: Time Limit Exceeded

Solution code:

import sys
from collections import deque

def input(): return sys.stdin.readline().strip()

icase=0
if icase==0:
    h,w=map(int,input().split())
    ch,cw=map(int,input().split())
    ch-=1
    cw-=1
    dh,dw=map(int,input().split())
    dh-=1
    dw-=1
    s=[[] for i in range(h)]
    for i in range(h):
        s[i]=input()
        
ij=[(1,0),(-1,0),(0,1),(0,-1)]
wpij=[(1,1),(-1,-1),(-1,1),(1,-1),
      (2,-2),(2,-1),(2,0),(2,1),(2,2),
      (-2,-2),(-2,-1),(-2,0),(-2,1),(-2,2),
      (1,2),(0,2),(-1,2),(1,-2),(0,-2),(-1,-2)]

g=[[[] for i in range(w)] for i in range(h)]
gg=[[[] for i in range(w)] for i in range(h)]
wpg=[]
for i in range(h):
    for j in range(w):
        for ii,jj in ij:
            if 0>i+ii or i+ii>=h:
                continue
            if 0>j+jj or j+jj>=w:
                continue
            if s[i+ii][j+jj]==".":
                g[i][j].append((i+ii,j+jj))        
            else:
                wpg.append((i,j))        

wpg=tuple(set(wpg))

for i,j in wpg:
    for ii,jj in wpij:
         if 0<=i+ii and i+ii<h and 0<=j+jj \
            and j+jj<w and s[i+ii][j+jj]==".":
                gg[i][j].append((i+ii,j+jj))        

q=deque([(ch,cw)])
qq=deque()
parent=[[-1]*w for i in range(h)]
parent[ch][cw]=0
dist=[[-1]*w for i in range(h)]
dist[ch][cw]=0
while True:
    while q:
#        print("q1:",q)
        hi,wi = q.popleft()
        if len(gg[hi][wi])>0:
            qq.append((hi,wi))
        for hj,wj in g[hi][wi]:
            if parent[hj][wj] !=-1:
                continue
            else:
                parent[hj][wj]=(hi,wi)
                dist[hj][wj]=dist[hi][wi]+1
                q.append((hj,wj))
                if hj==dh and wj==dw:
                    print(dist[dh][dw]//(10**7))   
                    sys.exit()

    while qq:
        hi,wi = qq.popleft()
        for hj,wj in gg[hi][wi]:
            if parent[hj][wj]!=-1:
                continue
            parent[hj][wj]=(hi,wi)
            dist[hj][wj]=dist[hi][wi]+10**7
            q.append((hj,wj))
            if hj==dh and wj==dw:
                print(dist[dh][dw]//(10**7))   
                sys.exit()

    if len(q)==0:
        break
print(-1)

Submission status: Time Limit Exceeded

Solution code:
def num():
    from collections import deque
    from sys import stdin
    h, w = map(int, input().split())
    c0, c1 = map(int, input().split())
    d0, d1 = map(int, input().split())
    s = [list(stdin.readline()[:-1]) for _ in range(h)]
    q = deque()
    q1 = deque()
    q.append([c0-1, c1-1, 0])
    
    ans = float('inf')
    
    while q:
        a0, a1, a2 = q.popleft()
        q1.append([a0, a1, a2])
        s[a0][a1] = '#'
        if a0 == d0-1 and a1 == d1-1:
            ans = a2
            break

        for i, j in ((1, 0), (-1, 0), (0, 1), (0, -1)):
            x, y = a0+i, a1+j
            if not(0 <= x < h):
                continue
            elif not(0 <= y < w):
                continue
            elif not(ans > a2):
                continue
            elif s[x][y] == '.':
                q.appendleft([x, y, a2])
        if len(q) == 0:
            while q1:
                a0, a1, a2 = q1.popleft()
                for i in range(-2, 3):
                    for j in range(-2, 3):
                        x, y = a0+i, a1+j
                        if not(0 <= x < h):
                            continue
                        elif not(0 <= y < w):
                            continue
                        elif not(ans > a2+1):
                            continue
                        elif s[x][y] == '.':
                            q.append([x, y, a2+1])
    
    if ans == float('inf'):
        ans = -1
    print(ans)

if __name__ == "__main__":
    num()

Submission status: Time Limit Exceeded

Solution code:
def num():
    from collections import deque
    from sys import stdin
    h, w = map(int, input().split())
    c0, c1 = map(int, input().split())
    d0, d1 = map(int, input().split())
    s = [list(stdin.readline()[:-1]) for _ in range(h)]
    q = deque()
    q1 = deque()
    q.append([c0-1, c1-1, 0])
    
    ans = float('inf')
    
    while q:
        a0, a1, a2 = q.popleft()
        q1.append([a0, a1, a2])
        s[a0][a1] = '#'
        if a0 == d0-1 and a1 == d1-1:
            ans = a2
            break

        for i, j in ((1, 0), (-1, 0), (0, 1), (0, -1)):
            x, y = a0+i, a1+j
            if 0 <= x < h and 0 <= y < w:
                if s[x][y] == '.' and ans > a2:
                    q.appendleft([x, y, a2])
        if len(q) == 0:
            while q1:
                a0, a1, a2 = q1.popleft()
                for i in range(-2, 3):
                    for j in range(-2, 3):
                        x, y = a0+i, a1+j
                        if 0 <= x < h and 0 <= y < w:
                            if s[x][y] == '.' and ans > a2+1:
                                q.append([x, y, a2+1])
    
    if ans == float('inf'):
        ans = -1
    print(ans)

if __name__ == "__main__":
    num()

Submission status: Time Limit Exceeded

Solution code:

import sys
from collections import deque

def input(): return sys.stdin.readline().strip()

icase=0
if icase==0:
    h,w=map(int,input().split())
    ch,cw=map(int,input().split())
    ch-=1
    cw-=1
    dh,dw=map(int,input().split())
    dh-=1
    dw-=1
    s=[[] for i in range(h)]
    for i in range(h):
        s[i]=input()
        
ij=[(1,0),(-1,0),(0,1),(0,-1)]
wpij=[(1,1),(-1,-1),(-1,1),(1,-1),
      (2,-2),(2,-1),(2,0),(2,1),(2,2),
      (-2,-2),(-2,-1),(-2,0),(-2,1),(-2,2),
      (1,2),(0,2),(-1,2),(1,-2),(0,-2),(-1,-2)]

g=[[[] for i in range(w)] for i in range(h)]
gg=[[[] for i in range(w)] for i in range(h)]
wpg=[]
for i in range(h):
    for j in range(w):
        for ii,jj in ij:
            if 0<=i+ii and i+ii<h and 0<=j+jj and j+jj<w :
                if s[i+ii][j+jj]==".":
                    g[i][j].append((i+ii,j+jj))        
                else:
                    wpg.append((i,j))        

wpg=tuple(set(wpg))

for i,j in wpg:
    for ii,jj in wpij:
         if 0<=i+ii and i+ii<h and 0<=j+jj \
            and j+jj<w and s[i+ii][j+jj]==".":
                gg[i][j].append((i+ii,j+jj))        

q=deque([(ch,cw)])
qq=deque()
parent=[[-1]*w for i in range(h)]
parent[ch][cw]=0
dist=[[-1]*w for i in range(h)]
dist[ch][cw]=0
while True:
    while q:
#        print("q1:",q)
        hi,wi = q.popleft()
        if len(gg[hi][wi])>0:
            qq.append((hi,wi))
        for hj,wj in g[hi][wi]:
            if parent[hj][wj] !=-1:
                continue
            else:
                parent[hj][wj]=(hi,wi)
                dist[hj][wj]=dist[hi][wi]+1
                q.append((hj,wj))
                if hj==dh and wj==dw:
                    print(dist[dh][dw]//(10**7))   
                    sys.exit()

    while qq:
        hi,wi = qq.popleft()
        for hj,wj in gg[hi][wi]:
            if parent[hj][wj]!=-1:
                continue
            parent[hj][wj]=(hi,wi)
            dist[hj][wj]=dist[hi][wi]+10**7
            q.append((hj,wj))
            if hj==dh and wj==dw:
                print(dist[dh][dw]//(10**7))   
                sys.exit()

    if len(q)==0:
        break
print(-1)

Submission status: Time Limit Exceeded

Solution code:
from numba import jit
from collections import deque
import numpy as np

@jit(cache=True)
def num():
    h, w = map(int, input().split())
    ch = np.array(list(map(int, input().split())))
    dh = np.array(list(map(int, input().split())))
    s = np.array([list(input()) for _ in range(h)])

    q = deque()
    q1 = deque()
    q.append([ch[0]-1, ch[1]-1, 0])
    
    ans = float('inf')
    
    while q:
        a0, a1, a2 = q.popleft()
        q1.append([a0, a1, a2])
        s[a0][a1] = '#'
        if a0 == dh[0]-1 and a1 == dh[1]-1:
            ans = a2
            break

        for i, j in ((1, 0), (-1, 0), (0, 1), (0, -1)):
            x, y = a0+i, a1+j
            if 0 <= x < h and 0 <= y < w:
                if s[x][y] == '.' and ans > a2:
                    q.appendleft([x, y, a2])
        if len(q) == 0:
            while q1:
                a0, a1, a2 = q1.popleft()
                for i in range(-2, 3):
                    for j in range(-2, 3):
                        x, y = a0+i, a1+j
                        if 0 <= x < h and 0 <= y < w:
                            if s[x][y] == '.' and ans > a2+1:
                                q.append([x, y, a2+1])
    
    if ans == float('inf'):
        ans = -1
    print(ans)

if __name__ == "__main__":
    num()

Submission status: Time Limit Exceeded

Solution code:
import sys
from collections import deque

def input(): return sys.stdin.readline().strip()

icase=0
if icase==0:
    h,w=map(int,input().split())
    ch,cw=map(int,input().split())
    ch-=1
    cw-=1
    dh,dw=map(int,input().split())
    dh-=1
    dw-=1
    s=[[] for i in range(h)]
    for i in range(h):
        s[i]=input()
        
ij=[(1,0),(-1,0),(0,1),(0,-1)]
wpij=[(1,1),(-1,-1),(-1,1),(1,-1),
      (2,-2),(2,-1),(2,0),(2,1),(2,2),
      (-2,-2),(-2,-1),(-2,0),(-2,1),(-2,2),
      (1,2),(0,2),(-1,2),(1,-2),(0,-2),(-1,-2)]

g=[[[] for i in range(w)] for i in range(h)]
gg=[[[] for i in range(w)] for i in range(h)]
wpg=[]
for i in range(h):
    for j in range(w):
        for ii,jj in ij:
            if 0<=i+ii and i+ii<h and 0<=j+jj and \
                j+jj<w and s[i+ii][j+jj]==".":
                g[i][j].append((i+ii,j+jj))        
            if 0<=i+ii and i+ii<h and 0<=j+jj and \
                j+jj<w and s[i+ii][j+jj]=="#":
#                if not ((i,j) in wpg):
#                    wpg.append((i,j))        
                wpg.append((i,j))        

wpg=tuple(set(wpg))

for i,j in wpg:
    for ii,jj in wpij:
         if 0<=i+ii and i+ii<h and 0<=j+jj \
            and j+jj<w and s[i+ii][j+jj]==".":
                gg[i][j].append((i+ii,j+jj))        

q=deque([(ch,cw)])
qq=deque()
parent=[[-1]*w for i in range(h)]
parent[ch][cw]=0
dist=[[-1]*w for i in range(h)]
dist[ch][cw]=0
while True:
    while q:
#        print("q1:",q)
        hi,wi = q.popleft()
        if len(gg[hi][wi])>0:
            qq.append((hi,wi))
        for hj,wj in g[hi][wi]:
            if parent[hj][wj] !=-1:
                continue
            else:
                parent[hj][wj]=(hi,wi)
                dist[hj][wj]=dist[hi][wi]+1
                q.append((hj,wj))
                if hj==dh and wj==dw:
                    print(dist[dh][dw]//(10**7))   
                    sys.exit()

    while qq:
        hi,wi = qq.popleft()
        for hj,wj in gg[hi][wi]:
            if parent[hj][wj]!=-1:
                continue
            parent[hj][wj]=(hi,wi)
            dist[hj][wj]=dist[hi][wi]+10**7
            q.append((hj,wj))
            if hj==dh and wj==dw:
                print(dist[dh][dw]//(10**7))   
                sys.exit()

    if len(q)==0:
        break
print(-1)

Submission status: Time Limit Exceeded

Solution code:

import sys
from collections import deque

def input(): return sys.stdin.readline().strip()

icase=0
if icase==0:
    h,w=map(int,input().split())
    ch,cw=map(int,input().split())
    ch-=1
    cw-=1
    dh,dw=map(int,input().split())
    dh-=1
    dw-=1
    s=[[] for i in range(h)]
    for i in range(h):
        s[i]=input()
        
ij=[(1,0),(-1,0),(0,1),(0,-1)]
wpij=[(1,1),(-1,-1),(-1,1),(1,-1),
      (2,-2),(2,-1),(2,0),(2,1),(2,2),
      (-2,-2),(-2,-1),(-2,0),(-2,1),(-2,2),
      (1,2),(0,2),(-1,2),(1,-2),(0,-2),(-1,-2)]

g=[[[] for i in range(w)] for i in range(h)]
gg=[[[] for i in range(w)] for i in range(h)]
wpg=[]
for i in range(h):
    for j in range(w):
        for ii,jj in ij:
            if 0<=i+ii and i+ii<h and 0<=j+jj and \
                j+jj<w and s[i+ii][j+jj]==".":
                g[i][j].append((i+ii,j+jj))        
            if 0<=i+ii and i+ii<h and 0<=j+jj and \
                j+jj<w and s[i+ii][j+jj]=="#":
#                if not ((i,j) in wpg):
#                    wpg.append((i,j))        
                wpg.append((i,j))        

for i,j in wpg:
    for ii,jj in wpij:
         if 0<=i+ii and i+ii<h and 0<=j+jj \
            and j+jj<w and s[i+ii][j+jj]==".":
                gg[i][j].append((i+ii,j+jj))        

q=deque([(ch,cw)])
qq=deque()
parent=[[-1]*w for i in range(h)]
parent[ch][cw]=0
dist=[[-1]*w for i in range(h)]
dist[ch][cw]=0
while True:
    while q:
#        print("q1:",q)
        hi,wi = q.popleft()
        if len(gg[hi][wi])>0:
            qq.append((hi,wi))
        for hj,wj in g[hi][wi]:
            if parent[hj][wj] !=-1:
                continue
            else:
                parent[hj][wj]=(hi,wi)
                dist[hj][wj]=dist[hi][wi]+1
                q.append((hj,wj))
                if hj==dh and wj==dw:
                    print(dist[dh][dw]//(10**7))   
                    sys.exit()

    while qq:
        hi,wi = qq.popleft()
        for hj,wj in gg[hi][wi]:
            if parent[hj][wj]!=-1:
                continue
            parent[hj][wj]=(hi,wi)
            dist[hj][wj]=dist[hi][wi]+10**7
            q.append((hj,wj))
            if hj==dh and wj==dw:
                print(dist[dh][dw]//(10**7))   
                sys.exit()

    if len(q)==0:
        break
print(-1)

Submission status: Time Limit Exceeded

Solution code:
from numba import jit
from collections import deque

@jit(cache=True)
def num():
    h, w = map(int, input().split())
    ch = list(map(int, input().split()))
    dh = list(map(int, input().split()))
    s = [list(input()) for _ in range(h)]

    q = deque()
    q1 = deque()
    q.append([ch[0]-1, ch[1]-1, 0])
    
    ans = float('inf')
    
    while q:
        a0, a1, a2 = q.popleft()
        q1.append([a0, a1, a2])
        s[a0][a1] = '#'
        if a0 == dh[0]-1 and a1 == dh[1]-1:
            ans = a2
            break

        for i, j in ((1, 0), (-1, 0), (0, 1), (0, -1)):
            x, y = a0+i, a1+j
            if 0 <= x < h and 0 <= y < w:
                if s[x][y] == '.' and ans > a2:
                    q.appendleft([x, y, a2])
        if len(q) == 0:
            while q1:
                a0, a1, a2 = q1.popleft()
                for i in range(-2, 3):
                    for j in range(-2, 3):
                        x, y = a0+i, a1+j
                        if 0 <= x < h and 0 <= y < w:
                            if s[x][y] == '.' and ans > a2+1:
                                q.append([x, y, a2+1])
    
    if ans == float('inf'):
        ans = -1
    print(ans)

if __name__ == "__main__":
    num()

Submission status: Time Limit Exceeded

Solution code:
H, W = map(int, input().split())
sh, sw = map(lambda x:int(x)-1, input().split())
eh, ew = map(lambda x:int(x)-1, input().split())
S = [input() for _ in range(H)]

INF = 10**9
dst = [[INF]*W for _ in range(H)]
dst[sh][sw] = 0

from collections import deque
dq = deque([(sh, sw)])
while dq:
    h, w = dq.popleft()

    for dh in range(-2, 3):
        for dw in range(-2, 3): # [dh,dw]:[-2,-2]~[2,2]
            nh = h + dh; nw = w + dw
            if 0 <= nh < H and 0 <= nw < W and S[nh][nw] == '.' and dst[h][w] < dst[nh][nw]:
                if dh*dh + dw*dw == 1:
                    dst[nh][nw] = dst[h][w]
                    dq.appendleft((nh, nw))
                elif dh*dh + dw*dw > 1:
                    dst[nh][nw] = dst[h][w] + 1
                    dq.append((nh, nw))

print(-1 if dst[eh][ew]==INF else dst[eh][ew])

Submission status: Time Limit Exceeded

Solution code:
from collections import deque

def num():
    h, w = map(int, input().split())
    ch = list(map(int, input().split()))
    dh = list(map(int, input().split()))
    s = [list(input()) for _ in range(h)]

    q = deque()
    q1 = deque()
    q.append([ch[0]-1, ch[1]-1, 0])
    
    ans = float('inf')
    
    while q:
        a0, a1, a2 = q.popleft()
        q1.append([a0, a1, a2])
        s[a0][a1] = '#'
        if a0 == dh[0]-1 and a1 == dh[1]-1:
            ans = a2
            break

        for i, j in ((1, 0), (-1, 0), (0, 1), (0, -1)):
            x, y = a0+i, a1+j
            if 0 <= x < h and 0 <= y < w:
                if s[x][y] == '.' and ans > a2:
                    q.appendleft([x, y, a2])
        if len(q) == 0:
            while q1:
                a0, a1, a2 = q1.popleft()
                for i in range(-2, 3):
                    for j in range(-2, 3):
                        x, y = a0+i, a1+j
                        if 0 <= x < h and 0 <= y < w:
                            if s[x][y] == '.' and ans > a2+1:
                                q.append([x, y, a2+1])
    
    if ans == float('inf'):
        ans = -1
    print(ans)

if __name__ == "__main__":
    num()