結果
問題 | No.1513 simple 門松列 problem |
ユーザー | wolgnik |
提出日時 | 2021-05-21 22:00:06 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 850 ms / 3,000 ms |
コード長 | 1,891 bytes |
コンパイル時間 | 384 ms |
コンパイル使用メモリ | 82,196 KB |
実行使用メモリ | 98,892 KB |
最終ジャッジ日時 | 2024-04-18 15:25:18 |
合計ジャッジ時間 | 6,461 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
52,388 KB |
testcase_01 | AC | 45 ms
54,128 KB |
testcase_02 | AC | 850 ms
98,888 KB |
testcase_03 | AC | 63 ms
70,220 KB |
testcase_04 | AC | 41 ms
54,484 KB |
testcase_05 | AC | 75 ms
74,492 KB |
testcase_06 | AC | 70 ms
72,364 KB |
testcase_07 | AC | 52 ms
64,200 KB |
testcase_08 | AC | 91 ms
75,976 KB |
testcase_09 | AC | 41 ms
53,548 KB |
testcase_10 | AC | 40 ms
53,656 KB |
testcase_11 | AC | 42 ms
53,688 KB |
testcase_12 | AC | 40 ms
52,456 KB |
testcase_13 | AC | 44 ms
53,720 KB |
testcase_14 | AC | 780 ms
98,728 KB |
testcase_15 | AC | 823 ms
98,232 KB |
testcase_16 | AC | 829 ms
98,892 KB |
testcase_17 | AC | 568 ms
89,420 KB |
testcase_18 | AC | 276 ms
83,848 KB |
testcase_19 | AC | 103 ms
76,800 KB |
testcase_20 | AC | 206 ms
78,924 KB |
ソースコード
import sys input = sys.stdin.readline N, K = map(int, input().split()) mod = 998244353 dp = [[0] * K for _ in range(K)] dp2 = [[0] * K for _ in range(K)] for i in range(K): for j in range(K): if i != j: dp[i][j] = 1 dp2[i][j] = i + j #print(dp) for _ in range(N - 2): newdp = [[0] * K for _ in range(K)] newdp2 = [[0] * K for _ in range(K)] for i in range(K): for j in range(i): newdp[j][j + 1] += dp[i][j] newdp[j][j + 1] %= mod newdp[j][i] -= dp[i][j] newdp[j][i] %= mod if i + 1 < K: newdp[j][i + 1] += dp[i][j] newdp[j][i + 1] %= mod newdp2[j][j + 1] += dp2[i][j] newdp2[j][j + 1] %= mod newdp2[j][i] -= dp2[i][j] newdp2[j][i] %= mod if i + 1 < K: newdp2[j][i + 1] += dp2[i][j] newdp2[j][i + 1] %= mod for j in range(i + 1, K): newdp[j][0] += dp[i][j] newdp[j][0] %= mod newdp[j][i] -= dp[i][j] newdp[j][i] %= mod if i + 1 < K: newdp[j][i + 1] += dp[i][j] newdp[j][i + 1] %= mod newdp[j][j] -= dp[i][j] newdp[j][j] %= mod newdp2[j][0] += dp2[i][j] newdp2[j][0] %= mod newdp2[j][i] -= dp2[i][j] newdp2[j][i] %= mod if i + 1 < K: newdp2[j][i + 1] += dp2[i][j] newdp2[j][i + 1] %= mod newdp2[j][j] -= dp2[i][j] newdp2[j][j] %= mod for i in range(K): for j in range(K - 1): newdp[i][j + 1] += newdp[i][j] newdp[i][j + 1] %= mod newdp2[i][j + 1] += newdp2[i][j] newdp2[i][j + 1] %= mod for i in range(K): for j in range(K): newdp2[i][j] += newdp[i][j] * j newdp2[i][j] %= mod dp = [a[: ] for a in newdp] dp2 = [a[: ] for a in newdp2] res1 = 0 for i in range(K): res1 += sum(dp[i]) res1 %= mod res2 = 0 for i in range(K): res2 += sum(dp2[i]) res2 %= mod print(res1, res2)