結果

問題 No.1269 I hate Fibonacci Number
ユーザー 👑 emthrmemthrm
提出日時 2020-10-23 23:56:32
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 567 ms / 3,000 ms
コード長 8,543 bytes
コンパイル時間 2,872 ms
コンパイル使用メモリ 232,300 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-07-21 13:57:14
合計ジャッジ時間 7,488 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 16 ms
6,944 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 2 ms
6,944 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 2 ms
6,940 KB
testcase_12 AC 2 ms
6,944 KB
testcase_13 AC 7 ms
6,940 KB
testcase_14 AC 426 ms
6,944 KB
testcase_15 AC 23 ms
6,944 KB
testcase_16 AC 567 ms
6,948 KB
testcase_17 AC 5 ms
6,940 KB
testcase_18 AC 563 ms
6,940 KB
testcase_19 AC 251 ms
6,940 KB
testcase_20 AC 55 ms
6,944 KB
testcase_21 AC 298 ms
6,944 KB
testcase_22 AC 199 ms
6,940 KB
testcase_23 AC 230 ms
6,940 KB
testcase_24 AC 140 ms
6,940 KB
testcase_25 AC 124 ms
6,940 KB
testcase_26 AC 6 ms
6,940 KB
testcase_27 AC 2 ms
6,940 KB
testcase_28 AC 6 ms
6,944 KB
testcase_29 AC 72 ms
6,940 KB
testcase_30 AC 19 ms
6,944 KB
testcase_31 AC 342 ms
6,944 KB
testcase_32 AC 184 ms
6,944 KB
testcase_33 AC 12 ms
6,940 KB
testcase_34 AC 3 ms
6,940 KB
testcase_35 AC 14 ms
6,944 KB
testcase_36 AC 2 ms
6,940 KB
testcase_37 AC 2 ms
6,944 KB
testcase_38 AC 2 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr ll LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

template <int MOD>
struct MInt {
  unsigned val;
  MInt(): val(0) {}
  MInt(long long x) : val(x >= 0 ? x % MOD : x % MOD + MOD) {}
  static int get_mod() { return MOD; }
  static void set_mod(int divisor) { assert(divisor == MOD); }
  MInt pow(long long exponent) const {
    MInt tmp = *this, res = 1;
    while (exponent > 0) {
      if (exponent & 1) res *= tmp;
      tmp *= tmp;
      exponent >>= 1;
    }
    return res;
  }
  MInt &operator+=(const MInt &x) { if((val += x.val) >= MOD) val -= MOD; return *this; }
  MInt &operator-=(const MInt &x) { if((val += MOD - x.val) >= MOD) val -= MOD; return *this; }
  MInt &operator*=(const MInt &x) { val = static_cast<unsigned long long>(val) * x.val % MOD; return *this; }
  MInt &operator/=(const MInt &x) {
    // assert(std::__gcd(static_cast<int>(x.val), MOD) == 1);
    unsigned a = x.val, b = MOD; int u = 1, v = 0;
    while (b) {
      unsigned tmp = a / b;
      std::swap(a -= tmp * b, b);
      std::swap(u -= tmp * v, v);
    }
    return *this *= u;
  }
  bool operator==(const MInt &x) const { return val == x.val; }
  bool operator!=(const MInt &x) const { return val != x.val; }
  bool operator<(const MInt &x) const { return val < x.val; }
  bool operator<=(const MInt &x) const { return val <= x.val; }
  bool operator>(const MInt &x) const { return val > x.val; }
  bool operator>=(const MInt &x) const { return val >= x.val; }
  MInt &operator++() { if (++val == MOD) val = 0; return *this; }
  MInt operator++(int) { MInt res = *this; ++*this; return res; }
  MInt &operator--() { val = (val == 0 ? MOD : val) - 1; return *this; }
  MInt operator--(int) { MInt res = *this; --*this; return res; }
  MInt operator+() const { return *this; }
  MInt operator-() const { return MInt(val ? MOD - val : 0); }
  MInt operator+(const MInt &x) const { return MInt(*this) += x; }
  MInt operator-(const MInt &x) const { return MInt(*this) -= x; }
  MInt operator*(const MInt &x) const { return MInt(*this) *= x; }
  MInt operator/(const MInt &x) const { return MInt(*this) /= x; }
  friend std::ostream &operator<<(std::ostream &os, const MInt &x) { return os << x.val; }
  friend std::istream &operator>>(std::istream &is, MInt &x) { long long val; is >> val; x = MInt(val); return is; }
};
namespace std { template <int MOD> MInt<MOD> abs(const MInt<MOD> &x) { return x; } }
template <int MOD>
struct Combinatorics {
  using ModInt = MInt<MOD>;
  int val;  // "val!" and "mod" must be disjoint.
  std::vector<ModInt> fact, fact_inv, inv;
  Combinatorics(int val = 10000000) : val(val), fact(val + 1), fact_inv(val + 1), inv(val + 1) {
    fact[0] = 1;
    for (int i = 1; i <= val; ++i) fact[i] = fact[i - 1] * i;
    fact_inv[val] = ModInt(1) / fact[val];
    for (int i = val; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i;
    for (int i = 1; i <= val; ++i) inv[i] = fact[i - 1] * fact_inv[i];
  }
  ModInt nCk(int n, int k) const {
    if (n < 0 || n < k || k < 0) return 0;
    assert(n <= val && k <= val);
    return fact[n] * fact_inv[k] * fact_inv[n - k];
  }
  ModInt nPk(int n, int k) const {
    if (n < 0 || n < k || k < 0) return 0;
    assert(n <= val);
    return fact[n] * fact_inv[n - k];
  }
  ModInt nHk(int n, int k) const {
    if (n < 0 || k < 0) return 0;
    return k == 0 ? 1 : nCk(n + k - 1, k);
  }
};
using ModInt = MInt<MOD>;

template <size_t char_sz = 26>
struct Trie {
  struct Node {
    char c;
    int nx[char_sz];
    std::vector<int> tails;
    Node(char c) : c(c) { std::memset(nx, -1, sizeof(nx)); }
  };

  std::vector<Node> nodes;

  Trie(const char basis = 'a') : basis(basis) { nodes.emplace_back('$'); }

  void add(const std::string &s, int id = -1, int pos = 0) {
    for (char c : s) {
      int now = convert(c);
      if (nodes[pos].nx[now] == -1) {
        int nx_pos = nodes.size();
        nodes[pos].nx[now] = nx_pos;
        nodes.emplace_back(c);
        pos = nx_pos;
      } else {
        pos = nodes[pos].nx[now];
      }
    }
    nodes[pos].tails.emplace_back(id);
  }

  int find(const std::string &t, int pos = 0) const {
    for (char c : t) {
      int now = convert(c);
      if (nodes[pos].nx[now] == -1) return -1;
      pos = nodes[pos].nx[now];
    }
    return pos;
  }

  int convert(char c) const { return c - basis; }

private:
  const char basis;
};

template <size_t char_sz = 26>
struct AhoCorasick : Trie<char_sz + 1> {
  using Trie<char_sz + 1>::Trie;

  std::vector<int> cnt;

  void build() {
    is_built = true;
    auto &vertices = this->nodes;
    int n = vertices.size();
    cnt.resize(n);
    for (int i = 0; i < n; ++i) {
      std::sort(vertices[i].tails.begin(), vertices[i].tails.end());
      cnt[i] = vertices[i].tails.size();
    }
    std::queue<int> que;
    for (int i = 0; i < char_sz; ++i) {
      if (vertices[0].nx[i] == -1) {
        vertices[0].nx[i] = 0;
      } else {
        vertices[vertices[0].nx[i]].nx[char_sz] = 0;
        que.emplace(vertices[0].nx[i]);
      }
    }
    while (!que.empty()) {
      auto node = vertices[que.front()];
      cnt[que.front()] += cnt[node.nx[char_sz]];
      que.pop();
      for (int i = 0; i < char_sz; ++i) {
        if (node.nx[i] == -1) continue;
        int on_failure = node.nx[char_sz];
        while (vertices[on_failure].nx[i] == -1) on_failure = vertices[on_failure].nx[char_sz];
        vertices[node.nx[i]].nx[char_sz] = vertices[on_failure].nx[i];
        auto &ver = vertices[node.nx[i]].tails;
        std::vector<int> tmp;
        std::set_union(ver.begin(), ver.end(), vertices[vertices[on_failure].nx[i]].tails.begin(), vertices[vertices[on_failure].nx[i]].tails.end(), std::back_inserter(tmp));
        ver.resize(tmp.size());
        std::copy(tmp.begin(), tmp.end(), ver.begin());
        que.emplace(node.nx[i]);
      }
    }
  }

  int move(char c, int pos) const {
    // assert(is_built);
    int now = this->convert(c);
    while (this->nodes[pos].nx[now] == -1) pos = this->nodes[pos].nx[char_sz];
    return pos = this->nodes[pos].nx[now];
  }

  int match(const std::string &t, int pos = 0) const {
    assert(is_built);
    int total = 0;
    for (char c : t) {
      pos = move(c, pos);
      total += this->nodes[pos].tails.size();
    }
    return total;
  }

  std::map<int, int> match_heavy(const std::string &t, int pos = 0) const {
    assert(is_built);
    std::map<int, int> mp;
    for (char c : t) {
      pos = move(c, pos);
      for (int e : this->nodes[pos].tails) ++mp[e];
    }
    return mp;
  }

private:
  bool is_built = false;
};

int main() {
  constexpr int N = 88;
  vector<ll> fib(N, 1);
  FOR(i, 2, N) fib[i] = fib[i - 1] + fib[i - 2];

  int n; ll l, r; cin >> n >> l >> r;
  {
    vector<ll> nx;
    FOR(i, 1, N) {
      if (l <= fib[i] && fib[i] <= r) nx.emplace_back(fib[i]);
    }
    fib.swap(nx);
  }
  // {
  //   vector<ll> nx;
  //   for (ll e : fib) {
  //     string s = to_string(e);
  //     bool ok = true;
  //     for (ll f : nx) {
  //       string t = to_string(f);
  //       for (int i = 0; i + t.length() <= s.length(); ++i) ok &= s.substr(i, t.length()) != t;
  //     }
  //     if (ok) nx.emplace_back(e);
  //   }
  //   fib.swap(nx);
  // }
  AhoCorasick<10> aho('0');
  for (ll e : fib) aho.add(to_string(e));
  aho.build();
  map<pair<int, int>, ModInt> dp;
  dp[{0, false}] = 1;
  while (n--) {
    map<pair<int, int>, ModInt> nx;
    for (auto [k, v] : dp) {
      auto [i, j] = k;
      REP(x, 10) {
        int node = aho.move('0' + x, i);
        if (aho.nodes[node].tails.empty()) nx[{node, j || x > 0}] += v;
      }
    }
    dp.swap(nx);
  }
  ModInt ans = 0;
  for (auto [k, v] : dp) {
    if (k.second) ans += v;
  }
  cout << ans << '\n';
  return 0;
}
0