結果
問題 | No.194 フィボナッチ数列の理解(1) |
ユーザー | mkawa2 |
提出日時 | 2020-01-23 11:20:11 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
MLE
|
実行時間 | - |
コード長 | 2,807 bytes |
コンパイル時間 | 96 ms |
コンパイル使用メモリ | 11,356 KB |
実行使用メモリ | 815,168 KB |
最終ジャッジ日時 | 2023-09-25 22:16:32 |
合計ジャッジ時間 | 7,637 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 18 ms
8,536 KB |
testcase_01 | AC | 18 ms
8,080 KB |
testcase_02 | AC | 347 ms
8,616 KB |
testcase_03 | AC | 78 ms
8,612 KB |
testcase_04 | AC | 180 ms
8,488 KB |
testcase_05 | AC | 153 ms
8,572 KB |
testcase_06 | AC | 174 ms
8,528 KB |
testcase_07 | AC | 251 ms
8,636 KB |
testcase_08 | AC | 65 ms
8,460 KB |
testcase_09 | AC | 208 ms
8,624 KB |
testcase_10 | AC | 118 ms
8,572 KB |
testcase_11 | AC | 115 ms
8,480 KB |
testcase_12 | AC | 159 ms
8,512 KB |
testcase_13 | AC | 92 ms
8,524 KB |
testcase_14 | AC | 42 ms
8,520 KB |
testcase_15 | AC | 273 ms
8,632 KB |
testcase_16 | AC | 247 ms
8,608 KB |
testcase_17 | AC | 108 ms
8,560 KB |
testcase_18 | AC | 262 ms
8,636 KB |
testcase_19 | AC | 329 ms
8,628 KB |
testcase_20 | AC | 35 ms
8,548 KB |
testcase_21 | MLE | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
ソースコード
import sys sys.setrecursionlimit(10 ** 6) int1 = lambda x: int(x) - 1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def MI(): return map(int, sys.stdin.readline().split()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def SI(): return sys.stdin.readline()[:-1] class mint: def __init__(self, x): self.__x = x % md def __str__(self): return str(self.__x) def __add__(self, other): if isinstance(other, mint): other = other.__x return mint(self.__x + other) def __sub__(self, other): if isinstance(other, mint): other = other.__x return mint(self.__x - other) def __rsub__(self, other): return mint(other - self.__x) def __mul__(self, other): if isinstance(other, mint): other = other.__x return mint(self.__x * other) __radd__ = __add__ __rmul__ = __mul__ def __truediv__(self, other): if isinstance(other, mint): other = other.__x return mint(self.__x * pow(other, md - 2, md)) def __pow__(self, power, modulo=None): return mint(pow(self.__x, power, md)) class Sibonacci: def __init__(self, aa): n = len(aa)+1 coff = [-1]+[0]*(n-2)+[2] f0=[aa[0]] for x in range(1,n-1): f0.append(f0[-1]+aa[x]) f0.append(f0[-1]*2) self.f0 = f0 # 上2つは問題ごとに手作業で設定 # af(n)+bf(n+1)+cf(n+2)+df(n+3)=f(n+4)みたいなとき # coff=[a,b,c,d] # 初期値f0(f(0)からf(3)) ff = [[0] * n for _ in range(2 * n - 1)] for i in range(n):ff[i][i] = mint(1) for i in range(n, 2 * n - 1): ffi = ff[i] for j, c in enumerate(coff, i - n): ffj = ff[j] for k in range(n): ffi[k] += c * ffj[k] self.bn = 1 << (n - 1).bit_length() self.base = ff[self.bn] self.ff = ff self.n = n def __mm(self, aa, bb): n = self.n res = [0] * (n * 2 - 1) for i, a in enumerate(aa): for j, b in enumerate(bb): res[i + j] += a * b for i in range(n, 2 * n - 1): c = res[i] ffi = self.ff[i] for j in range(n): res[j] += c * ffi[j] return res[:n] def v(self, x): base = self.base aa = self.ff[x % self.bn] x //= self.bn while x: if x & 1: aa = self.__mm(aa, base) base = self.__mm(base, base) x >>= 1 return sum(a * f for a, f in zip(aa, self.f0)) md=10**9+7 def main(): n,k=MI() f0=LI() s=Sibonacci(f0) print(s.v(k-1)-s.v(k-2),s.v(k-1)) main()