結果
問題 | No.2096 Rage With Our Friends |
ユーザー | tamato |
提出日時 | 2022-10-07 22:34:33 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,826 bytes |
コンパイル時間 | 412 ms |
コンパイル使用メモリ | 87,308 KB |
実行使用メモリ | 309,804 KB |
最終ジャッジ日時 | 2023-09-03 13:54:32 |
合計ジャッジ時間 | 9,170 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 95 ms
72,016 KB |
testcase_01 | AC | 98 ms
71,688 KB |
testcase_02 | AC | 95 ms
71,740 KB |
testcase_03 | AC | 98 ms
71,468 KB |
testcase_04 | AC | 94 ms
71,632 KB |
testcase_05 | AC | 93 ms
71,704 KB |
testcase_06 | AC | 94 ms
71,684 KB |
testcase_07 | AC | 97 ms
71,680 KB |
testcase_08 | AC | 109 ms
76,536 KB |
testcase_09 | AC | 101 ms
76,372 KB |
testcase_10 | AC | 100 ms
72,340 KB |
testcase_11 | AC | 292 ms
116,764 KB |
testcase_12 | TLE | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
ソースコード
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)) 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)) 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)) 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)) # 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)) 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)) 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()