結果
問題 | No.194 フィボナッチ数列の理解(1) |
ユーザー | ayaoni |
提出日時 | 2020-12-06 14:44:05 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 209 ms / 5,000 ms |
コード長 | 1,991 bytes |
コンパイル時間 | 1,018 ms |
コンパイル使用メモリ | 81,664 KB |
実行使用メモリ | 216,636 KB |
最終ジャッジ日時 | 2023-10-17 15:24:39 |
合計ジャッジ時間 | 7,272 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 38 ms
53,620 KB |
testcase_01 | AC | 38 ms
53,620 KB |
testcase_02 | AC | 209 ms
76,504 KB |
testcase_03 | AC | 95 ms
76,188 KB |
testcase_04 | AC | 132 ms
76,332 KB |
testcase_05 | AC | 122 ms
76,232 KB |
testcase_06 | AC | 130 ms
76,236 KB |
testcase_07 | AC | 158 ms
76,432 KB |
testcase_08 | AC | 100 ms
76,276 KB |
testcase_09 | AC | 140 ms
76,284 KB |
testcase_10 | AC | 109 ms
76,196 KB |
testcase_11 | AC | 106 ms
76,180 KB |
testcase_12 | AC | 124 ms
76,232 KB |
testcase_13 | AC | 98 ms
76,168 KB |
testcase_14 | AC | 88 ms
76,240 KB |
testcase_15 | AC | 175 ms
76,828 KB |
testcase_16 | AC | 158 ms
76,360 KB |
testcase_17 | AC | 107 ms
76,436 KB |
testcase_18 | AC | 163 ms
76,368 KB |
testcase_19 | AC | 196 ms
76,512 KB |
testcase_20 | AC | 142 ms
214,060 KB |
testcase_21 | AC | 145 ms
216,636 KB |
testcase_22 | AC | 143 ms
214,060 KB |
testcase_23 | AC | 51 ms
68,428 KB |
testcase_24 | AC | 103 ms
132,496 KB |
testcase_25 | AC | 99 ms
127,584 KB |
testcase_26 | AC | 97 ms
124,388 KB |
testcase_27 | AC | 106 ms
140,324 KB |
testcase_28 | AC | 60 ms
80,204 KB |
testcase_29 | AC | 136 ms
194,916 KB |
testcase_30 | AC | 197 ms
76,516 KB |
testcase_31 | AC | 45 ms
59,452 KB |
testcase_32 | AC | 117 ms
76,256 KB |
testcase_33 | AC | 134 ms
76,240 KB |
testcase_34 | AC | 124 ms
76,344 KB |
testcase_35 | AC | 118 ms
76,240 KB |
testcase_36 | AC | 170 ms
76,392 KB |
testcase_37 | AC | 102 ms
76,280 KB |
testcase_38 | AC | 183 ms
76,448 KB |
testcase_39 | AC | 129 ms
76,248 KB |
ソースコード
import sys from itertools import accumulate sys.setrecursionlimit(10**7) def I(): return int(sys.stdin.readline().rstrip()) def MI(): return map(int,sys.stdin.readline().rstrip().split()) def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) def LI2(): return list(map(int,sys.stdin.readline().rstrip())) def S(): return sys.stdin.readline().rstrip() def LS(): return list(sys.stdin.readline().rstrip().split()) def LS2(): return list(sys.stdin.readline().rstrip()) def matrix_multiplication_mod(A,B,p): l = len(A) m = len(B) n = len(B[0]) C = [[0]*n for _ in range(l)] for i in range(l): for j in range(n): C[i][j] = sum((A[i][k]*B[k][j]) % p for k in range(m)) % p return C def matrix_power_mod(A,n,p): l = len(A) C = [[0] * l for _ in range(l)] for i in range(l): C[i][i] = 1 while n > 0: if n % 2 == 1: C = matrix_multiplication_mod(C,A,p) A = matrix_multiplication_mod(A,A,p) n >>= 1 return C N,K = MI() A = [0]+LI() mod = 10**9+7 if K <= 10**6: if K <= N: print(A[K],sum(A[:K+1])) exit() F = A S = list(accumulate(F)) for i in range(N+1,K+1): f = S[i-1]-S[i-1-N] f %= mod F.append(f) S.append((S[-1]+f)% mod) print(F[K],S[K]) else: if K <= N: print(A[K],sum(A[:K+1])) exit() X = [[0]*N for _ in range(N)] for i in range(N): X[0][i] = 1 for i in range(1,N): X[i][i-1] = 1 Y = [[0]*(N+1) for _ in range(N+1)] Y[0][0] = 2 Y[0][N] = -1 for i in range(1,N+1): Y[i][i-1] = 1 S = list(accumulate(A)) A = list(reversed(A[1:])) S.reverse() XX = matrix_power_mod(X,K-N,mod) YY = matrix_power_mod(Y,K-N,mod) ans_F,ans_S = 0,0 for i in range(N): ans_F += XX[0][i]*A[i] ans_F %= mod for i in range(N+1): ans_S += YY[0][i]*S[i] ans_S %= mod print(ans_F,ans_S)