Problem:


Score : 600 points

Problem Statement

Snuke, a water strider, lives in a rectangular pond that can be seen as a grid with H east-west rows and W north-south columns. Let (i,j) be the square at the i-th row from the north and j-th column from the west.

Some of the squares have a lotus leaf on it and cannot be entered.
The square (i,j) has a lotus leaf on it if c_{ij} is @, and it does not if c_{ij} is ..

In one stroke, Snuke can move between 1 and K squares (inclusive) toward one of the four directions: north, east, south, and west.
The move may not pass through a square with a lotus leaf. Moving to such a square or out of the pond is also forbidden.

Find the minimum number of strokes Snuke takes to travel from the square (x_1,y_1) to (x_2,y_2).
If the travel from (x_1,y_1) to (x_2,y_2) is impossible, point out that fact.

Constraints

1 \leq H,W,K \leq 10^6

H \times W \leq 10^6

1 \leq x_1,x_2 \leq H

1 \leq y_1,y_2 \leq W

x_1 \neq x_2 or y_1 \neq y_2.

c_{i,j} is . or @.

c_{x_1,y_1} = .

c_{x_2,y_2} = .

All numbers in input are integers.

Input

Input is given from Standard Input in the following format:

H W K
x_1 y_1 x_2 y_2
c_{1,1}c_{1,2} .. c_{1,W}
c_{2,1}c_{2,2} .. c_{2,W}
:
c_{H,1}c_{H,2} .. c_{H,W}

Output

Print the minimum number of strokes Snuke takes to travel from the square (x_1,y_1) to (x_2,y_2), or print -1 if the travel is impossible.

Sample Input 1

3 5 2
3 2 3 4
.....
.@..@
..@..

Sample Output 1

5

Initially, Snuke is at the square (3,2).
He can reach the square (3, 4) by making five strokes as follows:

From (3, 2), go west one square to (3, 1).

From (3, 1), go north two squares to (1, 1).

From (1, 1), go east two squares to (1, 3).

From (1, 3), go east one square to (1, 4).

From (1, 4), go south two squares to (3, 4).

Sample Input 2

1 6 4
1 1 1 6
......

Sample Output 2

2

Sample Input 3

3 3 1
2 1 2 3
.@.
.@.
.@.

Sample Output 3

-1



Sample input:
3 5 2
3 2 3 4
.....
.@..@
..@..


Sample output:
5

Submission status: Time Limit Exceeded

Solution code:
#!python3

from heapq import heappop, heappush

LI = lambda: list(map(int, input().split()))

# input
H, W, K = LI()
x1, y1, x2, y2 = [v - 1 for v in LI()]
C = [input() for _ in range(H)]

INF = 10 ** 10
n = 4 * H * W
w = [(INF, 0)] * n


def to_id(x, y, d):
    return 4 * (W * x + y) + d


def to_xy(i):
    s = i // 4
    y = s % W
    x = (s - y) // W
    return x, y


def forward(i):
    s = i % 4
    if s == 0:
        return i - (4 * W)
    if s == 1:
        if i // 4 % W == W - 1:
            return INF
        return i + 4
    if s == 2:
        return i + (4 * W)
    if s == 3:
        if i // 4 % W == 0:
            return INF
        return i - 4


def main():
    hq = []
    for d in range(4):
        i = to_id(x1, y1, d)
        w[i] = (1, 0)
        heappush(hq, (1, 0, i))
    while hq:
        # cost, k, i
        c, k, i = heappop(hq)
        if w[i] < (c, k):
            continue
        j = forward(i)
        if 0 <= j < n:
            x, y = to_xy(j)
            if C[x][y] == ".":
                if k < K:
                    if w[j] > (c, k + 1):
                        w[j] = (c, k + 1)
                        heappush(hq, (c, k + 1, j))
                else:
                    if w[j] > (c + 1, 1):
                        w[j] = (c + 1, 1)
                        heappush(hq, (c + 1, 1, j))
        s = i % 4
        v = i - s
        for d in range(4):
            if s == d:
                continue
            j = v + d
            if w[j] > (c + 1, 0):
                w[j] = (c + 1, 0)
                t = (c + 1, 0, j)
                heappush(hq, t)

    i = to_id(x2, y2, 0)
    ans = min(w[i : i + 4])[0]
    ans = -1 if ans == INF else ans
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline
from collections import deque

H,W,K=map(int,input().split())
x1,y1,x2,y2=map(int,input().split())
MAP2=[list(input().strip()) for i in range(H)]
MAP=[-1]*(H*W)

for i in range(H):
    for j in range(W):
        if MAP2[i][j]==".":
            MAP[i*W+j]=1<<25

def ch(x,y,tf):
    return (x*W+y)*4+tf

def back(x):
    tf=x%4
    x//=4
    return x//W,x%W,tf

Q=deque()
Q.append(ch(x1-1,y1-1,0))
Q.append(ch(x1-1,y1-1,1))
Q.append(ch(x1-1,y1-1,2))
Q.append(ch(x1-1,y1-1,3))
MAP[(x1-1)*W+y1-1]=0

while Q:
    x,y,tf=back(Q.popleft())

    if tf==0:
        if 0<=x+1<H and MAP[(x+1)*W+y]>MAP[x*W+y]:
            for i in range(1,K):
                if 0<=x+i<H and MAP[(x+i)*W+y]>MAP[x*W+y]:
                    MAP[(x+i)*W+y]=MAP[x*W+y]+1
                    Q.append(ch(x+i,y,2))
                    Q.append(ch(x+i,y,3))
                else:
                    break
            else:
                if 0<=x+K<H and MAP[(x+K)*W+y]>MAP[x*W+y]:
                    MAP[(x+K)*W+y]=MAP[x*W+y]+1
                    Q.append(ch(x+K,y,0))
                    Q.append(ch(x+K,y,2))
                    Q.append(ch(x+K,y,3))

    elif tf==1:            
        if 0<=x-1<H and MAP[(x-1)*W+y]>MAP[x*W+y]:
            for i in range(1,K):
                if 0<=x-i<H and MAP[(x-i)*W+y]>MAP[x*W+y]:
                    MAP[(x-i)*W+y]=MAP[x*W+y]+1
                    Q.append(ch(x-i,y,2))
                    Q.append(ch(x-i,y,3))
                else:
                    break

            else:
                if 0<=x-K<H and MAP[(x-K)*W+y]>MAP[x*W+y]:
                    MAP[(x-K)*W+y]=MAP[x*W+y]+1
                    Q.append(ch(x-K,y,1))
                    Q.append(ch(x-K,y,2))
                    Q.append(ch(x-K,y,3))

    elif tf==2:
        if 0<=y+1<W and MAP[x*W+y+1]>MAP[x*W+y]:
            for i in range(1,K):
                if 0<=y+i<W and MAP[x*W+y+i]>MAP[x*W+y]:
                    MAP[x*W+y+i]=MAP[x*W+y]+1
                    Q.append(ch(x,y+i,0))
                    Q.append(ch(x,y+i,1))
                else:
                    break

            else:
                if 0<=y+K<W and MAP[x*W+y+K]>MAP[x*W+y]:
                    MAP[x*W+y+K]=MAP[x*W+y]+1
                    Q.append(ch(x,y+K,0))
                    Q.append(ch(x,y+K,1))
                    Q.append(ch(x,y+K,2))
    else:
        if 0<=y-1<W and MAP[x*W+y-1]>MAP[x*W+y]:
            for i in range(1,K):
                if 0<=y-i<W and MAP[x*W+y-i]>MAP[x*W+y]:
                    MAP[x*W+y-i]=MAP[x*W+y]+1
                    Q.append(ch(x,y-i,0))
                    Q.append(ch(x,y-i,1))
                else:
                    break

            else:
                if 0<=y-K<W and MAP[x*W+y-K]>MAP[x*W+y]:
                    MAP[x*W+y-K]=MAP[x*W+y]+1
                    Q.append(ch(x,y-K,0))
                    Q.append(ch(x,y-K,1))
                    Q.append(ch(x,y-K,3))
            
if MAP[(x2-1)*W+y2-1]==1<<25:
    print(-1)
else:
    print(MAP[(x2-1)*W+y2-1])

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline
from collections import deque

H,W,K=map(int,input().split())
x1,y1,x2,y2=map(int,input().split())
MAP2=[list(input().strip()) for i in range(H)]
MAP=[-1]*(H*W)

for i in range(H):
    for j in range(W):
        if MAP2[i][j]==".":
            MAP[i*W+j]=1<<25

def ch(x,y,tf):
    return (x*W+y)*2+tf

def back(x):
    tf=x%2
    x//=2
    return x//W,x%W,tf

Q=deque()
Q.append(ch(x1-1,y1-1,0))
Q.append(ch(x1-1,y1-1,1))
MAP[(x1-1)*W+y1-1]=0

while Q:
    x,y,tf=back(Q.popleft())

    if tf==0:
        for i in range(1,K):
            if 0<=x+i<H and MAP[(x+i)*W+y]>MAP[x*W+y]:
                MAP[(x+i)*W+y]=MAP[x*W+y]+1
                Q.append(ch(x+i,y,1))
            else:
                break
        else:
            if 0<=x+K<H and MAP[(x+K)*W+y]>MAP[x*W+y]:
                MAP[(x+K)*W+y]=MAP[x*W+y]+1
                Q.append(ch(x+K,y,0))
                Q.append(ch(x+K,y,1))
            

        for i in range(1,K):
            if 0<=x-i<H and MAP[(x-i)*W+y]>MAP[x*W+y]:
                MAP[(x-i)*W+y]=MAP[x*W+y]+1
                Q.append(ch(x-i,y,1))
            else:
                break

        else:
            if 0<=x-K<H and MAP[(x-K)*W+y]>MAP[x*W+y]:
                MAP[(x-K)*W+y]=MAP[x*W+y]+1
                Q.append(ch(x-K,y,0))
                Q.append(ch(x-K,y,1))

    else:
        for i in range(1,K):
            if 0<=y+i<W and MAP[x*W+y+i]>MAP[x*W+y]:
                MAP[x*W+y+i]=MAP[x*W+y]+1
                Q.append(ch(x,y+i,0))
            else:
                break

        else:
            if 0<=y+K<W and MAP[x*W+y+K]>MAP[x*W+y]:
                MAP[x*W+y+K]=MAP[x*W+y]+1
                Q.append(ch(x,y+K,0))
                Q.append(ch(x,y+K,1))

        for i in range(1,K):
            if 0<=y-i<W and MAP[x*W+y-i]>MAP[x*W+y]:
                MAP[x*W+y-i]=MAP[x*W+y]+1
                Q.append(ch(x,y-i,0))
            else:
                break

        else:
            if 0<=y-K<W and MAP[x*W+y-K]>MAP[x*W+y]:
                MAP[x*W+y-K]=MAP[x*W+y]+1
                Q.append(ch(x,y-K,0))
                Q.append(ch(x,y-K,1))
            
if MAP[(x2-1)*W+y2-1]==1<<25:
    print(-1)
else:
    print(MAP[(x2-1)*W+y2-1])

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline
from collections import deque

H,W,K=map(int,input().split())
x1,y1,x2,y2=map(int,input().split())
MAP=[list(input().strip()) for i in range(H)]

for i in range(H):
    for j in range(W):
        if MAP[i][j]==".":
            MAP[i][j]=1<<25
        else:
            MAP[i][j]=-1

def ch(x,y,tf):
    return (x*W+y)*2+tf

def back(x):
    tf=x%2
    x//=2
    return x//W,x%W,tf

Q=deque()
Q.append(ch(x1-1,y1-1,0))
Q.append(ch(x1-1,y1-1,1))
MAP[x1-1][y1-1]=0

while Q:
    x,y,tf=back(Q.popleft())

    if tf==0:
        for i in range(1,K):
            if 0<=x+i<H and MAP[x+i][y]>MAP[x][y]:
                MAP[x+i][y]=MAP[x][y]+1
                Q.append(ch(x+i,y,1))
            else:
                break
        else:
            if 0<=x+K<H and MAP[x+K][y]>MAP[x][y]:
                MAP[x+K][y]=MAP[x][y]+1
                Q.append(ch(x+K,y,0))
                Q.append(ch(x+K,y,1))
            

        for i in range(1,K):
            if 0<=x-i<H and MAP[x-i][y]>MAP[x][y]:
                MAP[x-i][y]=MAP[x][y]+1
                Q.append(ch(x-i,y,1))
            else:
                break

        else:
            if 0<=x-K<H and MAP[x-K][y]>MAP[x][y]:
                MAP[x-K][y]=MAP[x][y]+1
                Q.append(ch(x-K,y,0))
                Q.append(ch(x-K,y,1))

    else:
        for i in range(1,K):
            if 0<=y+i<W and MAP[x][y+i]>MAP[x][y]:
                MAP[x][y+i]=MAP[x][y]+1
                Q.append(ch(x,y+i,0))
            else:
                break

        else:
            if 0<=y+K<W and MAP[x][y+K]>MAP[x][y]:
                MAP[x][y+K]=MAP[x][y]+1
                Q.append(ch(x,y+K,0))
                Q.append(ch(x,y+K,1))

        for i in range(1,K):
            if 0<=y-i<W and MAP[x][y-i]>MAP[x][y]:
                MAP[x][y-i]=MAP[x][y]+1
                Q.append(ch(x,y-i,0))
            else:
                break

        else:
            if 0<=y-K<W and MAP[x][y-K]>MAP[x][y]:
                MAP[x][y-K]=MAP[x][y]+1
                Q.append(ch(x,y-K,0))
                Q.append(ch(x,y-K,1))
            
if MAP[x2-1][y2-1]==1<<25:
    print(-1)
else:
    print(MAP[x2-1][y2-1])

Submission status: Time Limit Exceeded

Solution code:
from collections import deque

H, W, K = map(int, input().split())
x1, y1, x2, y2 = map(int, input().split())

c_array = [input() for _ in range(H)]

ans_array = [-1] * (H * W * 4)

pos = deque()

start_pos = ((x1 - 1) * W + (y1 - 1)) * 4
goal_pos = ((x2 - 1) * W + (y2 - 1)) * 4

for i in range(4):
    pos.append(start_pos + i)
    ans_array[start_pos + i] = 0

while(len(pos)):
    now_pos = pos.popleft()
    d = now_pos % 4
    h = (now_pos - d) // (4 * W) + 1
    w = ((now_pos - d) // 4) % W + 1
    # print(h, w, d, ans_array[now_pos])
    if d == 0:
        for i in range(1, K + 1):
            if h + i > H or c_array[h + i - 1][w - 1] == '@':
                break
            newpos_array = [((h + i - 1) * W + (w - 1)) * 4 + 1, ((h + i - 1)
                                                                  * W + (w - 1)) * 4 + 3, ((h + i - 1) * W + (w - 1)) * 4 + 0, ((h + i - 1) * W + (w - 1)) * 4 + 2]
            for n, newpos in enumerate(newpos_array):
                if newpos >= goal_pos and newpos < goal_pos + 4:
                    print(ans_array[now_pos] + 1)
                    exit()
                if ans_array[newpos] == -1:
                    ans_array[newpos] = ans_array[now_pos] + 1
                    if n < 2 or (n == 2 and i == K):
                        pos.append(newpos)
    if d == 1:
        for i in range(1, K + 1):
            if w + i > W or c_array[h - 1][w + i - 1] == '@':
                break
            newpos_array = [((h - 1) * W + (w + i - 1)) * 4 + 0, ((h - 1) *
                                                                  W + (w + i - 1)) * 4 + 2, ((h - 1) * W + (w + i - 1)) * 4 + 1,((h - 1) * W + (w + i - 1)) * 4 + 3]
            for n, newpos in enumerate(newpos_array):
                if newpos >= goal_pos and newpos < goal_pos + 4:
                    print(ans_array[now_pos] + 1)
                    exit()
                if n == 2 and i != K:
                    break
                if ans_array[newpos] == -1:
                    ans_array[newpos] = ans_array[now_pos] + 1
                    if n < 2 or (n == 2 and i == K):
                        pos.append(newpos)
    if d == 2:
        for i in range(1, K + 1):
            if h - i < 1 or c_array[h - i - 1][w - 1] == '@':
                break
            newpos_array = [((h - i - 1) * W + (w - 1)) * 4 + 1, ((h - i - 1)
                                                                  * W + (w - 1)) * 4 + 3, ((h - i - 1) * W + (w - 1)) * 4 + 2,((h - i - 1) * W + (w - 1)) * 4 + 0]
            for n, newpos in enumerate(newpos_array):
                if newpos >= goal_pos and newpos < goal_pos + 4:
                    print(ans_array[now_pos] + 1)
                    exit()
                if n == 2 and i != K:
                    break
                if ans_array[newpos] == -1:
                    ans_array[newpos] = ans_array[now_pos] + 1
                    if n < 2 or (n == 2 and i == K):
                        pos.append(newpos)
    if d == 3:
        for i in range(1, K + 1):
            if w - i < 1 or c_array[h - 1][w - i - 1] == '@':
                break
            newpos_array = [((h - 1) * W + (w - i - 1)) * 4 + 0, ((h - 1) *
                                                                  W + (w - i - 1)) * 4 + 2, ((h - 1) * W + (w - i - 1)) * 4 + 3,((h - 1) * W + (w - i - 1)) * 4 + 1]
            for n, newpos in enumerate(newpos_array):
                if newpos >= goal_pos and newpos < goal_pos + 4:
                    print(ans_array[now_pos] + 1)
                    exit()
                if n == 2 and i != K:
                    break
                if ans_array[newpos] == -1:
                    ans_array[newpos] = ans_array[now_pos] + 1
                    if n < 2 or (n == 2 and i == K):
                        pos.append(newpos)
print(-1)

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline
from collections import deque

H,W,K=map(int,input().split())
x1,y1,x2,y2=map(int,input().split())
MAP=[list(input().strip()) for i in range(H)]

for i in range(H):
    for j in range(W):
        if MAP[i][j]==".":
            MAP[i][j]=1<<25
        else:
            MAP[i][j]=-1

Q=deque()
Q.append((x1-1,y1-1,0))
Q.append((x1-1,y1-1,1))
MAP[x1-1][y1-1]=0

while Q:
    x,y,tf=Q.popleft()

    if tf==0:
        for i in range(1,K):
            if 0<=x+i<H and 0<=y<W and MAP[x+i][y]>MAP[x][y]:
                MAP[x+i][y]=MAP[x][y]+1
                Q.append((x+i,y,1))
            else:
                break
        else:
            if 0<=x+K<H and 0<=y<W and MAP[x+K][y]>MAP[x][y]:
                MAP[x+K][y]=MAP[x][y]+1
                Q.append((x+K,y,0))
                Q.append((x+K,y,1))
            

        for i in range(1,K):
            if 0<=x-i<H and 0<=y<W and MAP[x-i][y]>MAP[x][y]:
                MAP[x-i][y]=MAP[x][y]+1
                Q.append((x-i,y,1))
            else:
                break

        else:
            if 0<=x-K<H and 0<=y<W and MAP[x-K][y]>MAP[x][y]:
                MAP[x-K][y]=MAP[x][y]+1
                Q.append((x-K,y,0))
                Q.append((x-K,y,1))

    else:
        for i in range(1,K):
            if 0<=x<H and 0<=y+i<W and MAP[x][y+i]>MAP[x][y]:
                MAP[x][y+i]=MAP[x][y]+1
                Q.append((x,y+i,0))
            else:
                break

        else:
            if 0<=x<H and 0<=y+K<W and MAP[x][y+K]>MAP[x][y]:
                MAP[x][y+K]=MAP[x][y]+1
                Q.append((x,y+K,0))
                Q.append((x,y+K,1))

        for i in range(1,K):
            if 0<=x<H and 0<=y-i<W and MAP[x][y-i]>MAP[x][y]:
                MAP[x][y-i]=MAP[x][y]+1
                Q.append((x,y-i,0))
            else:
                break

        else:
            if 0<=x<H and 0<=y-K<W and MAP[x][y-K]>MAP[x][y]:
                MAP[x][y-K]=MAP[x][y]+1
                Q.append((x,y-K,0))
                Q.append((x,y-K,1))
            
if MAP[x2-1][y2-1]==1<<25:
    print(-1)
else:
    print(MAP[x2-1][y2-1])

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline
from collections import deque

H,W,K=map(int,input().split())
x1,y1,x2,y2=map(int,input().split())
MAP=[list(input().strip()) for i in range(H)]

for i in range(H):
    for j in range(W):
        if MAP[i][j]==".":
            MAP[i][j]=1<<25
        else:
            MAP[i][j]=-1

Q=deque()
Q.append((x1-1,y1-1,0))
Q.append((x1-1,y1-1,1))
MAP[x1-1][y1-1]=0

while Q:
    x,y,tf=Q.pop()

    if tf==0:
        for i in range(1,K):
            if 0<=x+i<H and 0<=y<W and MAP[x+i][y]>MAP[x][y]:
                MAP[x+i][y]=MAP[x][y]+1
                Q.appendleft((x+i,y,1))
            else:
                break
        else:
            if 0<=x+K<H and 0<=y<W and MAP[x+K][y]>MAP[x][y]:
                MAP[x+K][y]=MAP[x][y]+1
                Q.appendleft((x+K,y,0))
                Q.appendleft((x+K,y,1))
            

        for i in range(1,K):
            if 0<=x-i<H and 0<=y<W and MAP[x-i][y]>MAP[x][y]:
                MAP[x-i][y]=MAP[x][y]+1
                Q.appendleft((x-i,y,1))
            else:
                break

        else:
            if 0<=x-K<H and 0<=y<W and MAP[x-K][y]>MAP[x][y]:
                MAP[x-K][y]=MAP[x][y]+1
                Q.appendleft((x-K,y,0))
                Q.appendleft((x-K,y,1))

    else:
        for i in range(1,K):
            if 0<=x<H and 0<=y+i<W and MAP[x][y+i]>MAP[x][y]:
                MAP[x][y+i]=MAP[x][y]+1
                Q.appendleft((x,y+i,0))
            else:
                break

        else:
            if 0<=x<H and 0<=y+K<W and MAP[x][y+K]>MAP[x][y]:
                MAP[x][y+K]=MAP[x][y]+1
                Q.appendleft((x,y+K,0))
                Q.appendleft((x,y+K,1))

        for i in range(1,K):
            if 0<=x<H and 0<=y-i<W and MAP[x][y-i]>MAP[x][y]:
                MAP[x][y-i]=MAP[x][y]+1
                Q.appendleft((x,y-i,0))
            else:
                break

        else:
            if 0<=x<H and 0<=y-K<W and MAP[x][y-K]>MAP[x][y]:
                MAP[x][y-K]=MAP[x][y]+1
                Q.appendleft((x,y-K,0))
                Q.appendleft((x,y-K,1))
            
if MAP[x2-1][y2-1]==1<<25:
    print(-1)
else:
    print(MAP[x2-1][y2-1])

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline
from collections import deque

H,W,K=map(int,input().split())
x1,y1,x2,y2=map(int,input().split())
MAP=[list(input().strip()) for i in range(H)]

for i in range(H):
    for j in range(W):
        if MAP[i][j]==".":
            MAP[i][j]=1<<30
        else:
            MAP[i][j]=-1

Q=deque()
Q.append((x1-1,y1-1,0))
Q.append((x1-1,y1-1,1))
MAP[x1-1][y1-1]=0

while Q:
    x,y,tf=Q.pop()

    if tf==0:
        for i in range(1,K):
            if 0<=x+i<H and 0<=y<W and MAP[x+i][y]>MAP[x][y]:
                MAP[x+i][y]=MAP[x][y]+1
                Q.appendleft((x+i,y,1))
            else:
                break
        else:
            if 0<=x+K<H and 0<=y<W and MAP[x+K][y]>MAP[x][y]:
                MAP[x+K][y]=MAP[x][y]+1
                Q.appendleft((x+K,y,0))
                Q.appendleft((x+K,y,1))
            

        for i in range(1,K):
            if 0<=x-i<H and 0<=y<W and MAP[x-i][y]>MAP[x][y]:
                MAP[x-i][y]=MAP[x][y]+1
                Q.appendleft((x-i,y,1))
            else:
                break

        else:
            if 0<=x-K<H and 0<=y<W and MAP[x-K][y]>MAP[x][y]:
                MAP[x-K][y]=MAP[x][y]+1
                Q.appendleft((x-K,y,0))
                Q.appendleft((x-K,y,1))

    else:
        for i in range(1,K):
            if 0<=x<H and 0<=y+i<W and MAP[x][y+i]>MAP[x][y]:
                MAP[x][y+i]=MAP[x][y]+1
                Q.appendleft((x,y+i,0))
            else:
                break

        else:
            if 0<=x<H and 0<=y+K<W and MAP[x][y+K]>MAP[x][y]:
                MAP[x][y+K]=MAP[x][y]+1
                Q.appendleft((x,y+K,0))
                Q.appendleft((x,y+K,1))

        for i in range(1,K):
            if 0<=x<H and 0<=y-i<W and MAP[x][y-i]>MAP[x][y]:
                MAP[x][y-i]=MAP[x][y]+1
                Q.appendleft((x,y-i,0))
            else:
                break

        else:
            if 0<=x<H and 0<=y-K<W and MAP[x][y-K]>MAP[x][y]:
                MAP[x][y-K]=MAP[x][y]+1
                Q.appendleft((x,y-K,0))
                Q.appendleft((x,y-K,1))
            
if MAP[x2-1][y2-1]==1<<30:
    print(-1)
else:
    print(MAP[x2-1][y2-1])

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline
from collections import deque

H,W,K=map(int,input().split())
x1,y1,x2,y2=map(int,input().split())
MAP=[list(input().strip()) for i in range(H)]

for i in range(H):
    for j in range(W):
        if MAP[i][j]==".":
            MAP[i][j]=1<<30
        else:
            MAP[i][j]=-1

Q=deque()
Q.append((x1-1,y1-1,0))
Q.append((x1-1,y1-1,1))
MAP[x1-1][y1-1]=0

while Q:
    x,y,tf=Q.pop()

    if tf==0:
        for i in range(1,K):
            if 0<=x+i<H and 0<=y<W and (MAP[x+i][y]==1<<30 or MAP[x+i][y]>MAP[x][y]):
                MAP[x+i][y]=MAP[x][y]+1
                Q.appendleft((x+i,y,1))
            else:
                break
        else:
            if 0<=x+K<H and 0<=y<W and (MAP[x+K][y]==1<<30 or MAP[x+K][y]>MAP[x][y]):
                MAP[x+K][y]=MAP[x][y]+1
                Q.appendleft((x+K,y,0))
                Q.appendleft((x+K,y,1))
            

        for i in range(1,K):
            if 0<=x-i<H and 0<=y<W and (MAP[x-i][y]==1<<30 or MAP[x-i][y]>MAP[x][y]):
                MAP[x-i][y]=MAP[x][y]+1
                Q.appendleft((x-i,y,1))
            else:
                break

        else:
            if 0<=x-K<H and 0<=y<W and (MAP[x-K][y]==1<<30 or MAP[x-K][y]>MAP[x][y]):
                MAP[x-K][y]=MAP[x][y]+1
                Q.appendleft((x-K,y,0))
                Q.appendleft((x-K,y,1))

    else:
        for i in range(1,K):
            if 0<=x<H and 0<=y+i<W and (MAP[x][y+i]==1<<30 or MAP[x][y+i]>MAP[x][y]):
                MAP[x][y+i]=MAP[x][y]+1
                Q.appendleft((x,y+i,0))
            else:
                break

        else:
            if 0<=x<H and 0<=y+K<W and (MAP[x][y+K]==1<<30 or MAP[x][y+K]>MAP[x][y]):
                MAP[x][y+K]=MAP[x][y]+1
                Q.appendleft((x,y+K,0))
                Q.appendleft((x,y+K,1))

        for i in range(1,K):
            if 0<=x<H and 0<=y-i<W and (MAP[x][y-i]==1<<30 or MAP[x][y-i]>MAP[x][y]):
                MAP[x][y-i]=MAP[x][y]+1
                Q.appendleft((x,y-i,0))
            else:
                break

        else:
            if 0<=x<H and 0<=y-K<W and (MAP[x][y-K]==1<<30 or MAP[x][y-K]>MAP[x][y]):
                MAP[x][y-K]=MAP[x][y]+1
                Q.appendleft((x,y-K,0))
                Q.appendleft((x,y-K,1))
            
if MAP[x2-1][y2-1]==1<<30:
    print(-1)
else:
    print(MAP[x2-1][y2-1])

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline

H,W,K=map(int,input().split())
x1,y1,x2,y2=map(int,input().split())
MAP=[list(input().strip()) for i in range(H)]

for i in range(H):
    for j in range(W):
        if MAP[i][j]==".":
            MAP[i][j]=1<<30
        else:
            MAP[i][j]=-1

Q=[]
Q.append((x1-1,y1-1))
MAP[x1-1][y1-1]=0

while Q:
    x,y=Q.pop()

    for i in range(1,K+1):
        if 0<=x+i<H and 0<=y<W and (MAP[x+i][y]==1<<30 or MAP[x+i][y]>MAP[x][y]):
            MAP[x+i][y]=MAP[x][y]+1
            Q.append((x+i,y))
        else:
            break

    for i in range(1,K+1):
        if 0<=x-i<H and 0<=y<W and (MAP[x-i][y]==1<<30 or MAP[x-i][y]>MAP[x][y]):
            MAP[x-i][y]=MAP[x][y]+1
            Q.append((x-i,y))
        else:
            break

    for i in range(1,K+1):
        if 0<=x<H and 0<=y+i<W and (MAP[x][y+i]==1<<30 or MAP[x][y+i]>MAP[x][y]):
            MAP[x][y+i]=MAP[x][y]+1
            Q.append((x,y+i))
        else:
            break

    for i in range(1,K+1):
        if 0<=x<H and 0<=y-i<W and (MAP[x][y-i]==1<<30 or MAP[x][y-i]>MAP[x][y]):
            MAP[x][y-i]=MAP[x][y]+1
            Q.append((x,y-i))
        else:
            break
if MAP[x2-1][y2-1]==1<<30:
    print(-1)
else:
    print(MAP[x2-1][y2-1])

Submission status: Time Limit Exceeded

Solution code:
from collections import deque

H, W, K = map(int, input().split())
x1, y1, x2, y2 = map(int, input().split())

c_array = [input() for _ in range(H)]

ans_array = [-1] * (H * W * 4)

pos = deque()

start_pos = ((x1 - 1) * W + (y1 - 1)) * 4
goal_pos = ((x2 - 1) * W + (y2 - 1)) * 4

for i in range(4):
    pos.append(start_pos + i)
    ans_array[start_pos + i] = 0

while(len(pos)):
    now_pos = pos.popleft()
    d = now_pos % 4
    h = (now_pos - d) // (4 * W) + 1
    w = ((now_pos - d) // 4) % W + 1
    # print(h, w, d, ans_array[now_pos])
    if d == 0:
        for i in range(1, K + 1):
            if h + i > H or c_array[h + i - 1][w - 1] == '@':
                break
            newpos_array = [((h + i - 1) * W + (w - 1)) * 4 + 1, ((h + i - 1)
                                                                  * W + (w - 1)) * 4 + 3, ((h + i - 1) * W + (w - 1)) * 4 + 0]
            for n, newpos in enumerate(newpos_array):
                if newpos >= goal_pos and newpos < goal_pos + 4:
                    print(ans_array[now_pos] + 1)
                    exit()
                if n == 2 and i != K:
                    break
                if ans_array[newpos] == -1:
                    pos.append(newpos)
                    ans_array[newpos] = ans_array[now_pos] + 1
    if d == 1:
        for i in range(1, K + 1):
            if w + i > W or c_array[h - 1][w + i - 1] == '@':
                break
            newpos_array = [((h - 1) * W + (w + i - 1)) * 4 + 0, ((h - 1) *
                                                                  W + (w + i - 1)) * 4 + 2, ((h - 1) * W + (w + i - 1)) * 4 + 1]
            for n, newpos in enumerate(newpos_array):
                if newpos >= goal_pos and newpos < goal_pos + 4:
                    print(ans_array[now_pos] + 1)
                    exit()
                if n == 2 and i != K:
                    break
                if ans_array[newpos] == -1:
                    pos.append(newpos)
                    ans_array[newpos] = ans_array[now_pos] + 1
    if d == 2:
        for i in range(1, K + 1):
            if h - i < 1 or c_array[h - i - 1][w - 1] == '@':
                break
            newpos_array = [((h - i - 1) * W + (w - 1)) * 4 + 1, ((h - i - 1)
                                                                  * W + (w - 1)) * 4 + 3, ((h - i - 1) * W + (w - 1)) * 4 + 2]
            for n, newpos in enumerate(newpos_array):
                if newpos >= goal_pos and newpos < goal_pos + 4:
                    print(ans_array[now_pos] + 1)
                    exit()
                if n == 2 and i != K:
                    break
                if ans_array[newpos] == -1:
                    pos.append(newpos)
                    ans_array[newpos] = ans_array[now_pos] + 1
    if d == 3:
        for i in range(1, K + 1):
            if w - i < 1 or c_array[h - 1][w - i - 1] == '@':
                break
            newpos_array = [((h - 1) * W + (w - i - 1)) * 4 + 0, ((h - 1) *
                                                                  W + (w - i - 1)) * 4 + 2, ((h - 1) * W + (w - i - 1)) * 4 + 3]
            for n, newpos in enumerate(newpos_array):
                if newpos >= goal_pos and newpos < goal_pos + 4:
                    print(ans_array[now_pos] + 1)
                    exit()
                if n == 2 and i != K:
                    break
                if ans_array[newpos] == -1:
                    pos.append(newpos)
                    ans_array[newpos] = ans_array[now_pos] + 1
print(-1)

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline
from collections import deque

H,W,K=map(int,input().split())
x1,y1,x2,y2=map(int,input().split())
MAP=[list(input().strip()) for i in range(H)]

for i in range(H):
    for j in range(W):
        if MAP[i][j]==".":
            MAP[i][j]=1<<30
        else:
            MAP[i][j]=-1

Q=deque()
Q.append((x1-1,y1-1,0))
Q.append((x1-1,y1-1,1))
MAP[x1-1][y1-1]=0

while Q:
    x,y,tf=Q.pop()

    if tf==0:
        for i in range(1,K):
            if 0<=x+i<H and 0<=y<W and (MAP[x+i][y]==1<<30 or MAP[x+i][y]>MAP[x][y]):
                MAP[x+i][y]=MAP[x][y]+1
                Q.appendleft((x+i,y,1))
            else:
                break
        else:
            if 0<=x+K<H and 0<=y<W and (MAP[x+K][y]==1<<30 or MAP[x+K][y]>MAP[x][y]):
                MAP[x+K][y]=MAP[x][y]+1
                Q.appendleft((x+K,y,0))
                Q.appendleft((x+K,y,1))
            

        for i in range(1,K):
            if 0<=x-i<H and 0<=y<W and (MAP[x-i][y]==1<<30 or MAP[x-i][y]>MAP[x][y]):
                MAP[x-i][y]=MAP[x][y]+1
                Q.appendleft((x-i,y,1))
            else:
                break

        else:
            if 0<=x-K<H and 0<=y<W and (MAP[x-K][y]==1<<30 or MAP[x-K][y]>MAP[x][y]):
                MAP[x-K][y]=MAP[x][y]+1
                Q.appendleft((x-K,y,0))
                Q.appendleft((x-K,y,1))

    else:
        for i in range(1,K+1):
            if 0<=x<H and 0<=y+i<W and (MAP[x][y+i]==1<<30 or MAP[x][y+i]>MAP[x][y]):
                MAP[x][y+i]=MAP[x][y]+1
                Q.appendleft((x,y+i,0))
            else:
                break

        else:
            if 0<=x<H and 0<=y+K<W and (MAP[x][y+K]==1<<30 or MAP[x][y+K]>MAP[x][y]):
                MAP[x][y+K]=MAP[x][y]+1
                Q.appendleft((x,y+K,0))
                Q.appendleft((x,y+K,1))

        for i in range(1,K+1):
            if 0<=x<H and 0<=y-i<W and (MAP[x][y-i]==1<<30 or MAP[x][y-i]>MAP[x][y]):
                MAP[x][y-i]=MAP[x][y]+1
                Q.appendleft((x,y-i,0))
            else:
                break

        else:
            if 0<=x<H and 0<=y-K<W and (MAP[x][y-K]==1<<30 or MAP[x][y-K]>MAP[x][y]):
                MAP[x][y-K]=MAP[x][y]+1
                Q.appendleft((x,y-K,0))
                Q.appendleft((x,y-K,1))
            
if MAP[x2-1][y2-1]==1<<30:
    print(-1)
else:
    print(MAP[x2-1][y2-1])