結果
| 問題 |
No.1269 I hate Fibonacci Number
|
| コンテスト | |
| ユーザー |
 kei
|
| 提出日時 | 2020-10-24 02:14:43 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 445 ms / 3,000 ms |
| コード長 | 6,013 bytes |
| コンパイル時間 | 2,253 ms |
| コンパイル使用メモリ | 187,408 KB |
| 実行使用メモリ | 6,944 KB |
| 最終ジャッジ日時 | 2024-07-21 14:47:32 |
| 合計ジャッジ時間 | 5,574 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 36 |
ソースコード
#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;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
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:>
問題文============================================================
=================================================================
解説=============================================================
================================================================
*/
/*-------Aho Corasick Setting---------*/
const int Alphabets = 10;
const int AlphabetBase = '0' ; // '0'
/*------------------------------------*/
class Aho_Corasick{
public:
struct PMA{
PMA *fail;
PMA *next[Alphabets];
vector<int> accepts; // accepts id
PMA():fail(NULL){memset(next,0,sizeof next);}
~PMA() { delete fail; for(int i = 0; i < Alphabets ; i++) delete next[i];}
};
PMA *Root;
int PatternSize;
// O( Σ]|p[i]| Alphabets )
void buildMPA(vector<string>& pattern){
PatternSize = (int)pattern.size();
PMA *root = new PMA, *now;
root->fail = root;
for(int i = 0 ; i < (int)pattern.size(); i++){
now = root;
for(int j = 0 ; j < (int)pattern[i].size(); j++){
int c = pattern[i][j] - AlphabetBase;
if(now->next[c]==NULL)now->next[c] = new PMA;
now = now->next[c];
}
now->accepts.push_back(i);
}// Trie
queue<PMA*> Q;
for(int i = 0; i < Alphabets; i++){
if(root -> next[i] == NULL){
root -> next[i] = root;
}else {
root->next[i] -> fail = root;
Q.push(root->next[i]);
}
}
while(!Q.empty()){
now = Q.front(); Q.pop();
for(int i = 0; i < Alphabets; i++){
if(now->next[i]){
PMA *nxt = now->fail;
while(nxt->next[i] == NULL)nxt = nxt -> fail;
now-> next[i]->fail = nxt -> next[i];
now->next[i]->accepts = mergev(now->next[i]->accepts, nxt->next[i]->accepts );
Q.push(now->next[i]);
}
}
}
Root = root;
}
// target S , res:include id (exist or times). O( |S| + Σ|p[i]| )
PMA* match(PMA* pma, string &S, vector<int> &res){
res.resize(PatternSize,0);
for(int i = 0; i < (int)S.size(); i++){
int c = S[i] - AlphabetBase;
while(pma -> next[c] == NULL){
pma = pma -> fail;
}
pma = pma -> next[c];
for(int j = 0; j < (int)pma->accepts.size(); j++ ){
res[pma->accepts[j]] ++; //not sum if sum, vec++
}
}
return pma;
}
// on not need result
PMA* NextStep(PMA* pma, char cc){
int c = cc- AlphabetBase;
while(pma->next[c] == NULL )pma = pma->fail;
pma = pma-> next[c];
return pma;
}
private:
// unique and merge
vector<int> mergev(vector<int> &a, vector<int> &b){
vector<int> target;
set_union(a.begin(),a.end(),b.begin(),b.end(), back_inserter(target));
return target;
}
};
const ll MOD = 1e9+7;
template<class Type>
Type solve(Type res = Type()){
ll N,L,R; cin >> N >> L >> R;
vector<string> Fs;
{
ll Fl = 1,Fr = 1;
while(Fr <= R){
if(Fr >= L) Fs.emplace_back(to_string(Fr));
ll T = Fr;
Fr = Fr + Fl;
Fl = T;
}
}
// cout << Fs << endl;
// cout << Fs.size() << endl;
Aho_Corasick aho;
aho.buildMPA(Fs);
int cur = 0,next = 1;
Aho_Corasick::PMA* root = aho.Root;
map<Aho_Corasick::PMA*,ll> dp[2];
dp[0][root] = 1;
for(int i = 0; i < N;i++){
dp[next].clear();
for(auto p : dp[cur]){
Aho_Corasick::PMA* pma = p.first;
ll cnt = p.second;
for(int j = 0; j < 10;j++){
auto next_pma = aho.NextStep(pma,'0'+j);
if(next_pma == NULL){
(dp[next][root] += cnt) %= MOD;
}else{
if(next_pma->accepts.size() != 0) continue;
(dp[next][next_pma] += cnt) %= MOD;
}
}
}
swap(cur,next);
}
for(auto p:dp[cur]){
(res += p.second) %= MOD;
}
res = (res - 1 + MOD)%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;
}