結果

問題 No.1513 simple 門松列 problem
ユーザー mkawa2mkawa2
提出日時 2023-10-03 16:59:22
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 754 ms / 3,000 ms
コード長 1,987 bytes
コンパイル時間 511 ms
コンパイル使用メモリ 86,892 KB
実行使用メモリ 81,452 KB
最終ジャッジ日時 2023-10-03 16:59:30
合計ジャッジ時間 7,639 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 69 ms
71,412 KB
testcase_01 AC 73 ms
71,408 KB
testcase_02 AC 754 ms
81,356 KB
testcase_03 AC 82 ms
76,416 KB
testcase_04 AC 75 ms
71,292 KB
testcase_05 AC 87 ms
76,836 KB
testcase_06 AC 96 ms
77,088 KB
testcase_07 AC 84 ms
76,536 KB
testcase_08 AC 88 ms
76,804 KB
testcase_09 AC 71 ms
71,412 KB
testcase_10 AC 73 ms
71,396 KB
testcase_11 AC 73 ms
71,536 KB
testcase_12 AC 71 ms
71,576 KB
testcase_13 AC 71 ms
71,540 KB
testcase_14 AC 732 ms
81,252 KB
testcase_15 AC 738 ms
81,240 KB
testcase_16 AC 734 ms
81,452 KB
testcase_17 AC 552 ms
80,932 KB
testcase_18 AC 249 ms
81,208 KB
testcase_19 AC 100 ms
77,416 KB
testcase_20 AC 183 ms
78,844 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 63)
# md = 10**9+7
md = 998244353

n, k = LI()
c = [[0]*k for _ in range(k)]
t = [[0]*k for _ in range(k)]
sc = [[0]*k for _ in range(k+1)]
st = [[0]*k for _ in range(k+1)]
pc = [[0]*k for _ in range(k)]
pt = [[0]*k for _ in range(k)]
psc = [[0]*k for _ in range(k+1)]
pst = [[0]*k for _ in range(k+1)]

for a in range(k):
    for b in range(k):
        if a == b: continue
        c[a][b] = 1
        t[a][b] = a+b
        sc[a+1][b] = sc[a][b]+1
        st[a+1][b] = st[a][b]+a+b

for _ in range(n-2):
    c, t, sc, st, pc, pt, psc, pst = pc, pt, psc, pst, c, t, sc, st
    for a in range(k):
        for b in range(k):
            if a == b: continue
            if a < b:
                c[a][b] = psc[k][a]-psc[a+1][a]-pc[b][a]
                t[a][b] = pst[k][a]-pst[a+1][a]-pt[b][a]+b*c[a][b]%md
            else:
                c[a][b] = psc[a][a]-pc[b][a]
                t[a][b] = pst[a][a]-pt[b][a]+b*c[a][b]%md
            c[a][b] %= md
            t[a][b] %= md
            sc[a+1][b] = c[a][b]+sc[a][b]
            st[a+1][b] = t[a][b]+st[a][b]
            sc[a+1][b] %= md
            st[a+1][b] %= md

x = y = 0
for a in range(k):
    for b in range(k):
        x += c[a][b]
        y += t[a][b]
        x %= md
        y %= md

print(x, y)
0