結果

問題 No.1269 I hate Fibonacci Number
ユーザー haruki_Kharuki_K
提出日時 2020-10-24 01:18:31
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 268 ms / 3,000 ms
コード長 10,944 bytes
コンパイル時間 2,889 ms
コンパイル使用メモリ 225,840 KB
実行使用メモリ 17,312 KB
最終ジャッジ日時 2023-09-28 19:56:56
合計ジャッジ時間 5,489 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 3 ms
4,380 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 2 ms
4,376 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 2 ms
4,376 KB
testcase_09 AC 2 ms
4,376 KB
testcase_10 AC 1 ms
4,380 KB
testcase_11 AC 2 ms
4,376 KB
testcase_12 AC 1 ms
4,376 KB
testcase_13 AC 65 ms
7,028 KB
testcase_14 AC 86 ms
8,392 KB
testcase_15 AC 9 ms
4,380 KB
testcase_16 AC 54 ms
6,976 KB
testcase_17 AC 3 ms
4,380 KB
testcase_18 AC 60 ms
7,240 KB
testcase_19 AC 44 ms
6,188 KB
testcase_20 AC 12 ms
4,412 KB
testcase_21 AC 38 ms
5,660 KB
testcase_22 AC 32 ms
5,160 KB
testcase_23 AC 36 ms
5,772 KB
testcase_24 AC 17 ms
4,376 KB
testcase_25 AC 22 ms
4,596 KB
testcase_26 AC 3 ms
4,376 KB
testcase_27 AC 2 ms
4,376 KB
testcase_28 AC 12 ms
4,376 KB
testcase_29 AC 21 ms
4,884 KB
testcase_30 AC 9 ms
4,376 KB
testcase_31 AC 111 ms
9,448 KB
testcase_32 AC 22 ms
4,652 KB
testcase_33 AC 268 ms
17,312 KB
testcase_34 AC 3 ms
4,380 KB
testcase_35 AC 7 ms
4,376 KB
testcase_36 AC 2 ms
4,376 KB
testcase_37 AC 2 ms
4,376 KB
testcase_38 AC 2 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> TEMPLATES

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x,l,r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf<int32_t>;
auto constexpr INF64 = inf<int64_t>;
auto constexpr INF   = inf<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
// [a,b]
template <class Int> Int rand(Int a, Int b) { static mt19937_64 mt{random_device{}()}; return uniform_int_distribution<Int>(a,b)(mt); }
i64 irand(i64 a, i64 b) { return rand<i64>(a,b); }
u64 urand(u64 a, u64 b) { return rand<u64>(a,b); }

// <<<

// >>> Aho-Corasick
template <int AlphabetSize> struct PMA {
    using i32 = int32_t;
    struct Node {
        vector<i32> next, go;
        i32 fail = -1;
        bool ac = false;
        Node() : next(AlphabetSize,-1), go(AlphabetSize,-1) {}
    };
    vector<Node> t;
    bool built = false;

    PMA() : t(1) {}

    int size() const { return t.size(); }
    Node& operator[](size_t idx) { return t[idx]; }
    Node const& operator[](size_t idx) const { return t[idx]; }

    template <class Str> void add(Str const& s, i32 offset) {
        int x = 0;
        for (auto c : s) {
            c -= offset;
            assert(0 <= c && c < AlphabetSize);
            if (t[x].next[c] < 0) t[x].next[c] = t.size(), t.emplace_back();
            x = t[x].next[c];
        }
        t[x].ac = true;
        built = false;
    }

    void build() {
        queue<int> q;
        t[0].fail = 0;
        for (int x : t[0].next) {
            if (x < 0) continue;
            t[x].fail = 0;
            q.push(x);
        }
        while (q.size()) {
            int x = q.front(); q.pop();
            rep (c,AlphabetSize) {
                int y = t[x].next[c];
                if (y < 0) continue;
                q.push(y);
                int z = t[x].fail;
                while (z > 0 && t[z].next[c] < 0) z = t[z].fail;
                t[y].fail = max<int>(0, t[z].next[c]);
            }
        }
        built = true;
    }

    int go(int x, int c) {
        assert(built);
        i32 &ret = t[x].go[c];
        if (ret >= 0) return ret;
        if (t[x].next[c] >= 0) return ret = t[x].next[c];
        return ret = (x == 0 ? 0 : go(t[x].fail, c));
    }

    int next_match(int x) { // excluding x
        assert(built);
        static vector<int> ret;
        if (ret.empty()) ret.resize(size(),-2);
        int &y = ret[x];
        if (y != -2) return y;
        y = t[x].fail;
        while (y > 0 && not t[y].ac) y = t[y].fail;
        if (not t[y].ac) y = -1;
        return y;
    }

    vector<vector<int>> show() const {
        vector<vector<int>> ret(size());
        vector<int> a;
        auto dfs = [&](auto dfs, int x) -> void {
            rep (c,AlphabetSize) {
                int y = t[x].next[c];
                if (y < 0) continue;
                a.push_back(c);
                ret[y] = a;
                dfs(dfs, y);
                a.pop_back();
            }
        };
        dfs(dfs,0);
        return ret;
    }
#ifdef LOCAL
    friend string to_s(PMA const& pma) {
        auto v = pma.show();
        string ret = "size : "s + to_string(pma.size()) + "\n";
        rep (x,pma.size()) {
            ret += to_string(x) + " "
                + to_s(pma[x].ac) + " " + to_s(v[x]) + "\n";
        }
        return ret;
    }
#endif

};
// <<<
// >>> modint
template <uint32_t md>
class modint {
    static_assert(md < (1u<<31), "");
    using M = modint;
    using i64 = int64_t;
    uint32_t x;
public:
    static constexpr uint32_t mod = md;
    constexpr modint(i64 x = 0) : x((x%=md) < 0 ? x+md : x) { }
    constexpr i64 val() const { return x; }
    constexpr explicit operator i64() const { return x; }
    constexpr bool operator==(M r) const { return x == r.x; }
    constexpr bool operator!=(M r) const { return x != r.x; }
    constexpr M operator+() const { return *this; }
    constexpr M operator-() const { return M()-*this; }
    constexpr M& operator+=(M r) { x += r.x; x = (x < md ? x : x-md); return *this; }
    constexpr M& operator-=(M r) { x += md-r.x; x = (x < md ? x : x-md); return *this; }
    constexpr M& operator*=(M r) { x = (uint64_t(x)*r.x)%md; return *this; }
    constexpr M& operator/=(M r) { return *this *= r.inv(); }
    constexpr M operator+(M r) const { return M(*this) += r; }
    constexpr M operator-(M r) const { return M(*this) -= r; }
    constexpr M operator*(M r) const { return M(*this) *= r; }
    constexpr M operator/(M r) const { return M(*this) /= r; }
    friend constexpr M operator+(i64 x, M y) { return M(x)+y; }
    friend constexpr M operator-(i64 x, M y) { return M(x)-y; }
    friend constexpr M operator*(i64 x, M y) { return M(x)*y; }
    friend constexpr M operator/(i64 x, M y) { return M(x)/y; }
    constexpr M inv() const { assert(x > 0); return pow(md-2); }
    constexpr M pow(i64 n) const {
        assert(not (x == 0 && n == 0));
        if (n < 0) return inv().pow(-n);
        M v = *this, r = 1;
        for (; n > 0; n >>= 1, v *= v) if (n&1) r *= v;
        return r;
    }
#ifdef LOCAL
    friend string to_s(M r) { return to_s(r.val(), mod); }
#endif
    friend ostream& operator<<(ostream& os, M r) { return os << r.val(); }
    friend istream& operator>>(istream& is, M &r) { i64 x; is >> x; r = x; return is; }
};
// <<<
//constexpr int64_t MOD = 998244353;
constexpr int64_t MOD = 1e9+7;
using mint = modint<MOD>;
mint sgn(int n) { return n%2 == 0 ? +1 : -1; }
// >>> mod table
template <uint32_t mod>
struct ModTable {
    vector<uint32_t> fact = {1,1}, finv = {1,1}, inv = {0,1};
    void calc(int n) {
        int old = fact.size();
        if (n < old) return;
        fact.resize(n+1);
        finv.resize(n+1);
        inv.resize(n+1);
        for (uint32_t i = old; i <= n; i++) {
            fact[i] = uint64_t(fact[i-1])*i % mod;
            inv[i] = mod - uint64_t(inv[mod%i])*(mod/i) % mod;
            finv[i] = uint64_t(finv[i-1])*inv[i] % mod;
        }
    }
};
ModTable<MOD> mod_tab;

modint<MOD> fact(int n) {
    assert(0 <= n);
    return mod_tab.calc(n), mod_tab.fact[n];
}
modint<MOD> finv(int n) {
    assert(0 <= n);
    return mod_tab.calc(n), mod_tab.finv[n];
}
modint<MOD> C(int n, int k) {
    if (n < 0 || k < 0 || n < k) return 0;
    return fact(n)*finv(k)*finv(n-k);
}
modint<MOD> P(int n, int k) {
    assert(k >= 0); assert(n >= k);
    return fact(n)*finv(n-k);
}
// <<<

int32_t main() {
    vector<int> F = {1,1};
    while (true) {
        int x = F.end()[-2] + F.end()[-1];
        if (x > INF) break;
        F.eb(x);
    }
    dump(F.size());

    int n,l,r; cin >> n >> l >> r;

    PMA<10> pma;
    for (int x : F) if (l <= x && x <= r) pma.add(to_string(x), '0');
    pma.build();

    int k = pma.size();
    dump(k);
    auto dp = make_v<mint,2>(n+1,k);
    dp[0][0] = 1;
    rep (i,n) rep (j,k) {
        rep (d,10) {
            int nj = pma.go(j,d);
            if (pma[nj].ac || pma.next_match(nj) >= 0) continue;
            dp[i+1][nj] += dp[i][j];
        }
    }
    // debug {
    //     rep (i,n+1) {
    //         rep (j,k) if (dp[i][j] != 0) dump(i,j,dp[i][j]);
    //     }
    // }

    cout << sumof(all(dp[n]))-1 << endl;

}
0