結果
問題 | No.2657 Falling Block Game |
ユーザー | mkawa2 |
提出日時 | 2024-03-01 23:06:55 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,290 ms / 2,000 ms |
コード長 | 2,022 bytes |
コンパイル時間 | 166 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 123,356 KB |
最終ジャッジ日時 | 2024-03-01 23:07:27 |
合計ジャッジ時間 | 29,593 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
53,460 KB |
testcase_01 | AC | 41 ms
53,460 KB |
testcase_02 | AC | 38 ms
53,460 KB |
testcase_03 | AC | 43 ms
53,460 KB |
testcase_04 | AC | 338 ms
84,020 KB |
testcase_05 | AC | 670 ms
123,356 KB |
testcase_06 | AC | 293 ms
114,416 KB |
testcase_07 | AC | 161 ms
88,336 KB |
testcase_08 | AC | 190 ms
81,208 KB |
testcase_09 | AC | 460 ms
88,140 KB |
testcase_10 | AC | 327 ms
112,904 KB |
testcase_11 | AC | 330 ms
108,164 KB |
testcase_12 | AC | 350 ms
109,988 KB |
testcase_13 | AC | 322 ms
105,768 KB |
testcase_14 | AC | 337 ms
108,300 KB |
testcase_15 | AC | 344 ms
110,860 KB |
testcase_16 | AC | 390 ms
103,092 KB |
testcase_17 | AC | 351 ms
105,488 KB |
testcase_18 | AC | 340 ms
110,688 KB |
testcase_19 | AC | 364 ms
110,376 KB |
testcase_20 | AC | 1,290 ms
92,928 KB |
testcase_21 | AC | 1,039 ms
88,588 KB |
testcase_22 | AC | 798 ms
85,472 KB |
testcase_23 | AC | 910 ms
87,548 KB |
testcase_24 | AC | 1,007 ms
89,312 KB |
testcase_25 | AC | 985 ms
87,128 KB |
testcase_26 | AC | 1,265 ms
90,544 KB |
testcase_27 | AC | 1,073 ms
88,804 KB |
testcase_28 | AC | 996 ms
87,908 KB |
testcase_29 | AC | 942 ms
87,088 KB |
testcase_30 | AC | 878 ms
92,704 KB |
testcase_31 | AC | 1,004 ms
93,460 KB |
testcase_32 | AC | 1,026 ms
93,436 KB |
testcase_33 | AC | 999 ms
93,204 KB |
testcase_34 | AC | 1,034 ms
94,216 KB |
testcase_35 | AC | 986 ms
94,920 KB |
testcase_36 | AC | 1,030 ms
93,620 KB |
testcase_37 | AC | 1,053 ms
92,956 KB |
testcase_38 | AC | 992 ms
93,728 KB |
testcase_39 | AC | 936 ms
92,540 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) # sys.set_int_max_str_digits(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] # inf = -1-(-1 << 31) inf = -1-(-1 << 62) # md = 10**9+7 md = 998244353 from heapq import * h,w=LI() ss=[[c=="#" for c in SI()] for _ in range(h)] dp=[0]*w for i in range(h-2,-1,-1): pre,dp=dp,dp[:] mxj=-inf hp=[] ja=[] rem=[] for j in range(w): if ss[i][j]: dp[j]=inf mxj = -inf hp = [] ja = [] rem = [] continue while ja and ja[0][0]<j: d,pj=heappop(ja) mxj=max(mxj,pj) heappush(rem,d-pj) while rem and rem[0]==hp[0]: heappop(rem) heappop(hp) dp[j]=min(dp[j],j-mxj) if hp:dp[j]=min(dp[j],hp[0]) heappush(ja,(j+pre[j],j)) heappush(hp,pre[j]) mnj=inf hp=[] ja=[] rem=[] for j in range(w)[::-1]: if ss[i][j]: mnj = inf hp = [] ja = [] rem = [] continue while ja and -ja[0][0]>j: d,pj=heappop(ja) mnj=min(mnj,pj) heappush(rem,d+pj) while rem and rem[0]==hp[0]: heappop(rem) heappop(hp) dp[j]=min(dp[j],mnj-j) if hp:dp[j]=min(dp[j],hp[0]) heappush(ja,(-j+pre[j],j)) heappush(hp,pre[j]) pDB(dp) print(*dp,sep="\n")