結果

問題 No.424 立体迷路
ユーザー Coki628Coki628
提出日時 2020-09-23 12:53:56
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 65 ms / 2,000 ms
コード長 2,426 bytes
コンパイル時間 164 ms
コンパイル使用メモリ 82,800 KB
実行使用メモリ 68,864 KB
最終ジャッジ日時 2024-06-27 21:44:03
合計ジャッジ時間 2,428 ms
ジャッジサーバーID
(参考情報)
judge4 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 5
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

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

import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c for j in range(b)] for i in range(a)]
def list3d(a, b, c, d): return [[[d for k in range(c)] for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e for l in range(d)] for k in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10**9)
INF = 10**18
MOD = 10**9 + 7
EPS = 10**-10
def build_grid(H, W, intv, _type, space=False, padding=True):
#
if space:
_input = lambda: input().split()
else:
_input = lambda: input()
_list = lambda: list(map(_type, _input()))
#
if padding:
offset = 1
else:
offset = 0
grid = list2d(H+offset*2, W+offset*2, intv)
for i in range(offset, H+offset):
row = _list()
for j in range(offset, W+offset):
grid[i][j] = row[j-offset]
return grid
def bfs(grid, src):
""" BFS() """
from collections import deque
H, W = len(grid), len(grid[0])
directions = ((1, 0), (-1, 0), (0, 1), (0, -1))
dist = list2d(H, W, 0)
que = deque()
for h, w in src:
que.append((h, w))
dist[h][w] = 0
while que:
h, w = que.popleft()
for dh, dw in directions:
nh = h + dh
nw = w + dw
if grid[nh][nw] > grid[h][w]+1 or grid[nh][nw] < grid[h][w]-1:
continue
if dist[nh][nw]:
continue
dist[nh][nw] = 1
que.append((nh, nw))
for dh, dw in directions:
nh = h + dh
nw = w + dw
if grid[nh][nw] > grid[h][w]:
continue
nh += dh
nw += dw
if grid[nh][nw] != grid[h][w]:
continue
if dist[nh][nw]:
continue
dist[nh][nw] = 1
que.append((nh, nw))
return dist
H, W = MAP()
sh, sw, gh, gw = MAP()
grid = build_grid(H, W, 20, int)
res = bfs(grid, [(sh, sw)])
if res[gh][gw]:
YES()
else:
NO()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0