結果

問題 No.424 立体迷路
ユーザー MitI_7MitI_7
提出日時 2016-10-02 15:11:13
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
AC  
実行時間 41 ms / 2,000 ms
コード長 1,590 bytes
コンパイル時間 74 ms
コンパイル使用メモリ 12,672 KB
実行使用メモリ 11,392 KB
最終ジャッジ日時 2024-07-05 07:11:07
合計ジャッジ時間 1,587 ms
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 5
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import queue
dy = [0, -1, 0, 1]
dx = [1, 0, -1, 0]
def bfs(sy, sx, gy, gx, field):
q = queue.Queue()
q.put((sy, sx))
used = [[False] * len(field[0]) for i in range(len(field))]
used[sy][sx] = True
while not q.empty():
now_y, now_x = q.get(0)
now_h = field[now_y][now_x]
if (now_y, now_x) == (gy, gx):
break
for i in range(len(dy)):
next_y, next_x = now_y + dy[i], now_x + dx[i]
if 0 <= next_y < len(field) and 0 <= next_x < len(field[0]) and not used[next_y][next_x]:
next_h = field[next_y][next_x]
if abs(now_h - next_h) <= 1:
q.put((next_y, next_x))
used[next_y][next_x] = True
for i in range(len(dy)):
next_y, next_x = now_y + dy[i] * 2, now_x + dx[i] * 2
m_y, m_x = now_y + dy[i], now_x + dx[i]
if 0 <= next_y < len(field) and 0 <= next_x < len(field[0]) and not used[next_y][next_x]:
next_h = field[next_y][next_x]
m_h = field[m_y][m_x]
if now_h == next_h and now_h >= m_h:
q.put((next_y, next_x))
used[next_y][next_x] = True
return used[gy][gx]
def main():
h, w = map(int, input().split())
sx, sy, gx, gy = map(int, input().split())
sx, sy, gx, gy = sx - 1, sy - 1, gx - 1, gy - 1
field = []
for _ in range(h):
field.append(list(map(int, input())))
print("YES" if bfs(sx, sy, gx, gy, field) else "NO")
if __name__ == '__main__':
main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0