結果

問題 No.2328 Build Walls
ユーザー cozy_saunacozy_sauna
提出日時 2023-05-28 14:23:56
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,946 bytes
コンパイル時間 303 ms
コンパイル使用メモリ 82,036 KB
実行使用メモリ 101,492 KB
最終ジャッジ日時 2024-06-08 05:20:10
合計ジャッジ時間 11,238 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 123 ms
88,896 KB
testcase_01 AC 122 ms
89,168 KB
testcase_02 AC 121 ms
89,320 KB
testcase_03 AC 124 ms
89,036 KB
testcase_04 AC 132 ms
89,048 KB
testcase_05 AC 129 ms
89,028 KB
testcase_06 AC 125 ms
89,116 KB
testcase_07 AC 124 ms
89,228 KB
testcase_08 AC 128 ms
89,188 KB
testcase_09 AC 131 ms
89,308 KB
testcase_10 AC 130 ms
88,960 KB
testcase_11 AC 131 ms
89,264 KB
testcase_12 AC 131 ms
89,008 KB
testcase_13 AC 219 ms
95,868 KB
testcase_14 WA -
testcase_15 AC 258 ms
94,164 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 AC 152 ms
90,596 KB
testcase_20 WA -
testcase_21 AC 174 ms
92,264 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 AC 194 ms
94,924 KB
testcase_29 WA -
testcase_30 AC 259 ms
100,744 KB
testcase_31 AC 241 ms
101,024 KB
testcase_32 WA -
testcase_33 AC 1,788 ms
100,668 KB
testcase_34 AC 262 ms
100,924 KB
testcase_35 AC 336 ms
101,464 KB
testcase_36 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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(1, H - 1):
    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])

        cost = 0
        ii = i
        while ii - 1 > 0 and A[ii - 1][j] != -1:
            ii -= 1
            cost += A[ii][j]
            dp[ii][j] = min(dp[ii][j], cost + dp[i][j])

        cost = 0
        ii = i 
        while ii + 1 < H - 1 and A[ii + 1][j] != -1:
            ii += 1
            cost += A[ii][j]
            dp[ii][j] = min(dp[ii][j], cost + dp[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)
0