結果

問題 No.194 フィボナッチ数列の理解(1)
ユーザー pitP
提出日時 2023-02-08 00:46:31
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
MLE  
実行時間 -
コード長 3,888 bytes
コンパイル時間 3,920 ms
コンパイル使用メモリ 258,780 KB
最終ジャッジ日時 2025-02-10 11:28:03
ジャッジサーバーID
(参考情報)
judge1 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 32 TLE * 1 MLE * 4
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); }
typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
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; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};
template<typename T>
void print_2dvector(vector<vector<T>> &vec){
int H = vec.size();
for(int i=0;i<H;i++){
cout << i << ' ' << '[';
for(int j=0;j<vec[i].size();j++){
if (j) cout << ',' << ' ';
cout << vec[i][j];
}
cout << ']' << endl;
}
}
template<typename T>
void print_vector(vector<T> &vec){
int N = vec.size();
cout << '[';
for(int i=0;i<N;i++){
if (i) cout << ',' << ' ';
cout << vec[i];
}
cout << ']' << endl;
}
#ifdef LOCAL
# include <debug_print.hpp>
# define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
# define debug(...) (static_cast<void>(0))
#endif
using mint = modint1000000007;
// https://outline.hatenadiary.jp/entry/2020/07/02/205628
template<typename T>
struct Kitamasa{
vector<T> a; //
vector<T> d; //
int k;
Kitamasa(vector<T>& a, vector<T>& d) : a(a), d(d), k((int)a.size()) {}
// a_n
vector<T> dfs(ll n){
if(n == k) return d;
vector<T> res(k);
if(n & 1 || n < k * 2){
vector<T> x = dfs(n - 1);
for(int i = 0; i < k; ++i) res[i] = d[i] * x[k - 1];
for(int i = 0; i + 1 < k; ++i) res[i + 1] += x[i];
}
else{
vector<vector<T>> x(k, vector<T>(k));
x[0] = dfs(n >> 1);
for(int i = 0; i + 1 < k; ++i){
for(int j = 0; j < k; ++j) x[i + 1][j] = d[j] * x[i][k - 1];
for(int j = 0; j + 1 < k; ++j) x[i + 1][j + 1] += x[i][j];
}
for(int i = 0; i < k; ++i){
for(int j = 0; j < k; ++j){
res[j] += x[0][i] * x[i][j];
}
}
}
return res;
}
// a_n
T calc(ll n){
vector<T> x = dfs(n);
T res = 0;
for(int i = 0; i < k; ++i) res += x[i] * a[i];
return res;
}
};
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
ll N,K; cin >> N >> K;
vector<mint> a(N);
rep(i,N) cin >> a[i];
//
vector<mint> coef(N+1,0);
coef[0] = mint(-1);
coef[N] = mint(2);
vector<mint> b(N+1,0);
for(int i=0;i<N;i++){
b[i+1] = b[i] + a[i];
}
Kitamasa hoge(b,coef);
auto res = hoge.dfs(K);
debug(res);
auto f_k = hoge.calc(K) - hoge.calc(K-1);
cout << f_k << ' ' << hoge.calc(K) << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0