結果

問題 No.2807 Have Another Go (Easy)
ユーザー LyricalMaestro
提出日時 2024-09-11 00:40:08
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 217 ms / 3,000 ms
コード長 3,078 bytes
コンパイル時間 406 ms
コンパイル使用メモリ 82,396 KB
実行使用メモリ 85,648 KB
最終ジャッジ日時 2024-09-11 00:40:17
合計ジャッジ時間 9,445 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

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

## https://yukicoder.me/problems/no/1331
MOD = 998244353
def solve(N, M, dp, c, total_value):
    dp1 = {}
    for j in range(1, 6):
        if c - j < 0:
            continue
        dp1[c - j] = dp[c - j]
    
    dp2 = {}
    for j in range(1, 6):
        if (c - j) in dp1:
            for k in range(1, 7):
                if (c - j + k) > c:
                    if (c - j + k) not in dp2:
                        dp2[(c - j + k)] = 0
                    dp2[(c - j + k)] += dp1[c - j]
                    dp2[(c - j + k)] %= MOD
    dp3 = {}
    for key, value in dp2.items():
        for j in range(1, 6):
            if N + c - j < key:
                continue
            if (N + c - j) not in dp3:
                dp3[(N + c - j)] = 0
            dp3[(N + c - j)] += (value * dp[(N + c - j - key)])% MOD
            dp3[(N + c - j)] %= MOD
    
    dp4 = {}
    for j in range(1, 6):
        if (N + c - j) in dp3:
            for k in range(1, 7):
                if (N + c - j + k) >= N * M:
                    continue
                elif (N + c - j + k) > N + c:
                    if (N + c - j + k) not in dp4:
                        dp4[(N + c - j + k)] = 0
                    dp4[(N + c - j + k)] += dp3[N + c - j]
                    dp4[(N + c - j + k)] %= MOD
    dp5 = {}
    for key, value in dp4.items():
        for j in range(1, 7):
            if 2 * N - j < key:
                continue
            if (2 * N - j) not in dp5:
                dp5[(2 * N - j)] = 0
            dp5[(2 * N - j)] += (value * dp[(2 * N - j - key)])% MOD
            dp5[2 * N - j] %= MOD
    answer = 0
    for key, value in dp5.items():
        for j in range(1, 7):
            if key + j >= N * M:
                answer += value
                answer %= MOD
    for key, value in dp3.items():
        for j in range(1, 7):
            if key + j >= N * M:
                answer += value
                answer %= MOD
    print((total_value - answer) % MOD)
def solve2(N, M, c, total_value):
    dp = [0] * (N + M + 6)
    max_x = N * M + 6
    dp = [0] * max_x
    dp[0] = 1
    for i in range(N * M):
        for j in range(1, 7):            
            if (i + j < N * M) and (i + j) % N == c:
                continue
            dp[i + j] += dp[i]
            dp[i + j] %= MOD
    total_value2 = 0
    for j in range(6):
        total_value2 += dp[N * M + j]
        total_value2 %= MOD
    print((total_value - total_value2) % MOD)
def main():
    N, M, k = map(int, input().split())
    C = list(map(int, input().split()))
    # 何も障害がない場合の回答を用意
    max_x = N * M + 6
    dp = [0] * max_x
    dp[0] = 1
    for i in range(N * M):
        for j in range(1, 7):
            dp[i + j] += dp[i]
            dp[i + j] %= MOD
    total_value = 0
    for j in range(6):
        total_value += dp[N * M + j]
        total_value %= MOD
    # 各C_iについて回答を用意
    for c in C:
        solve(N, M, dp, c, total_value)
#        solve2(N, M, c, total_value)
if __name__ == "__main__":
    main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0