結果
問題 | No.1513 simple 門松列 problem |
ユーザー | Kiri8128 |
提出日時 | 2021-05-21 22:06:27 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 760 ms / 3,000 ms |
コード長 | 1,846 bytes |
コンパイル時間 | 286 ms |
コンパイル使用メモリ | 81,712 KB |
実行使用メモリ | 94,596 KB |
最終ジャッジ日時 | 2024-04-18 15:34:28 |
合計ジャッジ時間 | 5,656 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 36 ms
53,160 KB |
testcase_01 | AC | 36 ms
54,320 KB |
testcase_02 | AC | 760 ms
94,596 KB |
testcase_03 | AC | 56 ms
68,292 KB |
testcase_04 | AC | 40 ms
53,604 KB |
testcase_05 | AC | 68 ms
73,784 KB |
testcase_06 | AC | 62 ms
71,020 KB |
testcase_07 | AC | 48 ms
64,980 KB |
testcase_08 | AC | 83 ms
76,176 KB |
testcase_09 | AC | 37 ms
53,116 KB |
testcase_10 | AC | 38 ms
53,304 KB |
testcase_11 | AC | 38 ms
52,624 KB |
testcase_12 | AC | 38 ms
53,592 KB |
testcase_13 | AC | 36 ms
53,352 KB |
testcase_14 | AC | 709 ms
94,472 KB |
testcase_15 | AC | 734 ms
94,344 KB |
testcase_16 | AC | 735 ms
94,224 KB |
testcase_17 | AC | 492 ms
86,152 KB |
testcase_18 | AC | 232 ms
82,556 KB |
testcase_19 | AC | 98 ms
76,572 KB |
testcase_20 | AC | 185 ms
77,872 KB |
ソースコード
P = 998244353 N, K = map(int, input().split()) X = [[1] * (K + 1) for _ in range(K)] for i in range(K): X[i][i] = 0 Y = [[i + j for j in range(K + 1)] for i in range(K)] for i in range(K): Y[i][i] = 0 # print("X =", X) # print("Y =", Y) for _ in range(N - 2): nX = [[0] * (K + 1) for _ in range(K)] nY = [[0] * (K + 1) for _ in range(K)] nZ = [[0] * (K + 1) for _ in range(K)] for i in range(K): for j in range(i): x = X[i][j] y = Y[i][j] nX[j][j+1] += x nX[j][i] -= x nX[j][i+1] += x nY[j][j+1] += y nY[j][i] -= y nY[j][i+1] += y nZ[j][j+1] += x nZ[j][i] -= x nZ[j][i+1] += x for j in range(i+1, K): x = X[i][j] y = Y[i][j] nX[j][0] += x nX[j][j] -= x nX[j][i] -= x nX[j][i+1] += x nY[j][0] += y nY[j][j] -= y nY[j][i] -= y nY[j][i+1] += y nZ[j][0] += x nZ[j][j] -= x nZ[j][i] -= x nZ[j][i+1] += x for j in range(K): nX[j][0] %= P for k in range(1, K): nX[j][k] = (nX[j][k-1] + nX[j][k]) % P for j in range(K): nY[j][0] %= P for k in range(1, K): nY[j][k] = (nY[j][k-1] + nY[j][k]) % P for j in range(K): nZ[j][0] %= P for k in range(1, K): nZ[j][k] = (nZ[j][k-1] + nZ[j][k]) % P for j in range(K): for k in range(K): nY[j][k] = (nY[j][k] + nX[j][k] * k) % P X = nX Y = nY # print("X =", X) # print("Y =", Y) ans1 = 0 ans2 = 0 for i in range(K): for j in range(K): ans1 += X[i][j] ans2 += Y[i][j] print(ans1 % P, ans2 % P)