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:
import sys
from collections import deque
sys.setrecursionlimit(10**6)


def main(input, print):
    vx = [0, 1, 0, -1]
    vy = [-1, 0, 1, 0]

    H, W, K = map(int, input().split())
    x1, y1, x2, y2 = map(int, input().split())
    table = [[] for _ in range(H)]
    for i in range(H):
        table[i] = list(input().strip())
    q = deque()
    q.append((x1-1, y1-1, 0))
    table[x1-1][y1-1] = 0
    while len(q) > 0:
        x, y, cnt = q.popleft()
        for i in range(4):
            for k in range(1, K+1):
                nx = x + vx[i] * k
                ny = y + vy[i] * k
                if nx < 0 or ny < 0 or nx >= H or ny >= W:
                    break
                if table[nx][ny] == '@':
                    break
                if table[nx][ny] != '.':
                    continue
                table[nx][ny] = cnt+1
                q.append((nx, ny, cnt+1))
    if table[x2-1][y2-1] == '.':
        print(-1)
    else:
        print(table[x2-1][y2-1])


if __name__ == '__main__':
    main(sys.stdin.readline, print)

Submission status: Time Limit Exceeded

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

def calc_next_point(x, y, vec, dist):
    if vec == 0:
        return x-dist, y
    elif vec == 1:
        return x, y+dist
    elif vec == 2:
        return x+dist, y
    else:
        return x, y-dist

def main():
    h, w, k = map(int, input().split())
    x1, y1, x2, y2 = map(int, input().split())
    pond = [[[-1]*4 for j in range(w+2)] for i in range(h+2)]
    for i in range(1, h+1):
        s = input()
        for j in range(w):
            if s[j] == ".":
                for l in range(4):
                    pond[i][j+1][l] = float("inf")
    qs = [queue.Queue(), queue.Queue()]
    for i in range(4):
        pond[x1][y1][i] = 0
        qs[0].put([0, x1, y1, i])
    p = 0
    minans = float("inf")
    while not qs[0].empty() or not qs[1].empty():
        while not qs[p].empty():
            cost, x, y, vec = qs[p].get()
            np = (p+1)%2
            if cost >= minans:
                break
            if x == x2 and y == y2:
                if cost < minans:
                    minans = cost
            for i in range(1, k+1):
                nx, ny = calc_next_point(x, y, vec, i)
                if pond[nx][ny][vec] == -1:
                    break
                ncost = cost + 1
                if pond[nx][ny][vec] < ncost:
                    break
                pond[nx][ny][vec] = ncost
                if nx == x2 and ny == y2:
                    if ncost < minans:
                        minans = ncost
                for j in range(4):
                    if i == k:
                        if j != (vec+2)%4:
                            if j == vec or pond[nx][ny][j] > ncost:
                                pond[nx][ny][j] = ncost
                                qs[np].put([ncost, nx, ny, j])
                    elif i == 1:
                        if j != vec:
                            if j == (vec+2)%4 or pond[nx][ny][j] > ncost:
                                pond[nx][ny][j] = ncost
                                qs[np].put([ncost, nx, ny, j])
                    else:
                        if j != vec and j != (vec+2)%4:
                            if pond[nx][ny][j] > ncost:
                                pond[nx][ny][j] = ncost
                                qs[np].put([ncost, nx, ny, j])
        p = (p+1)%2
    if min(pond[x2][y2]) == float("inf"):
        print(-1)
    else:
        print(min(pond[x2][y2]))

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

def calc_next_point(x, y, vec, dist):
    if vec == 0:
        return x-dist, y
    elif vec == 1:
        return x, y+dist
    elif vec == 2:
        return x+dist, y
    else:
        return x, y-dist

def main():
    h, w, k = map(int, input().split())
    x1, y1, x2, y2 = map(int, input().split())
    pond = [[[-1]*4 for j in range(w+2)] for i in range(h+2)]
    for i in range(1, h+1):
        s = input()
        for j in range(w):
            if s[j] == ".":
                for l in range(4):
                    pond[i][j+1][l] = float("inf")
    qs = [queue.Queue(), queue.Queue()]
    for i in range(4):
        pond[x1][y1][i] = 0
        qs[0].put([0, x1, y1, i])
    p = 0
    minans = float("inf")
    while not qs[0].empty() or not qs[1].empty():
        while not qs[p].empty():
            cost, x, y, vec = qs[p].get()
            np = (p+1)%2
            if cost > minans:
                break
            if x == x2 and y == y2:
                if cost < minans:
                    minans = cost
            for i in range(1, k+1):
                nx, ny = calc_next_point(x, y, vec, i)
                if pond[nx][ny][vec] == -1:
                    break
                ncost = cost + 1
                if pond[nx][ny][vec] < ncost:
                    break
                pond[nx][ny][vec] = ncost
                if nx == x2 and ny == y2:
                    if ncost < minans:
                        minans = ncost
                for j in range(4):
                    if pond[nx][ny][j] > ncost or i == k:
                        pond[nx][ny][j] = ncost
                        qs[np].put([ncost, nx, ny, j])
        p = (p+1)%2
    if min(pond[x2][y2]) == float("inf"):
        print(-1)
    else:
        print(min(pond[x2][y2]))

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

def calc_next_point(x, y, vec, dist):
    if vec == 0:
        return x-dist, y
    elif vec == 1:
        return x, y+dist
    elif vec == 2:
        return x+dist, y
    else:
        return x, y-dist

def main():
    h, w, k = map(int, input().split())
    x1, y1, x2, y2 = map(int, input().split())
    pond = [[[-1]*4 for j in range(w+2)] for i in range(h+2)]
    for i in range(1, h+1):
        s = input()
        for j in range(w):
            if s[j] == ".":
                for l in range(4):
                    pond[i][j+1][l] = float("inf")
    qs = [queue.Queue(), queue.Queue()]
    for i in range(4):
        pond[x1][y1][i] = 0
        qs[0].put([0, x1, y1, i])
    p = 0
    minans = float("inf")
    while not qs[0].empty() or not qs[1].empty():
        while not qs[p].empty():
            cost, x, y, vec = qs[p].get()
            np = (p+1)%2
            if cost > minans:
                break
            if x == x2 and y == y2:
                if cost < minans:
                    minans = cost
            for i in range(1, k+1):
                nx, ny = calc_next_point(x, y, vec, i)
                if pond[nx][ny][vec] == -1:
                    break
                ncost = cost + 1
                if pond[nx][ny][vec] < ncost:
                    break
                pond[nx][ny][vec] = ncost
                if nx == x2 and ny == y2:
                    if ncost < minans:
                        minans = ncost
                for j in range(4):
                    if i == k or j != vec:
                        if pond[nx][ny][j] >= ncost:
                            pond[nx][ny][j] = ncost
                            qs[np].put([ncost, nx, ny, j])
        p = (p+1)%2
    if min(pond[x2][y2]) == float("inf"):
        print(-1)
    else:
        print(min(pond[x2][y2]))

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

def calc_next_point(x, y, vec, dist):
    if vec == 0:
        return x-dist, y
    elif vec == 1:
        return x, y+dist
    elif vec == 2:
        return x+dist, y
    else:
        return x, y-dist

def main():
    h, w, k = map(int, input().split())
    x1, y1, x2, y2 = map(int, input().split())
    pond = [[[-1]*4 for j in range(w+2)] for i in range(h+2)]
    for i in range(1, h+1):
        s = input()
        for j in range(w):
            if s[j] == ".":
                for l in range(4):
                    pond[i][j+1][l] = float("inf")
    qs = [queue.Queue(), queue.Queue()]
    for i in range(4):
        pond[x1][y1][i] = 0
        qs[0].put([0, x1, y1, i])
    p = 0
    while not qs[0].empty() or not qs[1].empty():
        while not qs[p].empty():
            cost, x, y, vec = qs[p].get()
            np = (p+1)%2
            for i in range(1, k+1):
                nx, ny = calc_next_point(x, y, vec, i)
                if pond[nx][ny][vec] == -1:
                    break
                ncost = cost + 1
                if pond[nx][ny][vec] < ncost:
                    break
                pond[nx][ny][vec] = ncost
                for j in range(4):
                    if i == k or j != vec:
                        if pond[nx][ny][j] >= ncost:
                            pond[nx][ny][j] = ncost
                            qs[np].put([ncost, nx, ny, j])
        p = (p+1)%2
    if min(pond[x2][y2]) == float("inf"):
        print(-1)
    else:
        print(min(pond[x2][y2]))

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
from collections import deque
H, W, K = map(int, input().split())
sx, sy, gx, gy = map(int, input().split())
sx -= 1
sy -= 1
gx -= 1
gy -= 1
grid = [input() for _ in range(H)]


def inside(r, c):
    return 0 <= r < H and 0 <= c < W and grid[r][c] != '@'


dx = [-1, 1, 0, 0]
dy = [0, 0, -1, 1]
INF = 10**9
dist = [[INF]*W for _ in range(H)]
que = deque()
que.append([sx, sy])
dist[sx][sy] = 0
while que:
    [x, y] = que.popleft()
    for k in range(4):
        for d in range(1, K+1):
            nx = x + d*dx[k]
            ny = y + d*dy[k]
            if not inside(nx, ny) or dist[nx][ny] <= dist[x][y]:
                break
#             if not inside(nx, ny):
#                 break
#             if dist[nx][ny] <= dist[x][y]:
#                 break
            if dist[nx][ny] == INF:
                dist[nx][ny] = dist[x][y] + 1
                que.append([nx, ny])
if dist[gx][gy] == INF:
    print(-1)
else:
    print(dist[gx][gy])

Submission status: Time Limit Exceeded

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

def calc_next_point(x, y, vec, dist):
    if vec == 0:
        return x-dist, y
    elif vec == 1:
        return x, y+dist
    elif vec == 2:
        return x+dist, y
    else:
        return x, y-dist

def main():
    h, w, k = map(int, input().split())
    x1, y1, x2, y2 = map(int, input().split())
    pond = [[[False]*4 for j in range(w+2)] for i in range(h+2)]
    for i in range(1, h+1):
        s = input()
        for j in range(w):
            if s[j] == ".":
                for l in range(4):
                    pond[i][j+1][l] = True
    qs = [queue.Queue(), queue.Queue()]
    for i in range(4):
        pond[x1][y1][i] = False
        qs[0].put([0, x1, y1, i])
    ans = [float("inf")]*4
    p = 0
    while not qs[0].empty() or not qs[1].empty():
        while not qs[p].empty():
            cost, x, y, vec = qs[p].get()
            if x == x2 and y == y2 and ans[vec] > cost:
                ans[vec] = cost
            for i in range(1, k+1):
                nx, ny = calc_next_point(x, y, vec, i)
                if not pond[nx][ny][vec]:
                    break
                ncost = cost + 1
                np = (p+1)%2
                if nx == x2 and ny == y2 and ans[vec] > ncost:
                    ans[vec] = ncost
                for j in range(4):
                    if i == k or j != vec:
                        mx, my = calc_next_point(nx, ny, j, 0)
                        if pond[mx][my][j]:
                            qs[np].put([ncost, mx, my, j])
                            pond[mx][my][j] = False
                pond[nx][ny][vec] = False
        p = (p+1)%2
    if min(ans) == float("inf"):
        print(-1)
    else:
        print(min(ans))

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

def calc_next_point(x, y, vec, dist):
    if vec == 0:
        return x-dist, y
    elif vec == 1:
        return x, y+dist
    elif vec == 2:
        return x+dist, y
    else:
        return x, y-dist

def main():
    h, w, k = map(int, input().split())
    x1, y1, x2, y2 = map(int, input().split())
    pond = [[[False]*4 for j in range(w+2)] for i in range(h+2)]
    for i in range(1, h+1):
        s = input()
        for j in range(w):
            if s[j] == ".":
                for l in range(4):
                    pond[i][j+1][l] = True
    qs = [queue.Queue(), queue.Queue()]
    for i in range(4):
        pond[x1][y1][i] = False
        qs[0].put([0, x1, y1, i])
    ans = [float("inf")]*4
    p = 0
    while not qs[0].empty() or not qs[1].empty():
        while not qs[p].empty():
            cost, x, y, vec = qs[p].get()
            if x == x2 and y == y2 and ans[vec] > cost:
                ans[vec] = cost
            for i in range(1, k+1):
                nx, ny = calc_next_point(x, y, vec, i)
                if not pond[nx][ny][vec]:
                    break
                ncost = cost + 1
                np = (p+1)%2
                if nx == x2 and ny == y2 and ans[vec] > ncost:
                    ans[vec] = ncost
                for j in range(4):
                    if i == k or j != vec:
                        mx, my = calc_next_point(nx, ny, j, 0)
                        if pond[mx][my][j]:
                            qs[np].put([ncost, mx, my, j])
                pond[nx][ny][vec] = False
        p = (p+1)%2
    if min(ans) == float("inf"):
        print(-1)
    else:
        print(min(ans))

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

def calc_next_point(x, y, vec, dist):
    if vec == 0:
        return x-dist, y
    elif vec == 1:
        return x, y+dist
    elif vec == 2:
        return x+dist, y
    else:
        return x, y-dist

def main():
    h, w, k = map(int, input().split())
    x1, y1, x2, y2 = map(int, input().split())
    pond = [[1]*(w+2) for _ in range(h+2)]
    for i in range(1, h+1):
        s = input()
        for j in range(w):
            if s[j] == ".":
                pond[i][j+1] = 0
    q = queue.Queue()
    row = [[[float("inf")]*4 for j in range(w+2)] for i in range(h+2)]
    fs = [[[True]*4 for j in range(w+2)] for i in range(h+2)]
    rng = [i for i in range(k)]
    for i in range(4):
        row[x1][y1][i] = 0
        fs[x1][y1][i] = False
        nx, ny = calc_next_point(x1, y1, i, 1)
        if pond[nx][ny] == 0:
            row[nx][ny][i] == 1
            fs[nx][ny][i] = False
            q.put([1, nx, ny, i])
    while not q.empty():
        cost, x, y, vec = q.get()
        if x == x2 and y == y2:
            break
        for i in rng:
            nx, ny = calc_next_point(x, y, vec, i)
            if pond[nx][ny] == 1:
                break
            if row[nx][ny][vec] > cost:
                row[nx][ny][vec] = cost
            fs[nx][ny][vec] = False
            for j in range(4):
                mx, my = calc_next_point(nx, ny, j, 1)
                if pond[mx][my] == 1:
                    continue
                if row[mx][my][j] <= cost+1:
                    continue
                if i < k-1 and j == vec:
                    continue
                if row[mx][my][j] > cost+1 and fs[mx][my][j] :
                    row[mx][my][j] = cost+1
                    fs[mx][my][j] = False
                    q.put([cost+1, mx, my, j])
    ans = min(row[x2][y2])
    if ans == float("inf"):
        print(-1)
    else:
        print(ans)

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

def calc_next_point(x, y, vec, dist):
    if vec == 0:
        return x-dist, y
    elif vec == 1:
        return x, y+dist
    elif vec == 2:
        return x+dist, y
    else:
        return x, y-dist

def main():
    h, w, k = map(int, input().split())
    x1, y1, x2, y2 = map(int, input().split())
    pond = [[1]*(w+2) for _ in range(h+2)]
    for i in range(1, h+1):
        s = input()
        for j in range(w):
            if s[j] == ".":
                pond[i][j+1] = 0
    q = queue.Queue()
    row = [[[float("inf")]*4 for j in range(w+2)] for i in range(h+2)]
    fs = [[[True]*4 for j in range(w+2)] for i in range(h+2)]
    for i in range(4):
        row[x1][y1][i] = 0
        fs[x1][y1][i] = False
        nx, ny = calc_next_point(x1, y1, i, 1)
        if pond[nx][ny] == 0:
            row[nx][ny][i] == 1
            fs[nx][ny][i] = False
            q.put([1, nx, ny, i])
    while not q.empty():
        cost, x, y, vec = q.get()
        if x == x2 and y == y2:
            break
        i = 0
        while i < k:
            nx, ny = calc_next_point(x, y, vec, i)
            if pond[nx][ny] == 1:
                break
            if row[nx][ny][vec] > cost:
                row[nx][ny][vec] = cost
            fs[nx][ny][vec] = False
            for j in range(4):
                mx, my = calc_next_point(nx, ny, j, 1)
                if pond[mx][my] == 1:
                    continue
                if row[mx][my][j] <= cost+1:
                    continue
                if i < k-1 and j == vec:
                    continue
                if row[mx][my][j] > cost+1 and fs[mx][my][j] :
                    row[mx][my][j] = cost+1
                    fs[mx][my][j] = False
                    q.put([cost+1, mx, my, j])
            i += 1
    ans = min(row[x2][y2])
    if ans == float("inf"):
        print(-1)
    else:
        print(ans)

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

def calc_next_point(x, y, vec, dist):
    if vec == 0:
        return x-dist, y
    elif vec == 1:
        return x, y+dist
    elif vec == 2:
        return x+dist, y
    else:
        return x, y-dist

def main():
    h, w, k = map(int, input().split())
    x1, y1, x2, y2 = map(int, input().split())
    pond = [[1]*(w+2) for _ in range(h+2)]
    for i in range(1, h+1):
        s = input()
        for j in range(w):
            if s[j] == ".":
                pond[i][j+1] = 0
    q = queue.Queue()
    row = [[[float("inf")]*4 for j in range(w+2)] for i in range(h+2)]
    fs = [[[True]*4 for j in range(w+2)] for i in range(h+2)]
    for i in range(4):
        row[x1][y1][i] = 0
        fs[x1][y1][i] = False
        nx, ny = calc_next_point(x1, y1, i, 1)
        if pond[nx][ny] == 0:
            row[nx][ny][i] == 1
            fs[nx][ny][i] = False
            q.put([1, nx, ny, i])
    while not q.empty():
        cost, x, y, vec = q.get()
        if x == x2 and y == y2:
            break
        for i in range(k):
            nx, ny = calc_next_point(x, y, vec, i)
            if pond[nx][ny] == 1:
                break
            if row[nx][ny][vec] > cost:
                row[nx][ny][vec] = cost
            fs[nx][ny][vec] = False
            for j in range(4):
                mx, my = calc_next_point(nx, ny, j, 1)
                if pond[mx][my] == 1:
                    continue
                if row[mx][my][j] <= cost+1:
                    continue
                if i < k-1 and j == vec:
                    continue
                if row[mx][my][j] > cost+1 and fs[mx][my][j] :
                    row[mx][my][j] = cost+1
                    fs[mx][my][j] = False
                    q.put([cost+1, mx, my, j])
    ans = min(row[x2][y2])
    if ans == float("inf"):
        print(-1)
    else:
        print(ans)

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

def calc_next_point(x, y, vec, dist):
    if vec == 0:
        return x-dist, y
    elif vec == 1:
        return x, y+dist
    elif vec == 2:
        return x+dist, y
    else:
        return x, y-dist

def main():
    h, w, k = map(int, input().split())
    x1, y1, x2, y2 = map(int, input().split())
    pond = [[1]*(w+2) for _ in range(h+2)]
    for i in range(1, h+1):
        s = input()
        for j in range(w):
            if s[j] == ".":
                pond[i][j+1] = 0
    q = queue.Queue()
    row = [[[float("inf")]*4 for j in range(w+2)] for i in range(h+2)]
    for i in range(4):
        row[x1][y1][i] = 0
        nx, ny = calc_next_point(x1, y1, i, 1)
        if pond[nx][ny] == 0:
            row[nx][ny][i] == 1
            q.put([1, nx, ny, i])
    while not q.empty():
        cost, x, y, vec = q.get()
        if x == x2 and y == y2:
            break
        for i in range(k):
            nx, ny = calc_next_point(x, y, vec, i)
            if pond[nx][ny] == 1:
                break
            if row[nx][ny][vec] > cost:
                row[nx][ny][vec] = cost
            for j in range(4):
                mx, my = calc_next_point(nx, ny, j, 1)
                if pond[mx][my] == 1:
                    continue
                if row[mx][my][j] <= cost+1:
                    continue
                if i < k-1 and j == vec:
                    continue
                if row[mx][my][j] > cost+1:
                    row[mx][my][j] = cost+1
                    q.put([cost+1, mx, my, j])
    ans = min(row[x2][y2])
    if ans == float("inf"):
        print(-1)
    else:
        print(ans)

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

def calc_next_point(x, y, vec, dist):
    if vec == 0:
        return x-dist, y
    elif vec == 1:
        return x, y+dist
    elif vec == 2:
        return x+dist, y
    else:
        return x, y-dist

def main():
    h, w, k = map(int, input().split())
    x1, y1, x2, y2 = map(int, input().split())
    pond = [[1]*(w+2) for _ in range(h+2)]
    for i in range(1, h+1):
        s = input()
        for j in range(w):
            if s[j] == ".":
                pond[i][j+1] = 0
    q = queue.Queue()
    row = [[[float("inf")]*4 for j in range(w+2)] for i in range(h+2)]
    for i in range(4):
        row[x1][y1][i] = 0
        nx, ny = calc_next_point(x1, y1, i, 1)
        if pond[nx][ny] == 0:
            row[nx][ny][i] == 1
            q.put([1, nx, ny, i])
    while not q.empty():
        cost, x, y, vec = q.get()
        for i in range(k):
            nx, ny = calc_next_point(x, y, vec, i)
            if pond[nx][ny] == 1:
                break
            row[nx][ny][vec] = cost
            for j in range(4):
                mx, my = calc_next_point(nx, ny, j, 1)
                if pond[mx][my] == 1:
                    continue
                if row[mx][my][j] <= cost+1:
                    continue
                if i < k-1 and j == vec:
                    continue
                if row[mx][my][j] > cost+1:
                    row[mx][my][j] = cost+1
                    q.put([cost+1, mx, my, j])
    ans = min(row[x2][y2])
    if ans == float("inf"):
        print(-1)
    else:
        print(ans)

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

def calc_next_point(x, y, vec, dist):
    if vec == 0:
        return x-dist, y
    elif vec == 1:
        return x, y+dist
    elif vec == 2:
        return x+dist, y
    else:
        return x, y-dist

def main():
    h, w, k = map(int, input().split())
    x1, y1, x2, y2 = map(int, input().split())
    pond = [[1]*(w+2) for _ in range(h+2)]
    for i in range(1, h+1):
        s = input()
        for j in range(w):
            if s[j] == ".":
                pond[i][j+1] = 0
    q = queue.Queue()
    row = [[[float("inf")]*4 for j in range(w+2)] for i in range(h+2)]
    for i in range(4):
        row[x1][y1][i] = 0
        nx, ny = calc_next_point(x1, y1, i, 1)
        if pond[nx][ny] == 0:
            row[nx][ny][i] == 1
            q.put([1, nx, ny, i])
    while not q.empty():
        cost, x, y, vec = q.get()
        for i in range(k):
            nx, ny = calc_next_point(x, y, vec, i)
            if pond[nx][ny] == 1:
                break
            row[nx][ny][vec] = cost
            for j in range(4):
                mx, my = calc_next_point(nx, ny, j, 1)
                if pond[mx][my] == 1:
                    continue
                if i < k-1 and j == vec:
                    continue
                if row[mx][my][j] > cost+1:
                    row[mx][my][j] = cost+1
                    q.put([cost+1, mx, my, j])
    ans = min(row[x2][y2])
    if ans == float("inf"):
        print(-1)
    else:
        print(ans)

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

def main():
    h, w, k = map(int, input().split())
    x1, y1, x2, y2 = map(int, input().split())
    pond = [[1]*(w+2) for _ in range(h+2)]
    for i in range(1, h+1):
        s = input()
        for j in range(w):
            if s[j] == ".":
                pond[i][j+1] = 0
    q = queue.Queue()
    row = [[float("inf")]*(w+2) for _ in range(h+2)]
    row[x1][y1] = 0
    ans = -1
    for i in range(4):
        q.put([0, x1, y1, i])
    while not q.empty():
        cost, x, y, vec = q.get()
        if cost > row[x][y]:
            continue
        if x == x2 and y == y2:
            ans = cost
            break
        i = 1
        while i <= k:
            nx, ny = x, y
            if vec == 0:
                nx -= i
            elif vec == 1:
                ny += i
            elif vec == 2:
                nx += i
            else:
                ny -= i
            if pond[nx][ny] == 1 or row[nx][ny] < cost + 1:
                break
            row[nx][ny] = cost + 1
            if i < k:
                for j in range(4):
                    if j != vec:
                        row[nx][ny] = cost+1
                        q.put([cost+1, nx, ny, j])
            else:
                for j in range(4):
                    row[nx][ny] = cost+1
                    q.put([cost+1, nx, ny, j])
            i += 1
    print(ans)

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

def update(x, y, k, cost, pt, vec, pond, row, hq, fs):
    hpush = heapq.heappush
    i = 1
    while True:
        nx, ny = x, y
        nc = cost + (i+k-1)//k
        if vec == 0:
            nx -= i
        elif vec == 1:
            ny += i
        elif vec == 2:
            nx += i
        else:
            ny -= i
        if pond[nx][ny] == 1:
            return
        if row[nx][ny][vec] > nc:
            row[nx][ny][vec] = nc
            if i == k:
                hpush(hq, [nc, nx, ny, i, vec])
            if fs[nx][ny]:
                for j in range(1, 4):
                    if row[nx][ny][(vec+j)%4] > nc:
                        row[nx][ny][(vec+j)%4] = nc
                        hpush(hq, [nc, nx, ny, k, (vec+j)%4])
                fs[nx][ny] = False
        else:
            return
        i += 1

def main():
    h, w, k = map(int, input().split())
    x1, y1, x2, y2 = map(int, input().split())
    pond = [[1]*(w+2) for _ in range(h+2)]
    for i in range(1, h+1):
        s = input()
        for j in range(w):
            if s[j] == ".":
                pond[i][j+1] = 0
    hq = []
    row = [[[float("inf")]*4 for j in range(w+2)] for i in range(h+2)]
    fs = [[True]*(w+2) for _ in range(h+2)]
    hpop = heapq.heappop
    for i in range(4):
        row[x1][y1][i] = 0
        heapq.heappush(hq, [0, x1, y1, k, i])
    while len(hq) > 0:
        cost, x, y, pt, vec = hpop(hq)
        if cost > row[x][y][vec]:
            continue
        if x == x2 and y == y2:
            break
        update(x, y, k, cost, pt, vec, pond, row, hq, fs)
    ans = min(row[x2][y2])
    if ans == float("inf"):
        print(-1)
    else:
        print(ans)

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

def update(x, y, k, cost, pt, vec, pond, row, q, fs):
    i = 1
    while True:
        nx, ny = x, y
        nc = cost + (i+k-1)//k
        if vec == 0:
            nx -= i
        elif vec == 1:
            ny += i
        elif vec == 2:
            nx += i
        else:
            ny -= i
        if pond[nx][ny] == 1:
            return
        if row[nx][ny][vec] > nc:
            row[nx][ny][vec] = nc
            if i == k:
                q.put([nc, nx, ny, i, vec])
            if fs[nx][ny]:
                for j in range(1, 4):
                    if row[nx][ny][(vec+j)%4] > nc:
                        row[nx][ny][(vec+j)%4] = nc
                        q.put([nc, nx, ny, k, (vec+j)%4])
                fs[nx][ny] = False
        else:
            return
        i += 1

def main():
    h, w, k = map(int, input().split())
    x1, y1, x2, y2 = map(int, input().split())
    pond = [[1]*(w+2) for _ in range(h+2)]
    for i in range(1, h+1):
        s = input()
        for j in range(w):
            if s[j] == ".":
                pond[i][j+1] = 0
    q = queue.Queue()
    row = [[[float("inf")]*4 for j in range(w+2)] for i in range(h+2)]
    fs = [[True]*(w+2) for _ in range(h+2)]
    for i in range(4):
        row[x1][y1][i] = 0
        q.put([0, x1, y1, k, i])
    while not q.empty():
        cost, x, y, pt, vec = q.get()
        if cost > row[x][y][vec]:
            continue
        update(x, y, k, cost, pt, vec, pond, row, q, fs)
    ans = min(row[x2][y2])
    if ans == float("inf"):
        print(-1)
    else:
        print(ans)

if __name__ == "__main__":
    main()