結果

問題 No.1269 I hate Fibonacci Number
ユーザー n_vipn_vip
提出日時 2020-10-23 22:50:02
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 134 ms / 3,000 ms
コード長 8,776 bytes
コンパイル時間 2,046 ms
コンパイル使用メモリ 154,000 KB
実行使用メモリ 17,308 KB
最終ジャッジ日時 2023-09-28 17:14:39
合計ジャッジ時間 6,371 ms
ジャッジサーバーID
(参考情報)
judge12 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 57 ms
16,200 KB
testcase_01 AC 54 ms
16,336 KB
testcase_02 AC 58 ms
16,900 KB
testcase_03 AC 57 ms
16,084 KB
testcase_04 AC 54 ms
16,492 KB
testcase_05 AC 58 ms
16,140 KB
testcase_06 AC 57 ms
16,128 KB
testcase_07 AC 55 ms
16,464 KB
testcase_08 AC 55 ms
16,276 KB
testcase_09 AC 56 ms
16,204 KB
testcase_10 AC 55 ms
16,464 KB
testcase_11 AC 56 ms
16,564 KB
testcase_12 AC 56 ms
16,468 KB
testcase_13 AC 81 ms
16,948 KB
testcase_14 AC 85 ms
16,924 KB
testcase_15 AC 60 ms
16,776 KB
testcase_16 AC 79 ms
16,900 KB
testcase_17 AC 59 ms
16,600 KB
testcase_18 AC 81 ms
16,916 KB
testcase_19 AC 76 ms
16,720 KB
testcase_20 AC 61 ms
16,600 KB
testcase_21 AC 72 ms
16,900 KB
testcase_22 AC 68 ms
16,712 KB
testcase_23 AC 71 ms
16,640 KB
testcase_24 AC 65 ms
16,920 KB
testcase_25 AC 66 ms
16,680 KB
testcase_26 AC 59 ms
16,496 KB
testcase_27 AC 58 ms
16,288 KB
testcase_28 AC 59 ms
16,980 KB
testcase_29 AC 63 ms
16,588 KB
testcase_30 AC 63 ms
16,568 KB
testcase_31 AC 93 ms
17,112 KB
testcase_32 AC 69 ms
16,884 KB
testcase_33 AC 134 ms
17,308 KB
testcase_34 AC 58 ms
16,216 KB
testcase_35 AC 58 ms
16,028 KB
testcase_36 AC 62 ms
17,284 KB
testcase_37 AC 58 ms
16,204 KB
testcase_38 AC 58 ms
17,292 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#include<random>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (int)(Y);++(X))
#define reps(X,S,Y) for (int (X) = (int)(S);(X) < (int)(Y);++(X))
#define rrep(X,Y) for (int (X) = (int)(Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (int)(Y)-1;(X) >= (int)(S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl
#define NL <<"\n"
#define cauto const auto

using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<class T> using vv=vector<vector<T>>;
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#include "benri.h"
#else
#define out(args...)
#endif
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
template<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;}
template<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;}
template<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;}
template<class T=ll> T read(){ T re; cin>>re; return move(re);}
template<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;}
template<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return move(re);}
template<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return move(re);}
vv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return move(g);}
vv<int> readG(const int &n){ return readG(n,n-1);}
const ll MOD=1e9+7; //998244353


class Matcher{
public:
  struct PMA{
    int next[256];
		bool ac;
    PMA(){fill(next,next+256,-1); ac=false;}
  };
  vector<PMA> states;

  Matcher(const vector<string> &pats){
    states.pb(PMA());
    rep(i,pats.size()){
      int cur=0;
      for(const char &c:pats[i]){
				if(states[cur].next[c]<0){
					states[cur].next[c]=states.size();
					states.pb(PMA());
				}
				cur=states[cur].next[c];
      }
      states[cur].ac=1;
    }
    queue<int> q;
    rep(c,256)if(c){
      if(states[0].next[c]>=0){
				states[states[0].next[c]].next[0]=0;
				q.push(states[0].next[c]);
      }else{
				states[0].next[c]=0;
      }
    }
    while(!q.empty()){
      int t=q.front();
      q.pop();
      rep(c,256)if(c){
				if(states[t].next[c]>=0){
					q.push(states[t].next[c]);
					int r=states[t].next[0];
					while(states[r].next[c]<0){r=states[r].next[0];}
					states[states[t].next[c]].next[0]=states[r].next[c];
				}
      }
    }
    for(int i=0;i<pats.size();++i){
      const string &pat=pats[i];
      rep(j,states.size())if(j){
				int cur=j,k=0;
				for(;k<pat.size();++k){
					if(states[cur].next[pat[k]]<0) break;
					cur=states[cur].next[pat[k]];
				}
				if(k==pat.size()) states[cur].ac=1;
      }
    }
  }
  int match(const string &str,int ac,int state=0){
    rep(i,str.size()){
      char c=str[i];
      while(states[state].next[c]<0){state=states[state].next[0];}
      state=states[state].next[c];
			if(states[state].ac) ac=1;
    }
    return state;
  }
  int stateNum() const {return states.size();}
};

ll modpow_(ll r,ll n,ll m=MOD){
  ll re=1,d=r%m;
  if(n<0)(n%=m-1)+=m-1;
  for(;n;n/=2){
    if(n&1)(re*=d)%=m;
    (d*=d)%=m;
  }
  return re;
}
template <int mod=MOD> struct ModInt{
  int v;
  ModInt(int v=0):v(v){}
  ModInt operator+(const ModInt &n)const{return v+n.v<mod ? v+n.v : v+n.v-mod;}
  ModInt operator-(const ModInt &n)const{return v-n.v<0 ? v-n.v+mod : v-n.v;}
  ModInt operator*(const ModInt &n)const{return ll(v)*n.v%mod;}
  ModInt operator/(const ModInt &n)const{return ll(v)*modpow_(n.v%mod,-1,mod)%mod;}
  ModInt operator+(const ll &n)const{return v+n<mod ? v+n : v+n-mod;}
  ModInt operator-(const ll &n)const{return v-n<0 ? v-n+mod : v-n;}
  ModInt operator*(const ll &n)const{return ll(v)*(n%mod)%mod;}
  ModInt operator/(const ll &n)const{return ll(v)*modpow_(n%mod,-1,mod)%mod;}
  ModInt& operator+=(const ModInt &n){v+=n.v; if(v>=mod) v-=mod; return *this;}
  ModInt& operator-=(const ModInt &n){v-=n.v; if(v<0) v+=mod; return *this;}
  ModInt& operator*=(const ModInt &n){v=ll(v)*n.v%mod; return *this;}
  ModInt& operator/=(const ModInt &n){v=ll(v)*modpow_(n.v,-1,mod)%mod; return *this;}
  ModInt& operator+=(const ll &n){v+=n; if(v>=mod) v-=mod; return *this;}
  ModInt& operator-=(const ll &n){v-=n; if(v<0) v+=mod; return *this;}
  ModInt& operator*=(const ll &n){v=ll(v)*n%mod; return *this;}
  ModInt& operator/=(const ll &n){v=ll(v)*modpow_(n,-1,mod)%mod; return *this;}
	bool operator==(const ModInt &n)const{return v==n.v;};
	bool operator!=(const ModInt &n)const{return v!=n.v;};
	ModInt& operator++(){ return operator+=(1); }
	ModInt& operator--(){ return operator-=(1); }
	ModInt operator++(int i){ ModInt tmp(*this); operator++(); return tmp; }
	ModInt operator--(int i){ ModInt tmp(*this); operator--(); return tmp; }
};
#ifdef NUIP
class MINT_FRAC____{
public:
	unordered_map<int,pii> dict;
	MINT_FRAC____(int n){
		rep(p,n+1)reps(q,1,n+1)if(__gcd(p,q)==1){
			dict[1ll*p*modpow_(q,-1)%MOD]=pii(p,q);
			dict[MOD-1ll*p*modpow_(q,-1)%MOD]=pii(-p,q);
		}
	}
} Il1Il1Il1(1000);
template<int mod> ostream& operator<<(ostream &os,const ModInt<mod> &n){if(Il1Il1Il1.dict.count(n.v)) os<<n.v<<"("<<Il1Il1Il1.dict[n.v].X<<"/"<<Il1Il1Il1.dict[n.v].Y<<")";else os<<n.v;return os;};
#else
template<int mod> ostream& operator<<(ostream &os,const ModInt<mod> &n){return os<<n.v;};
#endif
template<int mod> ModInt<mod> operator+(const ll &n,const ModInt<mod> &m){return m.v+n<mod ? m.v+n : m.v+n-mod;}
template<int mod> ModInt<mod> operator-(const ll &n,const ModInt<mod> &m){return n-m.v<0 ? n-m.v+mod : n-m.v;}
template<int mod> ModInt<mod> operator*(const ll &n,const ModInt<mod> &m){return ll(m.v)*(n%mod)%mod;}
template<int mod> ModInt<mod> operator/(const ll &n,const ModInt<mod> &m){return ModInt<mod>(n%mod)/m;}
typedef ModInt<MOD> mint;
template <int mod> ModInt<mod> modpow(ModInt<mod> r,ll n){ ModInt<mod> re(1); if(n<0)(n%=mod-1)+=mod-1; for(;n;n/=2){if(n&1) re*=r; r*=r;} return re;}
vector<mint> fact,finv,inv;
mint comb(ll n,ll r){ if(n<r||r<0)return 0; return fact[n]*finv[n-r]*finv[r];}
class Doralion{
  void Modinvs(vector<mint> &re,int n){ re.resize(n+1); re[1]=1; for(int i=2;i<=n;++i)re[i]=re[MOD%i]*(MOD-MOD/i);}
  void Facts(vector<mint> &re,int n){ re.resize(n+1); re[0]=1; rep(i,n)re[i+1]=re[i]*(i+1);}
  void Factinvs(vector<mint> &re,const vector<mint> &inv,int n){ re.resize(n+1); re[0]=1; rep(i,n)re[i+1]=re[i]*inv[i+1];}
public:
  Doralion(int n){ Modinvs(inv,n); Facts(fact,n); Factinvs(finv,inv,n);}
} doralion(1123456);
using pmm=pair<mint,mint>;
mint modpow(ll r,ll n){ return modpow_(r,n);}


int main(){
  ios_base::sync_with_stdio(false); cin.tie(0);
  cout<<fixed<<setprecision(0);
	vector<ll> fib{1,2};
	while(fib.back()<=1e18) fib.eb(fib[fib.size()-2]+fib.back());
	out(fib.size(),1);
	cauto n=read();
	cauto l=read();
	cauto r=read();
	vector<string> ban;
	for(cauto x:fib)if(l<=x && x<=r) ban.eb(to_string(x));
	Matcher aho(ban);
	cauto m=aho.stateNum();
	out(m,1);
	auto g=table(m,10,0);
	rep(v,m)reps(c,'0','9'+1){
		auto state=v;
		while(aho.states[state].next[c]<0){state=aho.states[state].next[0];}
		g[v][c-'0']=aho.states[state].next[c];
	}
	vector<mint> cur(m,0);
	reps(i,1,10) cur[g[0][i]]+=1;
	mint re=0;
	rep(_,n){
		rep(v,m)if(aho.states[v].ac) cur[v]=0;
		re+=accumulate(all(cur),mint(0));
		vector<mint> nxt(m,0);
		rep(v,m)rep(c,10) nxt[g[v][c]]+=cur[v];
		cur=nxt;
		out(cur,1);
	}
	cout<<re NL;
  return 0;
}
0