結果
問題 | No.978 Fibonacci Convolution Easy |
ユーザー | rokahikou1 |
提出日時 | 2020-08-11 20:44:49 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 26 ms / 2,000 ms |
コード長 | 2,993 bytes |
コンパイル時間 | 915 ms |
コンパイル使用メモリ | 96,188 KB |
実行使用メモリ | 34,600 KB |
最終ジャッジ日時 | 2024-04-17 17:36:07 |
合計ジャッジ時間 | 1,577 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 13 ms
15,368 KB |
testcase_02 | AC | 7 ms
9,524 KB |
testcase_03 | AC | 25 ms
33,316 KB |
testcase_04 | AC | 8 ms
10,796 KB |
testcase_05 | AC | 4 ms
6,944 KB |
testcase_06 | AC | 10 ms
13,800 KB |
testcase_07 | AC | 20 ms
22,724 KB |
testcase_08 | AC | 12 ms
16,552 KB |
testcase_09 | AC | 18 ms
25,768 KB |
testcase_10 | AC | 26 ms
34,572 KB |
testcase_11 | AC | 10 ms
12,180 KB |
testcase_12 | AC | 3 ms
6,940 KB |
testcase_13 | AC | 10 ms
13,536 KB |
testcase_14 | AC | 4 ms
6,940 KB |
testcase_15 | AC | 11 ms
15,072 KB |
testcase_16 | AC | 25 ms
34,600 KB |
testcase_17 | AC | 25 ms
34,368 KB |
testcase_18 | AC | 2 ms
6,944 KB |
testcase_19 | AC | 2 ms
6,940 KB |
testcase_20 | AC | 1 ms
6,940 KB |
ソースコード
#include <algorithm> #include <cmath> #include <cstdint> #include <cstdio> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <set> #include <stack> #include <string> #include <vector> using namespace std; #define rep(i, n) for(int(i) = 0; (i) < (n); (i)++) #define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++) #define All(v) (v).begin(), (v).end() #define pb push_back #define MP(a, b) make_pair((a), (b)) using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; const int INF = 1 << 30; const ll LINF = 1LL << 60; const int MOD = 1e9 + 7; template <uint_fast64_t MOD> class ModInt { using u64 = uint_fast64_t; public: u64 val; ModInt(const u64 x = 0) : val((x + MOD) % MOD) {} constexpr u64 &value() { return val; } constexpr ModInt operator-() { return val ? MOD - val : 0; } constexpr ModInt operator+(const ModInt &rhs) const { return ModInt(*this) += rhs; } constexpr ModInt operator-(const ModInt &rhs) const { return ModInt(*this) -= rhs; } constexpr ModInt operator*(const ModInt &rhs) const { return ModInt(*this) *= rhs; } constexpr ModInt operator/(const ModInt &rhs) const { return ModInt(*this) /= rhs; } constexpr ModInt &operator+=(const ModInt &rhs) { val += rhs.val; if(val >= MOD) { val -= MOD; } return *this; } constexpr ModInt &operator-=(const ModInt &rhs) { if(val < rhs.val) { val += MOD; } val -= rhs.val; return *this; } constexpr ModInt &operator*=(const ModInt &rhs) { val = val * rhs.val % MOD; return *this; } constexpr ModInt &operator/=(const ModInt &rhs) { *this *= rhs.inv(); return *this; } constexpr bool operator==(const ModInt &rhs) { return this->a == rhs.a; } constexpr bool operator!=(const ModInt &rhs) { return this->a != rhs.a; } friend constexpr ostream &operator<<(ostream &os, const ModInt<MOD> &x) { return os << x.val; } friend constexpr istream &operator>>(istream &is, ModInt<MOD> &x) { return is >> x.val; } constexpr ModInt inv() const { return ModInt(*this).pow(MOD - 2); } constexpr ModInt pow(ll e) const { u64 x = 1, p = val; while(e > 0) { if(e % 2 == 0) { p = (p * p) % MOD; e /= 2; } else { x = (x * p) % MOD; e--; } } return ModInt(x); } }; using mint = ModInt<MOD>; int main() { int N; cin >> N; ll p; cin >> p; vector<mint> fib(N); fib[0] = 0, fib[1] = 1; for(int i = 2; i < N; i++) { fib[i] = fib[i - 2] + fib[i - 1] * p; } vector<mint> sum(N + 1); rep(i, N) { sum[i + 1] = sum[i] + fib[i]; } mint res = 0; rep(i, N) { res += fib[i] * sum[i + 1]; } cout << res << endl; return 0; }