結果
問題 | No.2328 Build Walls |
ユーザー | cozy_sauna |
提出日時 | 2023-05-28 14:15:33 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,560 bytes |
コンパイル時間 | 520 ms |
コンパイル使用メモリ | 87,060 KB |
実行使用メモリ | 104,708 KB |
最終ジャッジ日時 | 2023-08-27 09:22:55 |
合計ジャッジ時間 | 13,925 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 259 ms
92,044 KB |
testcase_01 | AC | 255 ms
92,140 KB |
testcase_02 | AC | 254 ms
92,012 KB |
testcase_03 | AC | 253 ms
92,044 KB |
testcase_04 | AC | 257 ms
91,948 KB |
testcase_05 | AC | 257 ms
91,744 KB |
testcase_06 | AC | 256 ms
92,068 KB |
testcase_07 | AC | 257 ms
92,144 KB |
testcase_08 | AC | 259 ms
92,116 KB |
testcase_09 | AC | 257 ms
92,052 KB |
testcase_10 | AC | 255 ms
92,048 KB |
testcase_11 | AC | 258 ms
91,856 KB |
testcase_12 | AC | 257 ms
91,976 KB |
testcase_13 | AC | 325 ms
97,448 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 268 ms
95,292 KB |
testcase_20 | WA | - |
testcase_21 | AC | 295 ms
97,328 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 332 ms
104,708 KB |
testcase_29 | WA | - |
testcase_30 | AC | 368 ms
103,820 KB |
testcase_31 | AC | 353 ms
104,396 KB |
testcase_32 | WA | - |
testcase_33 | AC | 358 ms
101,448 KB |
testcase_34 | AC | 361 ms
103,940 KB |
testcase_35 | AC | 369 ms
102,360 KB |
testcase_36 | WA | - |
ソースコード
from sys import setrecursionlimit, stdin from collections import defaultdict, deque, Counter from itertools import permutations, combinations, product from functools import lru_cache from bisect import bisect_left, bisect_right from heapq import heappush, heappop from copy import copy, deepcopy from decimal import Decimal from random import random, randrange # from pypyjit import set_param # set_param('max_unroll_recursion=-1') setrecursionlimit(1 << 20) readline = stdin.readline INF = 10 ** 18 MOD = 998244353 # MOD = 1000000007 ALP = 26 ''' Input ''' def I(): return int(readline()) def ST(): return readline()[:-1] def LI(): return list(map(int, readline().split())) def LII(): return list(map(lambda x: int(x) - 1, readline().split())) def LF(x, func): return [func() for _ in [0] * x] def SPI(): return map(int, readline().split()) def SPII(): return map(lambda x: int(x) - 1, readline().split()) def FIE(x): return [readline()[:-1] for _ in [0] * x] ''' Array ''' def cmin(dp, i, x): if x < dp[i]: dp[i] = x def cmax(dp, i, x): if x > dp[i]: dp[i] = x ''' Alphabet ''' def alp_a_to_i(s): return ord(s) - ord('a') def alp_A_to_i(s): return ord(s) - ord('A') def alp_i_to_a(i): return chr(ord('a') + i) def alp_i_to_A(i): return chr(ord('A') + i) ''' Other''' def nynx(y, x, H, W): return [(y + dy, x + dx) for dy, dx in [(-1, 0), (1, 0), (0, -1), (0, 1)] if 0 <= y + dy < H and 0 <= x + dx < W] def gen(x, *args): if len(args) == 1: return [x] * args[0] if len(args) == 2: return [[x] * args[1] for _ in [0] * args[0]] if len(args) == 3: return [[[x] * args[2] for _ in [0] * args[1]] for _ in [0] * args[0]] if len(args) == 4: return [[[[x] * args[3] for _ in [0] * args[2]] for _ in [0] * args[1]] for _ in [0] * args[0]] ''' Output ''' def pprint(E): print() for e in E: print(e) def Yes(): print("Yes") def No(): print("No") def YES(): print("YES") def NO(): print("NO") def yn(x): print("Yes" if x else "No") def YN(x): print("YES" if x else "NO") ############################################################################################### H, W = SPI() A = LF(H - 2, LI) A = [[-1] * W] + A + [[-1] * W] dp = gen(INF, H, W) for i in range(H): if A[i][0] != -1: dp[i][0] = A[i][0] for j in range(1, W): for i in range(1, H - 1): if A[i][j] == -1: continue dp[i][j] = min(dp[i][j], min(dp[i + 1][j - 1], dp[i][j - 1], dp[i - 1][j - 1]) + A[i][j]) # pprint(A) # pprint(dp) ans = INF for i in range(H): ans = min(ans, dp[i][W - 1]) if ans == INF: ans = -1 print(ans)