結果

問題 No.1269 I hate Fibonacci Number
ユーザー tokusakuraitokusakurai
提出日時 2020-10-23 23:37:23
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 7,498 bytes
コンパイル時間 3,042 ms
コンパイル使用メモリ 228,820 KB
実行使用メモリ 31,360 KB
最終ジャッジ日時 2024-07-21 13:34:02
合計ジャッジ時間 5,022 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 5 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 3 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 3 ms
5,376 KB
testcase_13 AC 14 ms
11,264 KB
testcase_14 AC 48 ms
13,440 KB
testcase_15 AC 9 ms
5,376 KB
testcase_16 AC 49 ms
10,752 KB
testcase_17 AC 4 ms
5,376 KB
testcase_18 AC 50 ms
11,392 KB
testcase_19 AC 37 ms
9,216 KB
testcase_20 AC 11 ms
5,376 KB
testcase_21 AC 30 ms
8,192 KB
testcase_22 AC 29 ms
7,552 KB
testcase_23 AC 29 ms
8,064 KB
testcase_24 AC 16 ms
5,376 KB
testcase_25 AC 20 ms
6,272 KB
testcase_26 AC 4 ms
5,376 KB
testcase_27 RE -
testcase_28 AC 6 ms
5,376 KB
testcase_29 AC 20 ms
6,272 KB
testcase_30 AC 8 ms
5,376 KB
testcase_31 AC 46 ms
15,872 KB
testcase_32 AC 19 ms
6,144 KB
testcase_33 AC 44 ms
31,360 KB
testcase_34 RE -
testcase_35 AC 8 ms
5,376 KB
testcase_36 AC 8 ms
5,376 KB
testcase_37 AC 2 ms
5,376 KB
testcase_38 AC 8 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const double pi = acos(-1.0);
const double EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y){
    if(x < y) {x = y; return true;}
    return false;
}
template<typename T> bool chmin(T &x, const T &y){
    if(x > y) {x = y; return true;}
    return false;
}
template<typename T> void in(T &x){
    cin >> x;
}
template<typename T> void out(T x){
    cout << x << '\n';
}
template<typename T> void out2(T x){
    cout << x << ' ';
}
template<typename T, typename U> void in(pair<T, U> &p){
    cin >> p.first >> p.second;
}
template<typename T, typename U> void out(pair<T, U> p){
    cout << p.first << ' ' << p.second << '\n';
}
using vi = vector<int>;
using vll = vector<ll>;
#define vec(type, name, a, x) vector<type> name(a, x)
#define VEC(type, a, x) vector<type>(a, x)
#define vec2(type, name, a, b, x) vector<vector<type>> name(a, VEC(type, b, x))
#define VEC2(type, a, b, x) vector<vector<type>>(a, VEC(type, b, x))
#define vec3(type, name, a, b, c, x) vector<vector<vector<type>>> name(a, VEC2(type, b, c, x))
#define VEC3(type, a, b, c, x) vector<vector<vector<type>>>(a, VEC2(type, b, c, x))
#define vec4(type, name, a, b, c, d, x) vector<vector<vector<vector<type>>>> name(a, VEC3(type, b, c, d, x))
#define VEC4(type, a, b, c, d, x) vector<vector<vector<vector<type>>>>(a, VEC3(type, b, c, d, x))
#define vec5(type, name, a, b, c, d, e, x) vector<vector<vector<vector<vector<type>>>>> name(a, VEC4(type, b, c, d, e, x))
#define VEC5(type, a, b, c, d, e, x) vector<vector<vector<vector<vector<type>>>>>(a, VEC4(type, b, c, d, e, x))
template<typename T> void in(vector<T> &a){
    rep(i, sz(a)) cin >> a[i];
}
template<typename T> void out(const vector<T> &a){
    for(auto &e: a) cout << e << '\n';
}
template<typename T> void out2(const vector<T> &a){
    for(auto &e: a) cout << e << ' '; cout << '\n';
}
template<typename T> void unique(vector<T> &a){
    sort(all(a)), a.erase(unique(all(a)), a.end());
}
vector<int> iota(int n){
    vector<int> ret(n);
    iota(all(ret), 0);
    return ret;
}
template<typename T> vector<int> iota(const vector<T> &a, bool greater = false){
    vector<int> ret = iota(sz(a));
    sort(all(ret), [&](int i, int j){
        return (a[i] < a[j])^greater;
    });
    return ret;
}
struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;
const int MOD = 1000000007;
//const int MOD = 998244353;

template<int mod>
struct Mod_Int{
    ll x;

    Mod_Int() : x(0) {}

    Mod_Int(ll y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    Mod_Int &operator += (const Mod_Int &p){
        x = (x + p.x) % mod;
        return *this;
    }

    Mod_Int &operator -= (const Mod_Int &p){
        x = (x + mod - p.x) % mod;
        return *this;
    }

    Mod_Int &operator *= (const Mod_Int &p){
        x = (x * p.x) % mod;
        return *this;
    }

    Mod_Int &operator /= (const Mod_Int &p){
        *this *= p.inverse();
        return *this;
    }

    Mod_Int &operator ++ () {return *this += Mod_Int(1);}

    Mod_Int operator ++ (int){
        Mod_Int tmp = *this;
        ++*this;
        return tmp;
    }

    Mod_Int &operator -- () {return *this -= Mod_Int(1);}

    Mod_Int operator -- (int){
        Mod_Int tmp = *this;
        --*this;
        return tmp;
    }

    Mod_Int operator - () const {return Mod_Int(-x);}

    Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;}

    Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;}

    Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;}

    Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;}

    bool operator == (const Mod_Int &p) const {return x == p.x;}

    bool operator != (const Mod_Int &p) const {return x != p.x;}

    Mod_Int inverse() const {
        assert(*this != Mod_Int(0));
        return pow(mod-2);
    }

    Mod_Int pow(ll k) const{
        Mod_Int now = *this, ret = 1;
        while(k){
            if(k&1) ret *= now;
            now *= now, k >>= 1;
        }
        return ret;
    }

    friend ostream &operator << (ostream &os, const Mod_Int &p){
        return os << p.x;
    }

    friend istream &operator >> (istream &is, Mod_Int &p){
        ll a;
        is >> a;
        p = Mod_Int<mod>(a);
        return is;
    }
};

template<int mod>
struct Combination{
    using Mint = Mod_Int<mod>;
    vector<Mint> _fac, _ifac;

    Combination(int n){
        _fac.resize(n+1), _ifac.resize(n+1);
        _fac[0] = 1;
        rep2(i, 1, n) _fac[i] = _fac[i-1]*i;
        _ifac[n] = _fac[n].inverse();
        rep3(i, n, 1) _ifac[i-1] = _ifac[i]*i;
    }

    Mint fac(int k) const {return _fac[k];}

    Mint ifac(int k) const {return _ifac[k];}

    Mint comb(int n, int k) const{
        if(k < 0 || n < k) return 0;
        return fac(n) * ifac(n-k) * ifac(k);
    }

    Mint perm(int n, int k) const{
        if(k < 0 || n < k) return 0;
        return fac(n) * ifac(n-k);
    }

    Mint second_stirling_number(ll n, int k){ //n個の区別できるボールをk個の区別できない箱に分割
        Mint ret = 0;
        rep(i, k+1){
            Mint tmp = comb(k, i)*Mint(k-i).pow(n);
            ret += ((i&1)? -tmp : tmp);
        }
        return ret*ifac(k);
    }
};

using mint = Mod_Int<MOD>;
using comb = Combination<MOD>;

string tos(ll x){
    string ret;
    while(x){
        ret = char('0'+(x%10))+ret;
        x /= 10;
    }
    return ret;
}

int main(){
    int N; ll L, R;
    in(N), in(L), in(R);
    vector<ll> F;
    F.eb(1), F.eb(1);
    int ptr = 0;
    while(true){
        ll x = F[ptr]+F[ptr+1];
        if(x > R) break;
        F.eb(x), ptr++;
    }
    vector<string> P;

   rep2(i, 1, sz(F)-1){
        if(F[i] >= L) P.eb(tos(F[i]));
    }

    vec2(int, nxt, 20*sz(P), 10, -1);
    vec(bool, ng, 20*sz(P), false);
    vector<string> pfx;
    int n = sz(P);
    rep(i, n){
        rep(j, sz(P[i])+1){
            pfx.eb(P[i].substr(0, j));
        }
    }
    unique(pfx);
    //each(e, pfx) out(e);

    int K = sz(pfx);
    rep(i, K){
        rep(j, n){
            int a = sz(P[j]), b = sz(pfx[i]);
            if((a <= b) && (pfx[i].substr(b-a, a) == P[j])) ng[i] = true;
        }
        rep(j, 10){
            string s = pfx[i]+char('0'+j);
            int k;
            for(;;){
                k = lower_bound(all(pfx), s)-pfx.begin();
                if(k < K && pfx[k] == s) break;
                s = s.substr(1); 
            }
            nxt[i][j] = k;
        }
    }

    vec2(mint, dp, N+1, K, 0);
    dp[0][0] = 1;

    rep(i, N){
        rep(j, K){
            if(dp[i][j] == 0) continue;
            rep(k, 10){
                int nj = nxt[j][k];
                if(ng[nj]) continue;
                dp[i+1][nj] += dp[i][j];
            }
        }
    }

    mint ans = 0;
    rep(i, K) ans += dp[N][i];
    out(--ans);
}
0