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:
# coding: utf-8
import sys
# from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)
from heapq import heappop, heappush
#from collections import OrderedDict, defaultdict
#import math
#from itertools import product, accumulate, combinations, product
#import bisect# lower_bound etc
#import numpy as np
# from copy import deepcopy
from collections import deque
#import numba

def run():
    H, W, K = map(int, sysread().split())
    x1,y1, x2, y2 = map(int, sysread().split())
    x1, y1 = x1-1, y1-1
    x2, y2 = x2-1, y2-1
    MAP = str(read()).split('\n')
    #print(MM)
    INF = float('inf')

    queue = []
    for i in range(4):
        heappush(queue, (1, (x1, y1, i, 0)))

    checked = [[INF] * W for _ in range(H)]
    #print(np.array(checked).shape)
    checked[x1][y1] = 0

    command = [(0, 1,0), (1,0,1), (2,-1,0), (3,0,-1)]
    best_time = INF
    while queue:
        time, (x, y, direction, seq) = heappop(queue)
        if time > checked[x2][y2]:
            continue
        if x == x2 and y == y2:
            best_time = time
            break
        for k, i, j in command:
            n_x = x+i
            n_y = y+j
            if 0 <= n_x <= H-1 and 0<= n_y <= W-1 and MAP[n_x][n_y] == '.' and checked[n_x][n_y] >= time:
                if k == direction and seq < K:
                      checked[n_x][n_y] = time
                      heappush(queue, (time, (n_x, n_y, k, seq + 1)))
                elif (k != direction or seq == K):
                    if checked[n_x][n_y] >= time + 1:
                        checked[n_x][n_y] = time + 1
                        heappush(queue, (time + 1, (n_x, n_y, k, 1)))

    if best_time == INF:
        print(-1)
    else:
        print(best_time)

if __name__ == "__main__":
    run()

Submission status: Time Limit Exceeded

Solution code:
import heapq
import math

h, w, k = map(int, input().split())
x1, y1, x2, y2 = map(int, input().split())
x1, y1, x2, y2 = x1 - 1, y1 - 1, x2 - 1, y2 - 1

field = []
for _ in range(h):
    field.append(list(input()))
visited = [[[False for _ in range(4)] for _ in range(w)] for _ in range(h)]
costs = [[[99999999 for _ in range(4)] for _ in range(w)] for _ in range(h)]


def calc(cost, d):
    ns = []

    # その方向に進む
    if d == 0:
        ns.append((1, 1, 0, d))
    elif d == 1:
        ns.append((1, 0, 1, d))
    elif d == 2:
        ns.append((1, -1, 0, d))
    elif d == 3:
        ns.append((1, 0, -1, d))

    # 方向転換
    if cost % k == 0:
        dcost = 0
    else:
        dcost = k - cost % k
    if d != 0:
        ns.append((dcost, 0, 0, 0))
    if d != 1:
        ns.append((dcost, 0, 0, 1))
    if d != 2:
        ns.append((dcost, 0, 0, 2))
    if d != 3:
        ns.append((dcost, 0, 0, 3))

    return ns


heap = []
heapq.heappush(heap, (0, (x1, y1, 0)))
costs[x1][y1][0] = 0

while heap:
    cost, (x, y, d) = heapq.heappop(heap)
    if visited[x][y][d]:
        continue
    visited[x][y][d] = True
    for dcost, dx, dy, next_d in calc(cost, d):
        if x + dx >= h or x + dx < 0 or y + dy >= w or y + dy < 0 or field[x + dx][y + dy] == '@' or visited[x + dx][y + dy][next_d]:
            continue
        if costs[x + dx][y + dy][next_d] > cost + dcost:
            costs[x + dx][y + dy][next_d] = cost + dcost
            heapq.heappush(heap, (cost + dcost, (x + dx, y + dy, next_d)))

res = min([costs[x2][y2][d] for d in range(4)])
if res == 99999999:
    print(-1)
else:
    print(math.ceil(res / k))

Submission status: Time Limit Exceeded

Solution code:
from heapq import  heappush, heappop

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

dist = [[[float('inf')] * 2 for _ in range(W)] for _ in range(H)]
dist[x1 - 1][y1 - 1] = [0, 0]

# [cost, x, y, mode]
q = [(0, x1 - 1, y1 - 1, 0), (0, x1 - 1, y1 - 1, 1)]
while q :
  ccost, cx, cy, cmode = heappop(q)
  if ccost > dist[cx][cy][cmode] :
    continue
  for i, (dx, dy) in enumerate(((-1, 0), (0, -1), (1, 0), (0, 1))) :
    nmode = i % 2
    nx, ny = cx + dx, cy + dy
    if cmode == nmode :
      ncost = ccost + 1
    else :
      ncost = (ccost + K) - ccost % K
      
    if 0 <= nx < H and 0 <= ny < W and c[nx][ny] != '@' and dist[nx][ny][nmode] > ncost :
      heappush(q, (ncost, nx, ny, nmode))
      dist[nx][ny][nmode] = ncost
 
if min(dist[x2 - 1][y2 - 1]) == float('inf') :
  print(-1)
else :
  print((min(dist[x2 - 1][y2 - 1]) + K - 1) // K)

Submission status: Time Limit Exceeded

Solution code:
# coding: utf-8
import sys
# from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)
from heapq import heappop, heappush
#from collections import OrderedDict, defaultdict
#import math
#from itertools import product, accumulate, combinations, product
#import bisect# lower_bound etc
#import numpy as np
# from copy import deepcopy
from collections import deque
#import numba

def run():
    H, W, K = map(int, sysread().split())
    x1,y1, x2, y2 = map(int, sysread().split())
    MM = str(read()).split('\n')
    #print(MM)
    MAP = [['@'] * (W+2)]
    for s in MM:
        if len(s) == 0:continue
        tmp = deque(list(s))
        tmp.appendleft('@')
        tmp.append('@')
        MAP.append(list(tmp))
        #print(len(tmp))
    MAP.append(['@'] * (W+2))
    #print(MAP)
    #print(np.array(MAP).shape)

    INF = float('inf')

    queue = []
    heappush(queue, (1, (x1, y1, 0, 0)))
    heappush(queue, (1, (x1, y1, 1, 0)))
    heappush(queue, (1, (x1, y1, 2, 0)))
    heappush(queue, (1, (x1, y1, 3, 0)))

    checked = [[INF] * (W+2) for _ in range(H+2)]
    #print(np.array(checked).shape)
    checked[x1][y1] = 0

    command = [(0, 1,0), (1,0,1), (2,-1,0), (3,0,-1)]
    best_time = INF
    while queue:
        time, (x, y, direction, seq) = heappop(queue)
        if time > checked[x2][y2]:
            continue
        if x == x2 and y == y2:
            best_time = time
            break
        for k, i, j in command:
            n_x = x+i
            n_y = y+j
            if MAP[n_x][n_y] == '.' and checked[n_x][n_y] >= time:
                if k == direction and seq < K:
                      checked[n_x][n_y] = time
                      heappush(queue, (time, (n_x, n_y, k, seq + 1)))
                elif (k != direction or seq == K):
                    if checked[n_x][n_y] >= time + 1:
                        checked[n_x][n_y] = time + 1
                        heappush(queue, (time + 1, (n_x, n_y, k, 1)))

    if best_time == INF:
        print(-1)
    else:
        print(best_time)

if __name__ == "__main__":
    run()

Submission status: Time Limit Exceeded

Solution code:
# coding: utf-8
import sys
# from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)
from heapq import heappop, heappush
#from collections import OrderedDict, defaultdict
#import math
#from itertools import product, accumulate, combinations, product
#import bisect# lower_bound etc
#import numpy as np
# from copy import deepcopy
from collections import deque
#import numba

def run():
    H, W, K = map(int, sysread().split())
    x1,y1, x2, y2 = map(int, sysread().split())
    MM = str(read()).split('\n')
    #print(MM)
    MAP = [['@'] * (W+2)]
    for s in MM:
        if len(s) == 0:continue
        tmp = deque(list(s))
        tmp.appendleft('@')
        tmp.append('@')
        MAP.append(list(tmp))
        #print(len(tmp))
    MAP.append(['@'] * (W+2))
    #print(MAP)
    #print(np.array(MAP).shape)

    INF = float('inf')

    queue = []
    heappush(queue, (1, (x1, y1, 0, 0)))
    heappush(queue, (1, (x1, y1, 1, 0)))
    heappush(queue, (1, (x1, y1, 2, 0)))
    heappush(queue, (1, (x1, y1, 3, 0)))

    checked = [[INF] * (W+2) for _ in range(H+2)]
    #print(np.array(checked).shape)
    checked[x1][y1] = 0

    command = [(0, 1,0), (1,0,1), (2,-1,0), (3,0,-1)]
    best_time = INF
    while queue:
        time, (x, y, direction, seq) = heappop(queue)
        if time > checked[x2][y2]:
            continue
        if x == x2 and y == y2:
            best_time = time
            break
        for k, i, j in command:
            n_x = x+i
            n_y = y+j
            if checked[n_x][n_y] < time:continue
            if MAP[n_x][n_y] == '.':
                if k == direction and seq < K:
                      checked[n_x][n_y] = time
                      heappush(queue, (time, (n_x, n_y, k, seq + 1)))
                elif (k != direction or seq == K):
                    if checked[n_x][n_y] >= time + 1:
                        checked[n_x][n_y] = time + 1
                        heappush(queue, (time + 1, (n_x, n_y, k, 1)))

    if best_time == INF:
        print(-1)
    else:
        print(best_time)




if __name__ == "__main__":
    run()

Submission status: Time Limit Exceeded

Solution code:
# coding: utf-8
import sys
# from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)
from heapq import heappop, heappush
#from collections import OrderedDict, defaultdict
#import math
#from itertools import product, accumulate, combinations, product
#import bisect# lower_bound etc
#import numpy as np
# from copy import deepcopy
from collections import deque
#import numba

def run():
    H, W, K = map(int, sysread().split())
    x1,y1, x2, y2 = map(int, sysread().split())
    MM = str(read()).split('\n')
    #print(MM)
    MAP = [['@'] * (W+2)]
    for s in MM:
        if len(s) == 0:continue
        tmp = deque(list(s))
        tmp.appendleft('@')
        tmp.append('@')
        MAP.append(list(tmp))
        #print(len(tmp))
    MAP.append(['@'] * (W+2))
    #print(MAP)
    #print(np.array(MAP).shape)

    INF = float('inf')

    queue = []
    heappush(queue, (1, (x1, y1, 0, 0)))
    heappush(queue, (1, (x1, y1, 1, 0)))
    heappush(queue, (1, (x1, y1, 2, 0)))
    heappush(queue, (1, (x1, y1, 3, 0)))

    checked = [[INF] * (W+2) for _ in range(H+2)]
    #print(np.array(checked).shape)
    checked[x1][y1] = 0

    command = [(0, 1,0), (1,0,1), (2,-1,0), (3,0,-1)]
    best_time = INF
    while queue:
        time, (x, y, direction, seq) = heappop(queue)
        if time > checked[x2][y2]:
            continue
        if x == x2 and y == y2:
            best_time = time
            break
        for k, i, j in command:
            n_x = x+i
            n_y = y+j
            if MAP[n_x][n_y] == '.' and checked[n_x][n_y] >= time:
                if k == direction and seq < K:
                      checked[n_x][n_y] = time
                      heappush(queue, (time, (n_x, n_y, k, seq + 1)))
                elif (k != direction or seq == K):
                    if checked[n_x][n_y] >= time + 1:
                        checked[n_x][n_y] = time + 1
                        heappush(queue, (time + 1, (n_x, n_y, k, 1)))

    if best_time == INF:
        print(-1)
    else:
        print(best_time)




if __name__ == "__main__":
    run()

Submission status: Time Limit Exceeded

Solution code:
# coding: utf-8
import sys
# from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)
from heapq import heappop, heappush
#from collections import OrderedDict, defaultdict
#import math
#from itertools import product, accumulate, combinations, product
#import bisect# lower_bound etc
#import numpy as np
# from copy import deepcopy
from collections import deque
#import numba

def run():
    H, W, K = map(int, sysread().split())
    x1,y1, x2, y2 = map(int, sysread().split())
    MM = str(read()).split('\n')
    #print(MM)
    MAP = [['@'] * (W+2)]
    for s in MM:
        if len(s) == 0:continue
        tmp = deque(list(s))
        tmp.appendleft('@')
        tmp.append('@')
        MAP.append(list(tmp))
        #print(len(tmp))
    MAP.append(['@'] * (W+2))
    #print(MAP)
    #print(np.array(MAP).shape)

    INF = float('inf')

    queue = []
    heappush(queue, (1, (x1, y1, 0, 0)))
    heappush(queue, (1, (x1, y1, 1, 0)))
    heappush(queue, (1, (x1, y1, 2, 0)))
    heappush(queue, (1, (x1, y1, 3, 0)))

    checked = [[INF] * (W+2) for _ in range(H+2)]
    #print(np.array(checked).shape)
    checked[x1][y1] = 0

    command = [(0, 1,0), (1,0,1), (2,-1,0), (3,0,-1)]
    best_time = INF
    while queue:
        time, (x, y, direction, seq) = heappop(queue)
        if time > checked[x2][y2]:
            continue
        if x == x2 and y == y2:
            best_time = time
            break
        for k, i, j in command:
            n_x = x+i
            n_y = y+j
            if MAP[n_x][n_y] == '.' and checked[n_x][n_y] >= time:
                if k == direction and seq < K:
                      checked[n_x][n_y] = time
                      heappush(queue, (time, (n_x, n_y, k, seq + 1)))
                elif (k != direction or seq == K):
                    if checked[n_x][n_y] >= time + 1:
                        checked[n_x][n_y] = time + 1
                        heappush(queue, (time + 1, (n_x, n_y, k, 1)))

    if best_time == INF:
        print(-1)

    else:
        print(best_time)




if __name__ == "__main__":
    run()

Submission status: Time Limit Exceeded

Solution code:
from collections import deque
import sys

N_MAX = 200000 + 5

H, W, K = map(int, input().split())
sth, stw, glh, glw = map(int, input().split())

INF = 10**6 * K

dp = [[INF for _ in range(W+2)] for _ in range(H+2)]

dp[0] = [-1]*(W+2)
dp[H+1] = [-1]*(W+2)
for h in range(1, H+1):
    s = sys.stdin.readline()
    dp[h][0] = -1
    dp[h][W+1] = -1
    for w in range(1, W+1):
        if s[w-1] == "@":
            dp[h][w] = -1

dp[sth][stw] = 0


# Seen = [[INF]*W for _ in range(H)]
XY = {(1, 0), (-1, 0), (0, 1), (0, -1)}


def bfs(sth, stw, glh, glw):
    next_q = deque()
    next_q.append((sth, stw))

    while len(next_q) != 0:
        # キュー取り出し(先頭)
        h, w = next_q.popleft()
        for dh, dw in XY:
            for sk in range(1, K+1):
                hs, ws = h + dh*sk, w + dw*sk
                if dp[hs][ws] == -1:
                    break
                if dp[hs][ws] == INF:
                    next_q.append((hs, ws))
                    dp[hs][ws] = dp[h][w] + 1
                # elif dp[hs][ws] <= dp[h][w]:
                #    break
                if hs == glh and ws == glw:
                    return dp[h][w] + 1
    return -1


def main():
    ret = bfs(sth, stw, glh, glw)
    print(ret)


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
# coding: utf-8
import sys
# from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)
#from heapq import heappop, heappush
#from collections import OrderedDict, defaultdict
#import math
#from itertools import product, accumulate, combinations, product
#import bisect# lower_bound etc
#import numpy as np
# from copy import deepcopy
from collections import deque
#import numba

def run():
    H, W, K = map(int, sysread().split())
    x1,y1, x2, y2 = map(int, sysread().split())
    MM = str(read()).split('\n')
    #print(MM)
    MAP = [['@'] * (W+2)]
    for s in MM:
        if len(s) == 0:continue
        tmp = deque(list(s))
        tmp.appendleft('@')
        tmp.append('@')
        MAP.append(list(tmp))
        #print(len(tmp))
    MAP.append(['@'] * (W+2))
    #print(MAP)
    #print(np.array(MAP).shape)




    INF = float('inf')
    queue = deque([])
    queue.append((1, (x1, y1, 0, 0)))# time, x, y, direction, seq
    queue.append((1, (x1, y1, 1, 0)))
    queue.append((1, (x1, y1, 2, 0)))
    queue.append((1, (x1, y1, 3, 0)))

    checked = [[INF] * (W+2) for _ in range(H+2)]
    #print(np.array(checked).shape)
    checked[x1][y1] = 0

    command = [(0, 1,0), (1,0,1), (2,-1,0), (3,0,-1)]
    best_time = INF
    while queue:
        time, (x, y, direction, seq) = queue.popleft()
        if time > checked[x2][y2]:
            continue
        for k, i, j in command:
            n_x = x+i
            n_y = y+j
            if MAP[n_x][n_y] == '.' and checked[n_x][n_y] >= time:
                if k == direction and seq < K:
                      checked[n_x][n_y] = time
                      queue.append((time, (n_x, n_y, k, seq + 1)))
                elif (k != direction or seq == K):
                    if checked[n_x][n_y] >= time + 1:
                        checked[n_x][n_y] = time + 1
                        queue.append((time + 1, (n_x, n_y, k, 1)))

    best_time = checked[x2][y2]
    if best_time == INF:
        print(-1)

    else:
        print(best_time)




if __name__ == "__main__":
    run()

Submission status: Time Limit Exceeded

Solution code:
# coding: utf-8
import sys
# from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)
#from heapq import heappop, heappush
#from collections import OrderedDict, defaultdict
#import math
#from itertools import product, accumulate, combinations, product
#import bisect# lower_bound etc
#import numpy as np
# from copy import deepcopy
from collections import deque
#import numba

def run():
    H, W, K = map(int, sysread().split())
    x1,y1, x2, y2 = map(int, sysread().split())
    MM = str(read()).split('\n')
    #print(MM)
    MAP = [['@'] * (W+2)]
    for s in MM:
        if len(s) == 0:continue
        tmp = deque(list(s))
        tmp.appendleft('@')
        tmp.append('@')
        MAP.append(list(tmp))
        #print(len(tmp))
    MAP.append(['@'] * (W+2))
    #print(MAP)
    #print(np.array(MAP).shape)




    INF = float('inf')
    queue = deque([])
    queue.append((1, (x1, y1, 0, 0)))# time, x, y, direction, seq
    queue.append((1, (x1, y1, 1, 0)))
    queue.append((1, (x1, y1, 2, 0)))
    queue.append((1, (x1, y1, 3, 0)))

    checked = [[INF] * (W+2) for _ in range(H+2)]
    #print(np.array(checked).shape)
    checked[x1][y1] = 0

    command = [(0, 1,0), (1,0,1), (2,-1,0), (3,0,-1)]
    best_time = INF
    while queue:
        time, (x, y, direction, seq) = queue.popleft()
        if time > checked[x2][y2]:
            continue
        for k, i, j in command:
            n_x = x+i
            n_y = y+j
            if MAP[n_x][n_y] == '.':
                if k == direction and seq < K:
                    if checked[n_x][n_y] >= time:
                        checked[n_x][n_y] = time
                        queue.append((time, (n_x, n_y, k, seq + 1)))
                elif (k != direction or seq == K):
                    if checked[n_x][n_y] >= time + 1:
                        checked[n_x][n_y] = time + 1
                        queue.append((time + 1, (n_x, n_y, k, 1)))

    best_time = checked[x2][y2]
    if best_time == INF:
        print(-1)

    else:
        print(best_time)




if __name__ == "__main__":
    run()

Submission status: Time Limit Exceeded

Solution code:
# coding: utf-8
import sys
# from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)
#from heapq import heappop, heappush
#from collections import OrderedDict, defaultdict
#import math
#from itertools import product, accumulate, combinations, product
#import bisect# lower_bound etc
#import numpy as np
# from copy import deepcopy
from collections import deque
#import numba

def run():
    H, W, K = map(int, sysread().split())
    x1,y1, x2, y2 = map(int, sysread().split())
    MM = str(read()).split('\n')
    #print(MM)
    MAP = [['@'] * (W+2)]
    for s in MM:
        if len(s) == 0:continue
        tmp = deque(list(s))
        tmp.appendleft('@')
        tmp.append('@')
        MAP.append(list(tmp))
        #print(len(tmp))
    MAP.append(['@'] * (W+2))
    #print(MAP)
    #print(np.array(MAP).shape)




    INF = float('inf')
    queue = deque([])
    queue.append((1, (x1, y1, 0, 0)))# time, x, y, direction, seq
    queue.append((1, (x1, y1, 1, 0)))
    queue.append((1, (x1, y1, 2, 0)))
    queue.append((1, (x1, y1, 3, 0)))

    checked = [[INF] * (W+2) for _ in range(H+2)]
    #print(np.array(checked).shape)
    checked[x1][y1] = 0

    command = [(0, 1,0), (1,0,1), (2,-1,0), (3,0,-1)]
    best_time = INF
    while queue:
        time, (x, y, direction, seq) = queue.popleft()
        if time > best_time:
            continue
        if x==x2 and y==y2:
            best_time = time
        for k, i, j in command:
            n_x = x+i
            n_y = y+j
            if MAP[n_x][n_y] == '.':
                if k == direction and seq < K:
                    if checked[n_x][n_y] >= time:
                        checked[n_x][n_y] = time
                        queue.append((time, (n_x, n_y, k, seq + 1)))
                elif (k != direction or seq == K):
                    if checked[n_x][n_y] >= time + 1:
                        checked[n_x][n_y] = time + 1
                        queue.append((time + 1, (n_x, n_y, k, 1)))


    if best_time == INF:
        print(-1)

    else:
        print(best_time)




if __name__ == "__main__":
    run()

Submission status: Time Limit Exceeded

Solution code:
# coding: utf-8
import sys
# from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)
#from heapq import heappop, heappush
#from collections import OrderedDict, defaultdict
#import math
#from itertools import product, accumulate, combinations, product
#import bisect# lower_bound etc
#import numpy as np
# from copy import deepcopy
from collections import deque
#import numba

def run():
    H, W, K = map(int, sysread().split())
    x1,y1, x2, y2 = map(int, sysread().split())
    MM = str(read()).split('\n')
    #print(MM)
    MAP = [['@'] * (W+2)]
    for s in MM:
        if len(s) == 0:continue
        tmp = deque(list(s))
        tmp.appendleft('@')
        tmp.append('@')
        MAP.append(list(tmp))
        #print(len(tmp))
    MAP.append(['@'] * (W+2))
    #print(MAP)
    #print(np.array(MAP).shape)




    INF = float('inf')
    queue = deque([])
    queue.append((1, (x1, y1, 0, 0)))# time, x, y, direction, seq
    queue.append((1, (x1, y1, 1, 0)))
    queue.append((1, (x1, y1, 2, 0)))
    queue.append((1, (x1, y1, 3, 0)))

    checked = [[[INF] * 4 for i in range(W+2)] for _ in range(H+2)]
    #print(np.array(checked).shape)
    checked[x1][y1][0] = 1
    checked[x1][y1][1] = 1
    checked[x1][y1][2] = 1
    checked[x1][y1][3] = 1

    command = [(0, 1,0), (1,0,1), (2,-1,0), (3,0,-1)]
    best_time = INF
    while queue:
        time, (x, y, direction, seq) = queue.popleft()
        if time > best_time:
            continue
        if x==x2 and y==y2:
            best_time = time
        for k, i, j in command:
            n_x = x+i
            n_y = y+j
            if MAP[n_x][n_y] == '.':
                if k == direction and seq < K:
                    if checked[n_x][n_y][k] >= time:
                        checked[n_x][n_y][k] = time
                        queue.append((time, (n_x, n_y, k, seq + 1)))
                elif (k != direction or seq == K):
                    if checked[n_x][n_y][k] >= time + 1:
                        checked[n_x][n_y][k] = time + 1
                        queue.append((time + 1, (n_x, n_y, k, 1)))


    if best_time == INF:
        print(-1)

    else:
        print(best_time)




if __name__ == "__main__":
    run()

Submission status: Time Limit Exceeded

Solution code:
# coding: utf-8
import sys
# from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)
#from heapq import heappop, heappush
#from collections import OrderedDict, defaultdict
#import math
#from itertools import product, accumulate, combinations, product
#import bisect# lower_bound etc
#import numpy as np
# from copy import deepcopy
from collections import deque
#import numba

def run():
    H, W, K = map(int, sysread().split())
    x1,y1, x2, y2 = map(int, sysread().split())
    MM = str(read()).split('\n')
    #print(MM)
    MAP = [['@'] * (W+2)]
    for s in MM:
        if len(s) == 0:continue
        tmp = deque(list(s))
        tmp.appendleft('@')
        tmp.append('@')
        MAP.append(list(tmp))
        #print(len(tmp))
    MAP.append(['@'] * (W+2))
    #print(MAP)
    #print(np.array(MAP).shape)




    INF = float('inf')
    queue = deque([])
    queue.append((1, (x1, y1, 0, 0)))# time, x, y, direction, seq
    queue.append((1, (x1, y1, 1, 0)))
    queue.append((1, (x1, y1, 2, 0)))
    queue.append((1, (x1, y1, 3, 0)))

    checked = [[[INF] * 4 for i in range(W+2)] for _ in range(H+2)]
    #print(np.array(checked).shape)
    checked[x1][y1][0] = 1
    checked[x1][y1][1] = 1
    checked[x1][y1][2] = 1
    checked[x1][y1][3] = 1

    command = [(0, 1,0), (1,0,1), (2,-1,0), (3,0,-1)]
    best_time = INF
    while queue:
        time, (x, y, direction, seq) = queue.popleft()
        if time > best_time:
            continue
        if x==x2 and y==y2:
            best_time = time
        for k, i, j in command:
            n_x = x+i
            n_y = y+j
            if MAP[n_x][n_y] == '.':
                if k == direction and checked[n_x][n_y][k] >= time and seq < K:
                    checked[n_x][n_y][k] = time
                    queue.append((time, (n_x, n_y, k, seq + 1)))
                elif (k != direction or seq == K) and checked[n_x][n_y][k] >= time + 1:
                    checked[n_x][n_y][k] = time + 1
                    queue.append((time + 1, (n_x, n_y, k, 1)))


    if best_time == INF:
        print(-1)

    else:
        print(best_time)




if __name__ == "__main__":
    run()

Submission status: Time Limit Exceeded

Solution code:
from collections import deque
import math
import sys

N_MAX = 200000 + 5
sys.setrecursionlimit(N_MAX)

H, W, K = map(int, sys.stdin.readline().split())
x1, y1, x2, y2 = map(int, sys.stdin.readline().split())
INF = 10**6 * K

dp = [[INF for _ in range(W+2)] for _ in range(H+2)]

dp[0] = [-1]*(W+2)
dp[H+1] = [-1]*(W+2)
for h in range(1,H+1):
    s = sys.stdin.readline()
    dp[h][0] = -1
    dp[h][W+1] = -1
    for w in range(1,W+1):
        if s[w-1] == "@":
            dp[h][w] = -1

### BFS ###

# ステップ方向
D = [0, 1, 2, 3]  # direction
Y = [1, 0, -1, 0]
X = [0, 1, 0, -1]

def bfs(x1, y1, x2, y2):
    
    q = deque()
    q.append((x1, y1))

    while q:
        # print(q)
        x0, y0 = q.popleft()

        for x, y in zip(X, Y):

            for i in range(1,K+1):

                # print(y0,y,x0,x,d, (y0+y,x0+x,d), end=" : ")
                dp_c = dp[x0][y0]  # 現在のdp値
                n_x, n_y = x0+x*i, y0+y*i

                # print(dp_c, (n_x,n_y), end=" : ")

                if dp[n_x][n_y] == -1:
                    # print("@")
                    break

                if dp[n_x][n_y] == INF:
                    dp[n_x][n_y] = dp_c + 1
                elif dp[n_x][n_y] <= dp_c:
                    break

                if n_x == x2 and n_y == y2:
                    return dp[n_x][n_y]

                q.append((n_x, n_y))

    return -1

# スタート地点を 0 にする
dp[x1][y1] = 0

a = bfs(x1,y1,x2,y2)

print(a)

Submission status: Time Limit Exceeded

Solution code:
from collections import deque
import math
import sys

N_MAX = 200000 + 5
sys.setrecursionlimit(N_MAX)

H, W, K = map(int, sys.stdin.readline().split())
x1, y1, x2, y2 = map(int, sys.stdin.readline().split())
INF = 10**6 * K

dp = [[INF for _ in range(W+2)] for _ in range(H+2)]

dp[0] = [-1]*(W+2)
dp[H+1] = [-1]*(W+2)
for h in range(1,H+1):
    s = sys.stdin.readline()
    dp[h][0] = -1
    dp[h][W+1] = -1
    for w in range(1,W+1):
        if s[w-1] == "@":
            dp[h][w] = -1

### BFS ###

# ステップ方向
D = [0, 1, 2, 3]  # direction
Y = [1, 0, -1, 0]
X = [0, 1, 0, -1]

def bfs(x1, y1, x2, y2):
    
    q = deque()
    q.append((x1, y1))

    while q:
        # print(q)
        x0, y0 = q.popleft()

        for x, y in zip(X, Y):

            for i in range(1,K+1):

                # print(y0,y,x0,x,d, (y0+y,x0+x,d), end=" : ")
                dp_c = dp[x0][y0]  # 現在のdp値
                n_x, n_y = x0+x*i, y0+y*i

                # print(dp_c, (n_x,n_y), end=" : ")

                if dp[n_x][n_y] == -1:
                    # print("@")
                    break

                if dp[n_x][n_y] <= dp_c:
                    break

                dp[n_x][n_y] = dp_c + 1

                if n_x == x2 and n_y == y2:
                    return dp[n_x][n_y]
                q.append((n_x, n_y))

    return -1

# スタート地点を 0 にする
dp[x1][y1] = 0

a = bfs(x1,y1,x2,y2)

print(a)

Submission status: Time Limit Exceeded

Solution code:
import sys
from collections import deque

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


def solve():
    H, W, K = map(int, rl().split())
    sy, sx, gy, gx = map(lambda n: int(n) - 1, rl().split())
    c = [rl().rstrip() for _ in range(H)]
    
    INF = 10 ** 10
    cost = [[INF] * W for _ in range(H)]
    cost[sy][sx] = 0
    que = deque([(sy, sx)])
    while que:
        cy, cx = que.popleft()
        for dy, dx in ((-1, 0), (0, 1), (1, 0), (0, -1)):
            for k in range(1, K + 1):
                ny, nx = cy + k * dy, cx + k * dx
                if 0 <= ny < H and 0 <= nx < W:
                    if c[ny][nx] == '@':
                        break
                    if cost[ny][nx] <= cost[cy][cx]:
                        break
                    cost[ny][nx] = cost[cy][cx] + 1
                    que.append((ny, nx))
    print(cost[gy][gx] if cost[gy][gx] != INF else -1)


if __name__ == '__main__':
    solve()