結果
問題 | No.978 Fibonacci Convolution Easy |
ユーザー | McGregorsh |
提出日時 | 2023-07-11 12:52:26 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 363 ms / 2,000 ms |
コード長 | 1,547 bytes |
コンパイル時間 | 649 ms |
コンパイル使用メモリ | 87,244 KB |
実行使用メモリ | 231,392 KB |
最終ジャッジ日時 | 2023-10-11 04:03:06 |
合計ジャッジ時間 | 9,712 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 251 ms
91,224 KB |
testcase_01 | AC | 292 ms
144,800 KB |
testcase_02 | AC | 279 ms
120,120 KB |
testcase_03 | AC | 358 ms
230,564 KB |
testcase_04 | AC | 285 ms
124,332 KB |
testcase_05 | AC | 253 ms
97,212 KB |
testcase_06 | AC | 290 ms
138,536 KB |
testcase_07 | AC | 309 ms
178,052 KB |
testcase_08 | AC | 293 ms
151,792 KB |
testcase_09 | AC | 324 ms
200,400 KB |
testcase_10 | AC | 355 ms
231,108 KB |
testcase_11 | AC | 290 ms
132,976 KB |
testcase_12 | AC | 250 ms
96,272 KB |
testcase_13 | AC | 283 ms
138,392 KB |
testcase_14 | AC | 267 ms
102,980 KB |
testcase_15 | AC | 297 ms
144,648 KB |
testcase_16 | AC | 360 ms
231,340 KB |
testcase_17 | AC | 363 ms
231,392 KB |
testcase_18 | AC | 246 ms
90,192 KB |
testcase_19 | AC | 246 ms
90,256 KB |
testcase_20 | AC | 245 ms
89,980 KB |
ソースコード
import sys from sys import stdin from fractions import Fraction import math from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce, lru_cache from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(stdin.readline()) def i_map(): return map(int, stdin.readline().split()) def i_list(): return list(i_map()) def s_input(): return stdin.readline()[:-1] def s_map(): return s_input().split() def s_list(): return list(s_map()) def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 alpa = 'abcdefghijklmnopqrstuvwxyz' ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' def main(): N, P = i_map() nums = [0, 1] for i in range(N-2): score = P * nums[-1] + nums[-2] nums.append(score % MOD) total = sum(nums) % MOD ans = 0 for i in range(N): score = nums[i] * total % MOD ans += score total -= nums[i] total %= MOD ans %= MOD print(ans) if __name__ == '__main__': main()