結果

問題 No.2096 Rage With Our Friends
ユーザー tamatotamato
提出日時 2022-10-07 22:47:11
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 4,408 bytes
コンパイル時間 195 ms
コンパイル使用メモリ 82,380 KB
実行使用メモリ 160,784 KB
最終ジャッジ日時 2024-06-12 20:07:40
合計ジャッジ時間 21,162 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 37 ms
55,656 KB
testcase_01 AC 37 ms
56,440 KB
testcase_02 AC 36 ms
56,216 KB
testcase_03 AC 40 ms
56,008 KB
testcase_04 AC 37 ms
55,956 KB
testcase_05 AC 38 ms
56,496 KB
testcase_06 AC 39 ms
54,952 KB
testcase_07 AC 42 ms
56,640 KB
testcase_08 AC 45 ms
61,324 KB
testcase_09 AC 42 ms
61,680 KB
testcase_10 AC 39 ms
56,620 KB
testcase_11 AC 236 ms
114,840 KB
testcase_12 AC 412 ms
147,840 KB
testcase_13 AC 1,292 ms
127,428 KB
testcase_14 AC 1,029 ms
122,812 KB
testcase_15 AC 236 ms
114,964 KB
testcase_16 AC 45 ms
61,548 KB
testcase_17 AC 1,487 ms
146,296 KB
testcase_18 AC 47 ms
63,088 KB
testcase_19 AC 44 ms
61,428 KB
testcase_20 AC 44 ms
62,976 KB
testcase_21 WA -
testcase_22 AC 3,331 ms
160,784 KB
testcase_23 WA -
testcase_24 AC 2,553 ms
133,888 KB
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 AC 1,031 ms
94,536 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

mod = 998244353


def main():
    import sys
    from bisect import bisect_left
    from collections import deque
    input = sys.stdin.readline

    H, W = map(int, input().split())
    sh, sw, gh, gw = map(int, input().split())
    gh -= 1
    gw -= 1
    G = []
    for _ in range(H):
        G.append(input().rstrip('\n'))

    R = []
    for w in range(W):
        col = []
        for h in range(H):
            if G[h][w] == ".":
                col.append(h)
        R.append(col)

    que = deque()
    seen = [[-1] * W for _ in range(H)]
    for w in range(W):
        que.append((0, 0, w))
        seen[0][w] = 0
    while que:
        x, h, w = que.popleft()
        if seen[h][w] < x:
            continue
        #print(x, h, w)

        # normal jump
        if w - 1 >= 0:
            j = bisect_left(R[w - 1], h+2) - 1
            h_back = R[w - 1][j]
            if seen[h_back][w - 1] == -1 or seen[h_back][w - 1] > x:
                seen[h_back][w - 1] = x
                que.appendleft((x, h_back, w - 1))
                for j_ in range(j - 1, -1, -1):
                    h_ = R[w - 1][j_]
                    if seen[h_][w - 1] == -1 or seen[h_][w - 1] > x:
                        seen[h_][w - 1] = x
                    else:
                        break
            if w - 2 >= 0:
                h_new = h_back + max(0, h - h_back) // 2 + 1
                jj = bisect_left(R[w - 2], h_new + 1) - 1
                hh = R[w - 2][jj]
                if seen[hh][w - 2] == -1 or seen[hh][w - 2] > x:
                    seen[hh][w - 2] = x
                    que.appendleft((x, hh, w - 2))
                    for j_ in range(jj - 1, -1, -1):
                        h_ = R[w - 2][j_]
                        if seen[h_][w - 2] == -1 or seen[h_][w - 2] > x:
                            seen[h_][w - 2] = x
                        else:
                            break
        if w + 1 < W:
            j = bisect_left(R[w + 1], h+2) - 1
            h_back = R[w + 1][j]
            if seen[h_back][w + 1] == -1 or seen[h_back][w + 1] > x:
                seen[h_back][w + 1] = x
                que.appendleft((x, h_back, w + 1))
                for j_ in range(j - 1, -1, -1):
                    h_ = R[w + 1][j_]
                    if seen[h_][w + 1] == -1 or seen[h_][w + 1] > x:
                        seen[h_][w + 1] = x
                    else:
                        break
            if w + 2 < W:
                h_new = h_back + max(0, h - h_back) // 2 + 1
                jj = bisect_left(R[w + 2], h_new + 1) - 1
                hh = R[w + 2][jj]
                if seen[hh][w + 2] == -1 or seen[hh][w + 2] > x:
                    seen[hh][w + 2] = x
                    que.appendleft((x, hh, w + 2))
                    for j_ in range(jj - 1, -1, -1):
                        h_ = R[w + 2][j_]
                        if seen[h_][w + 2] == -1 or seen[h_][w + 2] > x:
                            seen[h_][w + 2] = x
                        else:
                            break

        # super jump
        if w - 2 >= 0:
            h_new = h + 1
            jj = bisect_left(R[w - 2], h_new + 1) - 1
            hh = R[w - 2][jj]
            if seen[hh][w - 2] == -1:
                seen[hh][w - 2] = x + 1
                que.append((x + 1, hh, w - 2))
                for j_ in range(jj - 1, -1, -1):
                    h_ = R[w - 2][j_]
                    if seen[h_][w - 2] == -1 or seen[h_][w - 2] > x:
                        seen[h_][w - 2] = x
                    else:
                        break
        if w + 2 < W:
            h_new = h + 1
            jj = bisect_left(R[w + 2], h_new + 1) - 1
            hh = R[w + 2][jj]
            if seen[hh][w + 2] == -1:
                seen[hh][w + 2] = x + 1
                que.append((x + 1, hh, w + 2))
                for j_ in range(jj - 1, -1, -1):
                    h_ = R[w + 2][j_]
                    if seen[h_][w + 2] == -1 or seen[h_][w + 2] > x:
                        seen[h_][w + 2] = x
                    else:
                        break
        h_new = h + 1
        if h_new < H:
            if G[h_new][w] == ".":
                if seen[h_new][w] == -1:
                    seen[h_new][w] = x + 1
                    que.append((x + 1, h_new, w))

    print(seen[gh][gw])
    #for h in range(H):
    #    print(*seen[h])


if __name__ == '__main__':
    main()
0