結果
問題 | No.1269 I hate Fibonacci Number |
ユーザー |
![]() |
提出日時 | 2023-11-28 19:46:58 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 87 ms / 3,000 ms |
コード長 | 4,649 bytes |
コンパイル時間 | 1,494 ms |
コンパイル使用メモリ | 114,288 KB |
実行使用メモリ | 31,232 KB |
最終ジャッジ日時 | 2024-09-26 13:04:12 |
合計ジャッジ時間 | 3,211 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 36 |
ソースコード
#define PROBLEM "https://yukicoder.me/problems/no/430"#line 2 "string/ahocorasick.hpp"#line 2 "string/trie.hpp"#include<vector>#include<string>#include<cstring>using namespace std;template<int char_size,char margin,typename T,T (*e)()>struct trie{struct node{int nxt[char_size];int par;T dat;node(int p):par(p){memset(nxt,-1,sizeof(nxt));dat = e();}};vector<node> nodes;int root;trie(){root = 0;nodes.push_back(node(-1));}int add(int ni,int i,const string&s){if(i==(int)s.size()) return ni;int now = s[i] - margin;if(nodes[ni].nxt[now]==-1){nodes[ni].nxt[now] = nodes.size();nodes.push_back(node(ni));}return add(nodes[ni].nxt[now],i+1,s);}int add(const string&s){return add(root,0,s);}int move(int ni,int i,const string&s){if(i==(int)s.size()) return ni;if(ni==-1) return ni;int now = s[i] - margin;return move(nodes[ni].nxt[now],i+1,s);}int move(int ni,const string&s){return move(ni,0,s);}int move(int ni,const char&c){string s(1,c);return move(ni,0,s);}int getpar(int ni){return nodes[ni].par;}inline T& operator[](int i) {return nodes[i].dat;}inline int size(){return nodes.size();}};/*** @brief Trie* @docs docs/string/trie.md*/#line 4 "string/ahocorasick.hpp"#line 7 "string/ahocorasick.hpp"using namespace std;template<int char_size,int margin,typename T,T (*e)()>struct aho_corasick:trie<char_size,margin,T,e> {vector<int> fail;vector<vector<int>> match;vector<int> bfs;aho_corasick(){}void build(){fail = vector<int>(this->size(),this->root);match = vector<vector<int>>(this->size(),vector<int>(char_size,-1));vector<pair<int,int>> que;vector<int> vis(this->size(),0);que.push_back(make_pair(this->root,this->root));vis[0] = 1;for(int i = 0;i<(int)que.size();i++){int ni = que[i].first;bfs.push_back(ni);int last = que[i].second;int nj = this->getpar(ni);if(ni!=this->root){fail[ni] = match[fail[nj]][last];if(fail[ni]==ni) fail[ni] = this->root;for(int j = 0;j<char_size;j++){if(this->nodes[ni].nxt[j]!=-1) match[ni][j] = this->nodes[ni].nxt[j];else match[ni][j] = match[fail[ni]][j];}}else{for(int j = 0;j<char_size;j++){if(this->nodes[ni].nxt[j]!=-1) match[ni][j] = this->nodes[ni].nxt[j];else match[ni][j] = ni;}}for(int j = 0;j<char_size;j++){if(this->nodes[ni].nxt[j]!=-1) que.push_back(make_pair(this->nodes[ni].nxt[j],j));}}}int move(int ni,int i,const string&s){if(i==(int)s.size()) return ni;return move(match[ni][s[i]-margin],i+1,s);}int move(int ni,const string&s){return move(ni,0,s);}int move(int ni,const char&c){string s(1,c);return move(ni,0,s);}int getfail(int ni){return fail[ni];}vector<int> getbfs(){return bfs;}};/*** @brief Aho-Corasick* @docs docs/string/ahocorasick.md*/#include<algorithm>#include<iostream>#include<vector>#include<cassert>using namespace std;using ll = long long;int e(){return 0;}const ll mod = 1000000007;int main(){cin.tie(nullptr);ios::sync_with_stdio(false);aho_corasick<10,'0',int,e> t;ll n,l,r;cin>>n>>l>>r;vector<ll> fib(100,1);for(int i = 0;i<100;i++){if(i-2>=0) fib[i] = fib[i-1] + fib[i-2];if(r<fib[i]) break;if(l>fib[i]) continue;int ni = t.add(to_string(fib[i]));t[ni] = 1;}t.build();vector<int> no(t.size(),0);for(int i:t.getbfs()) no[i] = t[i] | no[t.fail[i]];vector<vector<ll>> dp(n+1,vector<ll>(t.size(),0));dp[0][0] = 1;for(int i = 0;i<n;i++){for(int j = 0;j<t.size();j++){for(int k = 0;k<10;k++){int nxt = t.move(j,'0'+k);if(no[nxt]==0) dp[i+1][nxt] = (dp[i+1][nxt]+dp[i][j])%mod;}}}ll ans = 0;for(int i = 0;i<t.size();i++) ans = (ans+dp[n][i])%mod;ans = (ans+mod-1)%mod;cout<<ans<<endl;}