結果
問題 | No.978 Fibonacci Convolution Easy |
ユーザー | kei |
提出日時 | 2020-01-31 21:40:26 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 32 ms / 2,000 ms |
コード長 | 2,230 bytes |
コンパイル時間 | 1,813 ms |
コンパイル使用メモリ | 170,268 KB |
実行使用メモリ | 18,852 KB |
最終ジャッジ日時 | 2024-09-18 20:52:24 |
合計ジャッジ時間 | 2,716 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 14 ms
9,224 KB |
testcase_02 | AC | 9 ms
6,944 KB |
testcase_03 | AC | 29 ms
18,060 KB |
testcase_04 | AC | 10 ms
6,940 KB |
testcase_05 | AC | 4 ms
6,940 KB |
testcase_06 | AC | 14 ms
8,292 KB |
testcase_07 | AC | 21 ms
12,776 KB |
testcase_08 | AC | 14 ms
9,732 KB |
testcase_09 | AC | 23 ms
14,212 KB |
testcase_10 | AC | 31 ms
18,632 KB |
testcase_11 | AC | 12 ms
7,528 KB |
testcase_12 | AC | 4 ms
6,940 KB |
testcase_13 | AC | 13 ms
8,200 KB |
testcase_14 | AC | 5 ms
6,944 KB |
testcase_15 | AC | 14 ms
8,948 KB |
testcase_16 | AC | 32 ms
18,852 KB |
testcase_17 | AC | 31 ms
18,680 KB |
testcase_18 | AC | 2 ms
6,940 KB |
testcase_19 | AC | 2 ms
6,944 KB |
testcase_20 | AC | 2 ms
6,940 KB |
ソースコード
#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int INF = 1e9; const ll LINF = 1e18; template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; } template<class T> ostream& operator << (ostream& out,const vector<T>& V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; } template<class T> ostream& operator << (ostream& out,const vector<vector<T> >& Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; } template<class S,class T> ostream& operator << (ostream& out,const map<S,T>& mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; } template<typename T>vector<T> make_v(size_t a){return vector<T>(a);} template<typename T,typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));} template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;} template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);} /* <url:> 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ constexpr ll MOD = 1e9+7; template<class Type> Type solve(Type res = Type()){ ll N,p; cin >> N >> p; ll sumA = 0; vector<ll> a(N+1); a[1] = 0; a[2] = 1; for(int n = 3; n <= N;n++){ a[n] = p*a[n-1] + a[n-2]; a[n] %= MOD; } for(int n = 1; n <= N;n++){ sumA += a[n]; sumA %=MOD; res += a[n] * sumA %MOD; res %=MOD; } return res; } int main(void) { cin.tie(0); ios::sync_with_stdio(false); //solve<ll>(0); cout << fixed << setprecision(12) << solve<ll>() << endl; return 0; }