結果
| 問題 | No.1269 I hate Fibonacci Number |
| ユーザー |
👑  tute7627
|
| 提出日時 | 2020-10-23 23:22:30 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 120 ms / 3,000 ms |
| コード長 | 8,124 bytes |
| コンパイル時間 | 2,566 ms |
| コンパイル使用メモリ | 219,720 KB |
| 最終ジャッジ日時 | 2025-01-15 14:03:18 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 36 |
ソースコード
//#define _GLIBCXX_DEBUG#include<bits/stdc++.h>using namespace std;#define endl '\n'#define lfs cout<<fixed<<setprecision(10)#define ALL(a) (a).begin(),(a).end()#define ALLR(a) (a).rbegin(),(a).rend()#define spa << " " <<#define fi first#define se second#define MP make_pair#define MT make_tuple#define PB push_back#define EB emplace_back#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)using ll = long long;using ld = long double;const ll MOD1 = 1e9+7;const ll MOD9 = 998244353;const ll INF = 1e18;using P = pair<ll, ll>;template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());int popcount(ll x){return __builtin_popcountll(x);};int poplow(ll x){return __builtin_ctzll(x);};int pophigh(ll x){return 63 - __builtin_clzll(x);};template<long long iden, long long size>struct Trie{struct Node{vector<ll>next,idx;ll num, failure, len;Node(ll l):num(0), failure(-1), len(l){next.assign(size,-1);}};vector<Node>data;Trie(){data.emplace_back(0);}ll add(const string &s, ll id){ll pos=0;for(ll i=0;i<s.size();i++){ll c = s[i] - iden;if(data[pos].next[c]==-1){data[pos].next[c]=data.size();data.emplace_back(i+1);}data[pos].num++;pos = data[pos].next[c];}data[pos].num++;data[pos].idx.push_back(id);return pos;}ll append(ll pos,char cc){ll c = cc - iden;if(data[pos].next[c]==-1){data[pos].next[c]=data.size();data.emplace_back(0);}pos=data[pos].next[c];return pos;}void search(const string &s){ll pos=0;for(ll i=0;i<s.size();i++){ll c = s[i] - iden;if(data[pos].next[c]==-1)break;pos = data[pos].next[c];}}vector<ll>v;void dfs(ll pos, ll d){for(ll i=0;i<size;i++){if(data[pos].next[i]!=-1){dfs(data[pos].next[i], d+1);}}}vector<string>str;void build_str(ll pos=0,string s=""){while(str.size()<=pos)str.push_back("");str[pos]=s;for(ll i=0;i<size;i++){if(data[pos].next[i]!=-1){build_str(data[pos].next[i],s+char(i+iden));}}}void build_Ahocorasick(){queue<ll>que;que.push(0);data[0].failure = -1;while(!que.empty()){ll pos = que.front();for(ll i=0;i<size;i++){if(data[pos].next[i]==-1)continue;ll now = data[pos].failure;while(now!=-1&&data[now].next[i]==-1)now = data[now].failure;if(now==-1)data[data[pos].next[i]].failure = 0;else data[data[pos].next[i]].failure = data[now].next[i];que.push(data[pos].next[i]);}que.pop();}}vector<ll> aho_search(const string &s){ll now=0;vector<ll>cnt(data.size());for(ll i=0;i<s.size();i++){ll c = s[i] - iden;while(now!=-1&&data[now].next[c]==-1)now=data[now].failure;if(now==-1)now=0;else{now=data[now].next[c];ll pos=now;while(pos!=-1){cnt[pos]++;pos=data[pos].failure;}}}return cnt;}};using trie = Trie<'0',10>;template< int mod >struct ModInt {int x;ModInt() : x(0) {}ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}ModInt operator-() const { return ModInt(-x); }friend ModInt operator+(const ModInt& lhs, const ModInt& rhs) {return ModInt(lhs) += rhs;}friend ModInt operator-(const ModInt& lhs, const ModInt& rhs) {return ModInt(lhs) -= rhs;}friend ModInt operator*(const ModInt& lhs, const ModInt& rhs) {return ModInt(lhs) *= rhs;}friend ModInt operator/(const ModInt& lhs, const ModInt& rhs) {return ModInt(lhs) /= rhs;}bool operator==(const ModInt &p) const { return x == p.x; }bool operator!=(const ModInt &p) const { return x != p.x; }ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;while(b > 0) {t = a / b;swap(a -= t * b, b);swap(u -= t * v, v);}return ModInt(u);}ModInt pow(int64_t n) const {ModInt ret(1), mul(x);while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}friend ostream &operator<<(ostream &os, const ModInt &p) {return os << p.x;}friend istream &operator>>(istream &is, ModInt &a) {int64_t t;is >> t;a = ModInt< mod >(t);return (is);}static int get_mod() { return mod; }};using modint = ModInt< MOD1 >;modint pow(ll n, ll x){return modint(n).pow(x);}modint pow(modint n, ll x){return n.pow(x);}//using modint=ld;int main(){cin.tie(nullptr);ios_base::sync_with_stdio(false);ll res=0,buf=0;bool judge = true;ll n,l,r;cin>>n>>l>>r;trie tri;{vector<ll>dp(2,0);dp[1]=1;rep(i,2,10000){dp.PB(dp[i-1]+dp[i-2]);if(dp[i]>r)break;if(dp[i]<l)continue;tri.add(to_string(dp[i]),i);}}tri.build_Ahocorasick();ll sz=tri.data.size();auto to=vec(sz,10,0LL);vector<bool>ex(sz);rep(i,0,sz){rep(j,0,10){ll now=i;while(now!=0&&tri.data[now].next[j]==-1)now=tri.data[now].failure;if(tri.data[now].next[j]!=-1)now=tri.data[now].next[j];to[i][j]=now;}if(!tri.data[i].idx.empty())ex[i]=true;}{vector<vector<ll>>g(sz);rep(i,1,sz)g[tri.data[i].failure].PB(i);queue<ll>que;que.push(0);while(!que.empty()){auto p=que.front();que.pop();for(auto to:g[p]){if(ex[p])ex[to]=true;que.push(to);}}}/*{tri.build_str();rep(i,0,sz)rep(j,0,10){cout<<tri.str[i] spa j spa tri.str[to[i][j]]<<endl;}rep(i,0,sz)cout<<tri.str[i] spa ex[i]<<endl;}*/auto dp=vec(n+1,sz,modint(0));dp[0][0]=1;rep(i,0,n){rep(j,0,sz){rep(o,0,10){if(ex[to[j][o]])continue;dp[i+1][to[j][o]]+=dp[i][j];}}}modint ret=0;rep(i,0,sz)ret+=dp[n][i];cout<<ret-1<<endl;return 0;}