結果
問題 | No.980 Fibonacci Convolution Hard |
ユーザー | drken1215 |
提出日時 | 2020-02-01 01:11:55 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 374 ms / 2,000 ms |
コード長 | 3,389 bytes |
コンパイル時間 | 1,424 ms |
コンパイル使用メモリ | 168,908 KB |
実行使用メモリ | 19,760 KB |
最終ジャッジ日時 | 2024-09-17 15:19:11 |
合計ジャッジ時間 | 9,921 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 372 ms
19,600 KB |
testcase_01 | AC | 351 ms
19,736 KB |
testcase_02 | AC | 356 ms
19,560 KB |
testcase_03 | AC | 359 ms
19,620 KB |
testcase_04 | AC | 352 ms
19,556 KB |
testcase_05 | AC | 341 ms
19,560 KB |
testcase_06 | AC | 342 ms
19,624 KB |
testcase_07 | AC | 352 ms
19,584 KB |
testcase_08 | AC | 358 ms
19,760 KB |
testcase_09 | AC | 347 ms
19,648 KB |
testcase_10 | AC | 374 ms
19,584 KB |
testcase_11 | AC | 359 ms
19,596 KB |
testcase_12 | AC | 353 ms
19,648 KB |
testcase_13 | AC | 352 ms
19,584 KB |
testcase_14 | AC | 353 ms
19,684 KB |
testcase_15 | AC | 343 ms
19,684 KB |
testcase_16 | AC | 336 ms
19,664 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } #define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) { return s << '<' << P.first << ", " << P.second << '>'; } template<class T> ostream& operator << (ostream &s, vector<T> P) { for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; } template<class T> ostream& operator << (ostream &s, vector<vector<T> > P) { for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; } template<class T> ostream& operator << (ostream &s, set<T> P) { for(auto it : P) { s << "<" << it << "> "; } return s << endl; } template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) { for(auto it : P) { s << "<" << it.first << "->" << it.second << "> "; } return s << endl; } template<int MOD> struct Fp { long long val; constexpr Fp(long long v = 0) noexcept : val(v % MOD) { if (val < 0) val += MOD; } constexpr int getmod() { return MOD; } constexpr Fp operator - () const noexcept { return val ? MOD - val : 0; } constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; } constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; } constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; } constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; } constexpr Fp& operator += (const Fp& r) noexcept { val += r.val; if (val >= MOD) val -= MOD; return *this; } constexpr Fp& operator -= (const Fp& r) noexcept { val -= r.val; if (val < 0) val += MOD; return *this; } constexpr Fp& operator *= (const Fp& r) noexcept { val = val * r.val % MOD; return *this; } constexpr Fp& operator /= (const Fp& r) noexcept { long long a = r.val, b = MOD, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } val = val * u % MOD; if (val < 0) val += MOD; return *this; } constexpr bool operator == (const Fp& r) const noexcept { return this->val == r.val; } constexpr bool operator != (const Fp& r) const noexcept { return this->val != r.val; } friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept { return os << x.val; } friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept { if (n == 0) return 1; auto t = modpow(a, n / 2); t = t * t; if (n & 1) t = t * a; return t; } }; const int MAX = 2100000; const int MOD = 1000000007; using mint = Fp<MOD>; int main() { long long lp; cin >> lp; vector<mint> b(MAX, 0); mint p = lp; b[2] = 1, b[3] = p * 2; for (int n = 4; n < MAX; ++n) { b[n] = b[n-1]*p*2 - b[n-2]*(p*p-2) - b[n-3]*p*2 - b[n-4]; } int Q; cin >> Q; for (int _ = 0; _ < Q; ++_) { int q; cin >> q; q -= 2; cout << b[q] << endl; } }