結果
問題 | No.978 Fibonacci Convolution Easy |
ユーザー | Haar |
提出日時 | 2020-01-31 21:57:41 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 37 ms / 2,000 ms |
コード長 | 5,184 bytes |
コンパイル時間 | 1,854 ms |
コンパイル使用メモリ | 202,884 KB |
実行使用メモリ | 18,936 KB |
最終ジャッジ日時 | 2024-09-18 20:57:26 |
合計ジャッジ時間 | 3,215 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 28 ms
18,688 KB |
testcase_01 | AC | 31 ms
18,696 KB |
testcase_02 | AC | 29 ms
18,816 KB |
testcase_03 | AC | 36 ms
18,916 KB |
testcase_04 | AC | 31 ms
18,808 KB |
testcase_05 | AC | 29 ms
18,816 KB |
testcase_06 | AC | 31 ms
18,816 KB |
testcase_07 | AC | 34 ms
18,840 KB |
testcase_08 | AC | 31 ms
18,816 KB |
testcase_09 | AC | 35 ms
18,688 KB |
testcase_10 | AC | 36 ms
18,816 KB |
testcase_11 | AC | 30 ms
18,688 KB |
testcase_12 | AC | 30 ms
18,864 KB |
testcase_13 | AC | 32 ms
18,816 KB |
testcase_14 | AC | 29 ms
18,688 KB |
testcase_15 | AC | 31 ms
18,856 KB |
testcase_16 | AC | 37 ms
18,816 KB |
testcase_17 | AC | 35 ms
18,936 KB |
testcase_18 | AC | 20 ms
18,688 KB |
testcase_19 | AC | 30 ms
18,688 KB |
testcase_20 | AC | 29 ms
18,848 KB |
ソースコード
#include <bits/stdc++.h> #define LLI long long int #define FOR(v, a, b) for(LLI v = (a); v < (b); ++v) #define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v) #define REP(v, n) FOR(v, 0, n) #define REPE(v, n) FORE(v, 0, n) #define REV(v, a, b) for(LLI v = (a); v >= (b); --v) #define ALL(x) (x).begin(), (x).end() #define RALL(x) (x).rbegin(), (x).rend() #define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it) #define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it) #define EXIST(c,x) ((c).find(x) != (c).end()) #define fst first #define snd second #define popcount __builtin_popcount #define UNIQ(v) (v).erase(unique(ALL(v)), (v).end()) #define bit(i) (1LL<<(i)) #ifdef DEBUG #include <Mylib/Debug/debug.cpp> #else #define dump(...) ((void)0) #endif #define gcd __gcd using namespace std; template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;} template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;} template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;} template <typename T> void puts_all(const T &value){std::cout << value << "\n";} template <typename T, typename ...Args> void puts_all(const T &value, const Args&... args){std::cout << value << " ";puts_all(args...);} template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);} template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);} template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);} template <typename T> auto make_vector(int n, int m, const T &value){return vector<vector<T>>(n, vector<T>(m, value));} struct Init{ Init(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(12); cerr << fixed << setprecision(12); } }init; template <std::uint32_t M> class ModInt{ public: std::uint64_t val; ModInt(): val(0){} ModInt(std::int64_t n){ if(n >= M) val = n % M; else if(n < 0) val = n % M + M; else val = n; } inline constexpr auto operator+(const ModInt &a) const {return ModInt(val + a.val);} inline constexpr auto operator-(const ModInt &a) const {return ModInt(val - a.val);} inline constexpr auto operator*(const ModInt &a) const {return ModInt(val * a.val);} inline constexpr auto operator/(const ModInt &a) const {return ModInt(val * a.inv().val);} inline constexpr auto& operator=(const ModInt &a){val = a.val; return *this;} inline constexpr auto& operator+=(const ModInt &a){if((val += a.val) >= M) val -= M; return *this;} inline constexpr auto& operator-=(const ModInt &a){if(val < a.val) val += M; val -= a.val; return *this;} inline constexpr auto& operator*=(const ModInt &a){(val *= a.val) %= M; return *this;} inline constexpr auto& operator/=(const ModInt &a){(val *= a.inv().val) %= M; return *this;} inline constexpr bool operator==(const ModInt &a) const {return val == a.val;} inline constexpr bool operator!=(const ModInt &a) const {return val != a.val;} inline constexpr auto& operator++(){*this += 1; return *this;} inline constexpr auto& operator--(){*this -= 1; return *this;} inline constexpr auto operator++(int){auto t = *this; *this += 1; return t;} inline constexpr auto operator--(int){auto t = *this; *this -= 1; return t;} inline constexpr static auto frac(std::int64_t a, std::int64_t b){ return ModInt(a) / ModInt(b); } inline constexpr static ModInt power(std::int64_t n, std::int64_t p){ if(p < 0) return power(n, -p).inv(); ModInt ret = 1, e = n; for(; p; e *= e, p >>= 1) if(p & 1) ret *= e; return ret; } inline constexpr auto power(std::int64_t p) const {return power(val, p);} inline constexpr ModInt inv() const { std::int64_t a = val, b = M, u = 1, v = 0; while(b){ std::int64_t t = a/b; a -= t*b; std::swap(a,b); u -= t*v; std::swap(u,v); } u %= M; if(u < 0) u += M; return u; } }; template <std::uint32_t M> auto operator-(const ModInt<M> &a){return ModInt<M>(-a.val);} template <std::uint32_t M> auto operator+(std::int64_t a, const ModInt<M> &b){return ModInt<M>(a) + b;} template <std::uint32_t M> auto operator-(std::int64_t a, const ModInt<M> &b){return ModInt<M>(a) - b;} template <std::uint32_t M> auto operator*(std::int64_t a, const ModInt<M> &b){return ModInt<M>(a) * b;} template <std::uint32_t M> auto operator/(std::int64_t a, const ModInt<M> &b){return ModInt<M>(a) / b;} template <std::uint32_t M> std::istream& operator>>(std::istream &is, ModInt<M> &a){is >> a.val; return is;} template <std::uint32_t M> std::ostream& operator<<(std::ostream &os, const ModInt<M> &a){os << a.val; return os;} using mint = ModInt<1000000007>; const int MAX = 2000000; int main(){ int N, p; while(cin >> N >> p){ vector<mint> a(MAX); a[0] = 0; a[1] = 1; FOR(i,2,MAX) a[i] = a[i-1] * p + a[i-2]; mint s = 0; mint ans = 0; REP(i,N){ s += a[i]; ans += s * a[i]; } cout << ans << endl; } return 0; }