結果
問題 | No.424 立体迷路 |
ユーザー | McGregorsh |
提出日時 | 2022-10-27 23:37:38 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 274 ms / 2,000 ms |
コード長 | 2,900 bytes |
コンパイル時間 | 398 ms |
コンパイル使用メモリ | 86,868 KB |
実行使用メモリ | 97,828 KB |
最終ジャッジ日時 | 2023-09-18 17:57:50 |
合計ジャッジ時間 | 8,346 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 240 ms
92,784 KB |
testcase_01 | AC | 241 ms
92,772 KB |
testcase_02 | AC | 242 ms
92,616 KB |
testcase_03 | AC | 243 ms
92,840 KB |
testcase_04 | AC | 238 ms
92,816 KB |
testcase_05 | AC | 241 ms
92,904 KB |
testcase_06 | AC | 241 ms
92,496 KB |
testcase_07 | AC | 241 ms
92,852 KB |
testcase_08 | AC | 241 ms
92,920 KB |
testcase_09 | AC | 238 ms
92,640 KB |
testcase_10 | AC | 238 ms
92,856 KB |
testcase_11 | AC | 243 ms
92,772 KB |
testcase_12 | AC | 240 ms
92,848 KB |
testcase_13 | AC | 239 ms
92,880 KB |
testcase_14 | AC | 242 ms
92,848 KB |
testcase_15 | AC | 241 ms
92,776 KB |
testcase_16 | AC | 240 ms
92,808 KB |
testcase_17 | AC | 257 ms
93,760 KB |
testcase_18 | AC | 240 ms
93,716 KB |
testcase_19 | AC | 245 ms
93,588 KB |
testcase_20 | AC | 245 ms
93,532 KB |
testcase_21 | AC | 242 ms
92,660 KB |
testcase_22 | AC | 242 ms
92,888 KB |
testcase_23 | AC | 241 ms
92,612 KB |
testcase_24 | AC | 255 ms
97,008 KB |
testcase_25 | AC | 274 ms
97,828 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 ###関数コピーしたか?### def main(): H, W = i_map() sx, sy, gx, gy = i_map() sx -= 1 sy -= 1 gx -= 1 gy -= 1 nums = [input() for i in range(H)] A = [] for i in range(H): B = [] for j in range(W): B.append(int(nums[i][j])) A.append(B) def dfs(x, y, juge): if x == gx and y == gy: print('YES') exit() juge[x][y] = True move = [[0, 1], [0, -1], [1, 0], [-1, 0]] for a, b in move: xx = x + a yy = y + b if not (0<=xx<H and 0<=yy<W): continue if juge[xx][yy]: continue if abs(A[x][y] - A[xx][yy]) >= 2: continue dfs(xx, yy, juge) move1 = [[0, 2], [0, -2], [2, 0], [-2, 0]] for c, d in move1: xxx = x + c yyy = y + d if not (0<=xxx<H and 0<=yyy<W): continue if juge[xxx][yyy]: continue if abs(A[x][y] - A[xxx][yyy]) > 0: continue if c == 0 and d == 2: if A[xxx][yyy-1] < A[x][y]: dfs(xxx, yyy, juge) elif c == 0 and d == -2: if A[xxx][yyy+1] < A[x][y]: dfs(xxx, yyy, juge) elif c == 2 and d == 0: if A[xxx-1][yyy] < A[x][y]: dfs(xxx, yyy, juge) elif c == -2 and d == 0: if A[xxx+1][yyy] < A[x][y]: dfs(xxx, yyy, juge) juge = [[False] * W for i in range(H)] dfs(sx, sy, juge) print('NO') if __name__ == '__main__': main()