結果
問題 | No.1516 simple 門松列 problem Re:MASTER |
ユーザー | mkawa2 |
提出日時 | 2023-10-04 09:58:19 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,563 ms / 6,000 ms |
コード長 | 2,079 bytes |
コンパイル時間 | 2,884 ms |
コンパイル使用メモリ | 86,956 KB |
実行使用メモリ | 86,068 KB |
最終ジャッジ日時 | 2023-10-04 09:58:32 |
合計ジャッジ時間 | 10,217 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 76 ms
76,224 KB |
testcase_01 | AC | 185 ms
77,644 KB |
testcase_02 | AC | 733 ms
81,080 KB |
testcase_03 | AC | 78 ms
76,260 KB |
testcase_04 | AC | 75 ms
76,200 KB |
testcase_05 | AC | 82 ms
76,472 KB |
testcase_06 | AC | 110 ms
77,092 KB |
testcase_07 | AC | 187 ms
77,612 KB |
testcase_08 | AC | 266 ms
77,896 KB |
testcase_09 | AC | 77 ms
76,360 KB |
testcase_10 | AC | 112 ms
76,380 KB |
testcase_11 | AC | 84 ms
76,204 KB |
testcase_12 | AC | 77 ms
76,204 KB |
testcase_13 | AC | 79 ms
75,920 KB |
testcase_14 | AC | 1,360 ms
84,140 KB |
testcase_15 | AC | 697 ms
79,848 KB |
testcase_16 | AC | 370 ms
78,220 KB |
testcase_17 | AC | 187 ms
77,236 KB |
testcase_18 | AC | 110 ms
77,256 KB |
testcase_19 | AC | 90 ms
76,408 KB |
testcase_20 | AC | 1,563 ms
86,068 KB |
testcase_21 | AC | 1,545 ms
85,980 KB |
ソースコード
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 def dot(aa, bb): h = len(aa) w = len(bb[0]) res = [[0]*w for _ in range(h)] for j, col in enumerate(zip(*bb)): for i in range(h): v = 0 # for a, b in zip(row, col): v += a*b # res[i][j] = v for a, b in zip(aa[i], col): v += a*b%md res[i][j] = v%md return res def matpow(mat, e): n = len(mat) res = [[1 if i == j else 0 for j in range(n)] for i in range(n)] while e: if e & 1: res = dot(res, mat) mat = dot(mat, mat) e >>= 1 return res n, k = LI() m = k*k mat = [[0]*m*2 for _ in range(m*2)] aa = [0]*m*2 for a in range(k): for b in range(k): if a == b: continue aa[a*k+b] = 1 aa[a*k+b+m] = a+b if a < b: for p in range(a+1, k): if p == b: continue mat[p*k+a][a*k+b] = 1 mat[p*k+a][a*k+b+m] = b mat[p*k+a+m][a*k+b+m] = 1 if a > b: for p in range(a): if p == b: continue mat[p*k+a][a*k+b] = 1 mat[p*k+a][a*k+b+m] = b mat[p*k+a+m][a*k+b+m] = 1 mat = matpow(mat, n-2) aa = dot([aa], mat)[0] x = y = 0 for i in range(m): x += aa[i] y += aa[i+m] x %= md y %= md print(x, y)