結果
問題 | No.194 フィボナッチ数列の理解(1) |
ユーザー | Navier_Boltzmann |
提出日時 | 2022-10-11 04:58:49 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 201 ms / 5,000 ms |
コード長 | 1,854 bytes |
コンパイル時間 | 323 ms |
コンパイル使用メモリ | 86,972 KB |
実行使用メモリ | 85,392 KB |
最終ジャッジ日時 | 2023-09-07 07:11:44 |
合計ジャッジ時間 | 8,581 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 106 ms
72,436 KB |
testcase_01 | AC | 131 ms
77,140 KB |
testcase_02 | AC | 200 ms
79,948 KB |
testcase_03 | AC | 137 ms
79,788 KB |
testcase_04 | AC | 162 ms
79,860 KB |
testcase_05 | AC | 155 ms
79,824 KB |
testcase_06 | AC | 161 ms
79,960 KB |
testcase_07 | AC | 175 ms
79,876 KB |
testcase_08 | AC | 135 ms
79,448 KB |
testcase_09 | AC | 169 ms
79,896 KB |
testcase_10 | AC | 150 ms
79,808 KB |
testcase_11 | AC | 146 ms
79,912 KB |
testcase_12 | AC | 154 ms
79,740 KB |
testcase_13 | AC | 138 ms
79,556 KB |
testcase_14 | AC | 130 ms
78,000 KB |
testcase_15 | AC | 186 ms
79,940 KB |
testcase_16 | AC | 177 ms
79,868 KB |
testcase_17 | AC | 147 ms
79,768 KB |
testcase_18 | AC | 178 ms
79,740 KB |
testcase_19 | AC | 193 ms
80,092 KB |
testcase_20 | AC | 129 ms
77,848 KB |
testcase_21 | AC | 154 ms
85,392 KB |
testcase_22 | AC | 105 ms
72,860 KB |
testcase_23 | AC | 113 ms
77,972 KB |
testcase_24 | AC | 119 ms
81,300 KB |
testcase_25 | AC | 120 ms
80,956 KB |
testcase_26 | AC | 122 ms
80,912 KB |
testcase_27 | AC | 120 ms
81,300 KB |
testcase_28 | AC | 121 ms
78,476 KB |
testcase_29 | AC | 126 ms
84,512 KB |
testcase_30 | AC | 201 ms
80,084 KB |
testcase_31 | AC | 111 ms
72,632 KB |
testcase_32 | AC | 159 ms
79,796 KB |
testcase_33 | AC | 162 ms
79,804 KB |
testcase_34 | AC | 160 ms
79,840 KB |
testcase_35 | AC | 157 ms
79,712 KB |
testcase_36 | AC | 183 ms
79,672 KB |
testcase_37 | AC | 135 ms
79,612 KB |
testcase_38 | AC | 191 ms
79,888 KB |
testcase_39 | AC | 160 ms
79,912 KB |
ソースコード
from collections import * from itertools import * from functools import * from heapq import * import sys,math input = sys.stdin.readline N,K = map(int,input().split()) A = list(map(int,input().split())) mod = 10**9 + 7 def answer1(): dp = [0]*(K) for i in range(N): dp[i] = A[i] S = sum(dp)%mod for i in range(N,K): dp[i] = S S += dp[i] - dp[i-N] S %= mod print(dp[-1],sum(dp)%mod) def matrix_mul(A,B,mod = None): nA = len(A) mA = len(A[0]) mB = len(B[0]) tmp = [[0]*mB for _ in range(nA)] if mod is None: for i in range(nA): for j in range(mB): tmp[i][j] = sum(A[i][k]*B[k][j] for k in range(mA)) return tmp for i in range(nA): for j in range(mB): tmp[i][j] = sum(A[i][k]*B[k][j]%mod for k in range(mA))%mod return tmp def matrix_pow(A,n,mod = None): nbit = list(str(bin(n))[2:]) nbit = [int(i) for i in nbit] N = len(A) C = [[0]*N for _ in range(N)] B = A for i in range(N): C[i][i] = 1 if mod is None: for i in range(len(nbit)): if nbit[-1-i] == 1: C = matrix_mul(C,B) B = matrix_mul(B,B) return C for i in range(len(nbit)): if nbit[-1-i] == 1: C = matrix_mul(C,B,mod) B = matrix_mul(B,B,mod) return C def answer2(): I = [[A[i]] for i in range(N)] + [[A[0]]] X = [[0]*(N+1) for _ in range(N+1)] for i in range(N-1): X[i][i+1] = 1 for i in range(N): X[-2][i]=1 X[-1][1]=1 X[-1][-1]=1 Y = matrix_pow(X,K-1,mod=mod) Z = matrix_mul(Y,I,mod=mod) print(Z[0][0],Z[-1][0]) if N<50: answer2() else: answer1()