結果
問題 | No.1513 simple 門松列 problem |
ユーザー | wolgnik |
提出日時 | 2021-05-21 22:00:06 |
言語 | PyPy3 (7.3.13) |
結果 |
AC
|
実行時間 | 890 ms / 3,000 ms |
コード長 | 1,891 bytes |
コンパイル時間 | 1,879 ms |
コンパイル使用メモリ | 86,504 KB |
実行使用メモリ | 98,752 KB |
最終ジャッジ日時 | 2023-07-31 15:25:22 |
合計ジャッジ時間 | 8,314 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 73 ms
71,148 KB |
testcase_01 | AC | 76 ms
71,336 KB |
testcase_02 | AC | 890 ms
98,752 KB |
testcase_03 | AC | 101 ms
76,864 KB |
testcase_04 | AC | 78 ms
71,144 KB |
testcase_05 | AC | 113 ms
77,680 KB |
testcase_06 | AC | 105 ms
77,240 KB |
testcase_07 | AC | 86 ms
76,072 KB |
testcase_08 | AC | 123 ms
77,788 KB |
testcase_09 | AC | 72 ms
71,340 KB |
testcase_10 | AC | 73 ms
71,240 KB |
testcase_11 | AC | 73 ms
71,412 KB |
testcase_12 | AC | 75 ms
71,104 KB |
testcase_13 | AC | 77 ms
71,460 KB |
testcase_14 | AC | 882 ms
98,536 KB |
testcase_15 | AC | 890 ms
98,636 KB |
testcase_16 | AC | 886 ms
98,332 KB |
testcase_17 | AC | 605 ms
89,960 KB |
testcase_18 | AC | 300 ms
83,604 KB |
testcase_19 | AC | 134 ms
77,764 KB |
testcase_20 | AC | 234 ms
79,512 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)