結果

問題 No.194 フィボナッチ数列の理解(1)
ユーザー toyuzukotoyuzuko
提出日時 2020-07-25 19:35:23
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 114 ms / 5,000 ms
コード長 2,033 bytes
コンパイル時間 1,186 ms
コンパイル使用メモリ 86,748 KB
実行使用メモリ 84,484 KB
最終ジャッジ日時 2023-09-09 21:15:38
合計ジャッジ時間 6,084 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 73 ms
71,448 KB
testcase_01 AC 73 ms
71,420 KB
testcase_02 AC 114 ms
77,736 KB
testcase_03 AC 92 ms
76,600 KB
testcase_04 AC 100 ms
77,228 KB
testcase_05 AC 98 ms
77,460 KB
testcase_06 AC 97 ms
77,280 KB
testcase_07 AC 103 ms
77,432 KB
testcase_08 AC 92 ms
76,480 KB
testcase_09 AC 105 ms
77,584 KB
testcase_10 AC 98 ms
77,372 KB
testcase_11 AC 97 ms
77,348 KB
testcase_12 AC 100 ms
77,320 KB
testcase_13 AC 94 ms
76,456 KB
testcase_14 AC 90 ms
76,548 KB
testcase_15 AC 113 ms
77,440 KB
testcase_16 AC 102 ms
77,588 KB
testcase_17 AC 99 ms
77,188 KB
testcase_18 AC 103 ms
77,592 KB
testcase_19 AC 114 ms
77,972 KB
testcase_20 AC 95 ms
84,124 KB
testcase_21 AC 97 ms
84,484 KB
testcase_22 AC 92 ms
84,256 KB
testcase_23 AC 81 ms
77,164 KB
testcase_24 AC 89 ms
80,336 KB
testcase_25 AC 88 ms
80,012 KB
testcase_26 AC 88 ms
79,880 KB
testcase_27 AC 85 ms
80,672 KB
testcase_28 AC 83 ms
77,544 KB
testcase_29 AC 95 ms
84,156 KB
testcase_30 AC 113 ms
77,752 KB
testcase_31 AC 74 ms
71,492 KB
testcase_32 AC 98 ms
77,396 KB
testcase_33 AC 102 ms
77,312 KB
testcase_34 AC 100 ms
77,352 KB
testcase_35 AC 99 ms
77,316 KB
testcase_36 AC 103 ms
77,512 KB
testcase_37 AC 90 ms
76,300 KB
testcase_38 AC 104 ms
77,436 KB
testcase_39 AC 98 ms
77,472 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from itertools import accumulate

MOD = 1000000007

N, K = map(int, input().split())
A = list(map(int, input().split()))
C = [0] + list(accumulate(A))

if N <= 10000 and K <= 1000000:
    res = [0 for _ in range(K)]
    for i in range(N):
        res[i] = A[i]
    res[N] = sum(A)
    for i in range(N + 1, K):
        res[i] = res[i - 1] * 2 - res[i - N - 1]
        res[i] %= MOD
    print(res[-1], sum(res) % MOD)

else:
    def inc(arr, base):
        n = len(arr)
        res = [0 for _ in range(n)]
        res[0] = arr[n - 1] * base[0]
        for i in range(1, n):
            res[i] = arr[i - 1] + arr[n - 1] * base[i]
            res[i] %= MOD
        return res

    def dec(arr, base):
        n = len(arr)
        res = [0 for _ in range(n)]
        res[n - 1] = arr[0] * pow(base[0], MOD - 2, MOD)
        for i in range(n - 1)[::-1]:
            res[i] = arr[i + 1] - res[n - 1] * base[i + 1]
            res[i] %= MOD
        return res

    def dub(arr, base):
        n = len(arr)
        res = [0 for _ in range(n)]
        tmp = [arr]
        for i in range(n - 1):
            tmp.append(inc(tmp[-1], base))
        for i in range(n):
            for j in range(n):
                res[i] += tmp[0][j] * tmp[j][i]
                res[i] %= MOD
        return res

    res = [1 for _ in range(N)]
    exp = K - 1

    base = [1 for _ in range(N)]

    for _ in range(N):
        res = dec(res, base)

    for bit in range(exp.bit_length())[::-1]:
        res = dub(res, base)
        if (exp >> bit) & 1:
            res = inc(res, base)

    F = sum([res[i] * A[i] for i in range(N)]) % MOD

    res = [0 for _ in range(N + 1)]
    res[0] = -1
    res[-1] = 2
    base = [0 for _ in range(N + 1)]
    base[0] = -1
    base[-1] = 2
    exp = K

    for _ in range(N + 1):
        res = dec(res, base)

    for bit in range(exp.bit_length())[::-1]:
        res = dub(res, base)
        if (exp >> bit) & 1:
            res = inc(res, base)

    S = sum([res[i] * C[i] for i in range(N + 1)]) % MOD

    print(F, S)
0