結果
問題 | No.978 Fibonacci Convolution Easy |
ユーザー | McGregorsh |
提出日時 | 2023-07-11 12:52:26 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 238 ms / 2,000 ms |
コード長 | 1,547 bytes |
コンパイル時間 | 260 ms |
コンパイル使用メモリ | 82,284 KB |
実行使用メモリ | 228,536 KB |
最終ジャッジ日時 | 2024-09-13 03:27:49 |
合計ジャッジ時間 | 5,289 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 144 ms
88,936 KB |
testcase_01 | AC | 188 ms
141,788 KB |
testcase_02 | AC | 169 ms
117,068 KB |
testcase_03 | AC | 238 ms
227,740 KB |
testcase_04 | AC | 173 ms
121,288 KB |
testcase_05 | AC | 147 ms
94,188 KB |
testcase_06 | AC | 182 ms
135,632 KB |
testcase_07 | AC | 205 ms
175,248 KB |
testcase_08 | AC | 191 ms
148,972 KB |
testcase_09 | AC | 218 ms
198,556 KB |
testcase_10 | AC | 238 ms
228,396 KB |
testcase_11 | AC | 177 ms
130,076 KB |
testcase_12 | AC | 150 ms
93,444 KB |
testcase_13 | AC | 182 ms
135,892 KB |
testcase_14 | AC | 158 ms
100,364 KB |
testcase_15 | AC | 187 ms
141,964 KB |
testcase_16 | AC | 238 ms
228,536 KB |
testcase_17 | AC | 238 ms
228,456 KB |
testcase_18 | AC | 142 ms
88,660 KB |
testcase_19 | AC | 139 ms
88,636 KB |
testcase_20 | AC | 141 ms
88,756 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()