結果
問題 | No.2156 ぞい文字列 |
ユーザー | tassei903 |
提出日時 | 2022-12-09 21:50:31 |
言語 | PyPy3 (7.3.13) |
結果 |
AC
|
実行時間 | 214 ms / 2,000 ms |
コード長 | 2,282 bytes |
コンパイル時間 | 370 ms |
コンパイル使用メモリ | 87,052 KB |
実行使用メモリ | 89,692 KB |
最終ジャッジ日時 | 2023-08-04 23:21:39 |
合計ジャッジ時間 | 5,936 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 211 ms
89,436 KB |
testcase_01 | AC | 210 ms
89,408 KB |
testcase_02 | AC | 207 ms
89,408 KB |
testcase_03 | AC | 208 ms
89,664 KB |
testcase_04 | AC | 210 ms
89,620 KB |
testcase_05 | AC | 211 ms
89,296 KB |
testcase_06 | AC | 204 ms
89,652 KB |
testcase_07 | AC | 206 ms
89,504 KB |
testcase_08 | AC | 210 ms
89,520 KB |
testcase_09 | AC | 208 ms
89,436 KB |
testcase_10 | AC | 207 ms
89,408 KB |
testcase_11 | AC | 209 ms
89,492 KB |
testcase_12 | AC | 212 ms
89,300 KB |
testcase_13 | AC | 209 ms
89,424 KB |
testcase_14 | AC | 207 ms
89,436 KB |
testcase_15 | AC | 205 ms
89,692 KB |
testcase_16 | AC | 208 ms
89,652 KB |
testcase_17 | AC | 205 ms
89,460 KB |
testcase_18 | AC | 211 ms
89,692 KB |
testcase_19 | AC | 214 ms
89,508 KB |
ソースコード
import sys #input = lambda :sys.stdin.readline()[:-1] ni = lambda :int(input()) na = lambda :list(map(int,input().split())) yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES") no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO") ####################################################################### from fractions import Fraction #2D matrix mod = 998244353 def add(x,y): return (x + y)%mod def mul(x, y): return x * y%mod def mat_add(A, B, replace=False): assert len(A)==len(B) and len(A[0]) == len(B[0]) if not replace: A = [a.copy() for a in A] n = len(A) m = len(A[0]) for i in range(n): for j in range(m): A[i][j] = add(A[i][j], B[i][j]) return A def mat_mul(A,B): assert len(A[0]) == len(B) n = len(A) m = len(B[0]) p = len(A[0]) R = [[0 for j in range(m)]for i in range(n)] for i in range(n): for j in range(m): for k in range(p): R[i][j] = add(R[i][j],mul(A[i][k],B[k][j])) return R def mat_pow(A, x): assert len(A)==len(A[0]) n = len(A) R = [[0 for j in range(n)]for i in range(n)] for i in range(n): R[i][i] = 1 while x > 0: if x&1: R = mat_mul(R, A) A = mat_mul(A,A) x >>= 1 return R def determinant(A, replace=False): if not replace: A = [a.copy() for a in A] n = len(A) res = 1 for i, a_i in enumerate(A): if a_i[i] == 0: for j in range(i+1, n): if A[j][i]: break else: return 0 A[i], A[j] = A[j], A[i] a_i = A[i] res = -res inv = 1/a_i[i] for j in range(i+1, n): a_j = A[j] t = a_j[i] * inv for k in range(i+1, n): a_j[k] -= t * a_i[k] for i in range(n): res *= A[i][i] return res def mat_pri(A): for i in A: print(*i) def fractionize(A): for i in range(len(A)): for j in range(len(A[0])): A[i][j] = Fraction(A[i][j]) n = ni() if n <= 3: print([0,1,2][n-1]) exit() A = [[1,1],[1,0]] print((mat_mul(mat_pow(A,n-3),[[3],[2]])[0][0]-1)%mod)