結果

問題 No.3071 Double Speedrun
ユーザー detteiuu
提出日時 2025-03-21 22:41:33
言語 PyPy3
(7.3.15)
結果
MLE  
実行時間 -
コード長 1,328 bytes
コンパイル時間 355 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 724,908 KB
最終ジャッジ日時 2025-03-21 22:41:47
合計ジャッジ時間 8,061 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 1 MLE * 1 -- * 12
権限があれば一括ダウンロードができます

ソースコード

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

from collections import defaultdict
H, W = map(int, input().split())
S = [list(input()) for _ in range(H)]
MOD = 998244353
def IDX(h1, w1, h2, w2):
    return w1+h1*W+w2*H*W+h2*W*H*W
def IDXR(n):
    return n%W, n//W%H, n//(H*W)%W, n//(W*H*W)
dp = [defaultdict(int) for _ in range(H+W-1)]
dp[1][IDX(1, 0, 0, 1)] = 1
for i in range(H+W-2):
    for key in dp[i].keys():
        w1, h1, w2, h2 = IDXR(key)
        if w1+1 < W and w2+1 < W and S[h1][w1+1] == "." and S[h2][w2+1] == ".":
            dp[i+1][IDX(h1, w1+1, h2, w2+1)] += dp[i][key]
            dp[i+1][IDX(h1, w1+1, h2, w2+1)] %= MOD
        if h1+1 < H and h2+1 < H and S[h1+1][w1] == "." and S[h2+1][w2] == ".":
            dp[i+1][IDX(h1+1, w1, h2+1, w2)] += dp[i][key]
            dp[i+1][IDX(h1+1, w1, h2+1, w2)] %= MOD
        if w1+1 < W and h2+1 < H and S[h1][w1+1] == "." and S[h2+1][w2] == "." and ([h1, w1+1] == [H-1, W-1] or [h1, w1+1] != [h2+1, w2]):
            dp[i+1][IDX(h1, w1+1, h2+1, w2)] += dp[i][key]
            dp[i+1][IDX(h1, w1+1, h2+1, w2)] %= MOD
        if h1+1 < H and w2+1 < W and S[h1+1][w1] == "." and S[h2][w2+1] == "." and ([h1+1, w1] == [H-1, W-1] or [h1+1, w1] != [h2, w2+1]):
            dp[i+1][IDX(h1+1, w1, h2, w2+1)] += dp[i][key]
            dp[i+1][IDX(h1+1, w1, h2, w2+1)] %= MOD
print(dp[-1][IDX(H-1, W-1, H-1, W-1)])
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0