結果
問題 | No.194 フィボナッチ数列の理解(1) |
ユーザー | roaris |
提出日時 | 2020-12-11 22:23:12 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 104 ms / 5,000 ms |
コード長 | 1,405 bytes |
コンパイル時間 | 536 ms |
コンパイル使用メモリ | 81,880 KB |
実行使用メモリ | 75,932 KB |
最終ジャッジ日時 | 2023-10-20 01:45:29 |
合計ジャッジ時間 | 4,680 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 37 ms
53,608 KB |
testcase_01 | AC | 38 ms
53,608 KB |
testcase_02 | AC | 104 ms
75,716 KB |
testcase_03 | AC | 61 ms
68,548 KB |
testcase_04 | AC | 73 ms
70,580 KB |
testcase_05 | AC | 80 ms
75,712 KB |
testcase_06 | AC | 73 ms
70,580 KB |
testcase_07 | AC | 101 ms
75,932 KB |
testcase_08 | AC | 56 ms
66,468 KB |
testcase_09 | AC | 76 ms
70,580 KB |
testcase_10 | AC | 67 ms
72,648 KB |
testcase_11 | AC | 61 ms
68,516 KB |
testcase_12 | AC | 80 ms
75,708 KB |
testcase_13 | AC | 62 ms
68,536 KB |
testcase_14 | AC | 56 ms
66,360 KB |
testcase_15 | AC | 88 ms
72,796 KB |
testcase_16 | AC | 81 ms
72,628 KB |
testcase_17 | AC | 66 ms
72,644 KB |
testcase_18 | AC | 84 ms
72,628 KB |
testcase_19 | AC | 99 ms
75,708 KB |
testcase_20 | AC | 51 ms
67,576 KB |
testcase_21 | AC | 59 ms
70,148 KB |
testcase_22 | AC | 55 ms
67,640 KB |
testcase_23 | AC | 45 ms
62,648 KB |
testcase_24 | AC | 53 ms
66,024 KB |
testcase_25 | AC | 52 ms
65,716 KB |
testcase_26 | AC | 52 ms
65,568 KB |
testcase_27 | AC | 51 ms
64,056 KB |
testcase_28 | AC | 46 ms
63,244 KB |
testcase_29 | AC | 56 ms
67,456 KB |
testcase_30 | AC | 101 ms
75,708 KB |
testcase_31 | AC | 41 ms
59,580 KB |
testcase_32 | AC | 65 ms
70,580 KB |
testcase_33 | AC | 71 ms
70,580 KB |
testcase_34 | AC | 70 ms
70,580 KB |
testcase_35 | AC | 66 ms
70,580 KB |
testcase_36 | AC | 85 ms
73,056 KB |
testcase_37 | AC | 57 ms
66,472 KB |
testcase_38 | AC | 92 ms
73,476 KB |
testcase_39 | AC | 82 ms
75,840 KB |
ソースコード
import sys input = sys.stdin.readline def mat_mul(A, B): C = [[0]*len(B[0]) for _ in range(len(A))] for i in range(len(A)): for j in range(len(B[0])): for k in range(len(A[0])): C[i][j] += A[i][k]*B[k][j] C[i][j] %= MOD return C def mat_pow(A, n): res = [[0]*len(A) for _ in range(len(A))] for i in range(len(A)): res[i][i] = 1 while n>0: if n&1: res = mat_mul(res, A) n >>= 1 A = mat_mul(A, A) return res N, K = map(int, input().split()) A = list(map(int, input().split())) MOD = 10**9+7 if K<=10**6: dp = [0]*K for i in range(N): dp[i] = A[i] s = sum(A) for i in range(N, K): dp[i] = s s += dp[i]-dp[i-N] s %= MOD print(dp[K-1], sum(dp)%MOD) else: M1 = [[0]*N for _ in range(N)] for i in range(N-1): M1[i][i+1] = 1 for i in range(N): M1[N-1][i] = 1 x = [[A[i]] for i in range(N)] F = mat_mul(mat_pow(M1, K-N), x)[N-1][0] M2 = [[0]*(N+1) for _ in range(N+1)] for i in range(N): M2[i][i+1] = 1 M2[N][0] = -1 M2[N][N] = 2 x = [[0]] acc = 0 for i in range(N): acc += A[i] x.append([acc]) S = mat_mul(mat_pow(M2, K-N), x)[N][0] print(F, S)