結果
| 問題 | No.1269 I hate Fibonacci Number |
| ユーザー |
 hitonanode
|
| 提出日時 | 2020-10-23 22:27:42 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 64 ms / 3,000 ms |
| コード長 | 10,832 bytes |
| コンパイル時間 | 2,886 ms |
| コンパイル使用メモリ | 222,908 KB |
| 最終ジャッジ日時 | 2025-01-15 13:24:46 |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 36 |
ソースコード
#include <bits/stdc++.h>using namespace std;using lint = long long;using pint = pair<int, int>;using plint = pair<lint, lint>;struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;#define ALL(x) (x).begin(), (x).end()#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)#define REP(i, n) FOR(i,0,n)#define IREP(i, n) IFOR(i,0,n)template <typename T, typename V>void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }template <typename T> vector<T> srtunq(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); returnvec; }template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }#if __cplusplus >= 201703Ltemplate <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); returnis; }template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);},tpl); return os; }#endiftemplate <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os;}template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ',';os << '}'; return os; }template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os;}template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}';return os; }template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')';return os; }template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp)os << v.first << "=>" << v.second << ','; os << '}'; return os; }#ifdef HITONANODE_LOCAL#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl#else#define dbg(x) {}#endiftemplate <int mod>struct ModInt{using lint = long long;static int get_mod() { return mod; }static int get_primitive_root() {static int primitive_root = 0;if (!primitive_root) {primitive_root = [&](){std::set<int> fac;int v = mod - 1;for (lint i = 2; i * i <= v; i++) while (v % i == 0) fac.insert(i), v /= i;if (v > 1) fac.insert(v);for (int g = 1; g < mod; g++) {bool ok = true;for (auto i : fac) if (ModInt(g).power((mod - 1) / i) == 1) { ok = false; break; }if (ok) return g;}return -1;}();}return primitive_root;}int val;constexpr ModInt() : val(0) {}constexpr ModInt &_setval(lint v) { val = (v >= mod ? v - mod : v); return *this; }constexpr ModInt(lint v) { _setval(v % mod + mod); }explicit operator bool() const { return val != 0; }constexpr ModInt operator+(const ModInt &x) const { return ModInt()._setval((lint)val + x.val); }constexpr ModInt operator-(const ModInt &x) const { return ModInt()._setval((lint)val - x.val + mod); }constexpr ModInt operator*(const ModInt &x) const { return ModInt()._setval((lint)val * x.val % mod); }constexpr ModInt operator/(const ModInt &x) const { return ModInt()._setval((lint)val * x.inv() % mod); }constexpr ModInt operator-() const { return ModInt()._setval(mod - val); }constexpr ModInt &operator+=(const ModInt &x) { return *this = *this + x; }constexpr ModInt &operator-=(const ModInt &x) { return *this = *this - x; }constexpr ModInt &operator*=(const ModInt &x) { return *this = *this * x; }constexpr ModInt &operator/=(const ModInt &x) { return *this = *this / x; }friend constexpr ModInt operator+(lint a, const ModInt &x) { return ModInt()._setval(a % mod + x.val); }friend constexpr ModInt operator-(lint a, const ModInt &x) { return ModInt()._setval(a % mod - x.val + mod); }friend constexpr ModInt operator*(lint a, const ModInt &x) { return ModInt()._setval(a % mod * x.val % mod); }friend constexpr ModInt operator/(lint a, const ModInt &x) { return ModInt()._setval(a % mod * x.inv() % mod); }constexpr bool operator==(const ModInt &x) const { return val == x.val; }constexpr bool operator!=(const ModInt &x) const { return val != x.val; }bool operator<(const ModInt &x) const { return val < x.val; } // To use std::map<ModInt, T>friend std::istream &operator>>(std::istream &is, ModInt &x) { lint t; is >> t; x = ModInt(t); return is; }friend std::ostream &operator<<(std::ostream &os, const ModInt &x) { os << x.val; return os; }constexpr lint power(lint n) const {lint ans = 1, tmp = this->val;while (n) {if (n & 1) ans = ans * tmp % mod;tmp = tmp * tmp % mod;n /= 2;}return ans;}constexpr lint inv() const { return this->power(mod - 2); }constexpr ModInt operator^(lint n) const { return ModInt(this->power(n)); }constexpr ModInt &operator^=(lint n) { return *this = *this ^ n; }inline ModInt fac() const {static std::vector<ModInt> facs;int l0 = facs.size();if (l0 > this->val) return facs[this->val];facs.resize(this->val + 1);for (int i = l0; i <= this->val; i++) facs[i] = (i == 0 ? ModInt(1) : facs[i - 1] * ModInt(i));return facs[this->val];}ModInt doublefac() const {lint k = (this->val + 1) / 2;if (this->val & 1) return ModInt(k * 2).fac() / ModInt(2).power(k) / ModInt(k).fac();else return ModInt(k).fac() * ModInt(2).power(k);}ModInt nCr(const ModInt &r) const {if (this->val < r.val) return ModInt(0);return this->fac() / ((*this - r).fac() * r.fac());}ModInt sqrt() const {if (val == 0) return 0;if (mod == 2) return val;if (power((mod - 1) / 2) != 1) return 0;ModInt b = 1;while (b.power((mod - 1) / 2) == 1) b += 1;int e = 0, m = mod - 1;while (m % 2 == 0) m >>= 1, e++;ModInt x = power((m - 1) / 2), y = (*this) * x * x;x *= (*this);ModInt z = b.power(m);while (y != 1) {int j = 0;ModInt t = y;while (t != 1) j++, t *= t;z = z.power(1LL << (e - j - 1));x *= z, z *= z, y *= z;e = j;}return ModInt(std::min(x.val, mod - x.val));}};using mint = ModInt<1000000007>;template<typename T>struct Trie{vector<map<char, int>> child;vector<int> fail;vector<T> node_info;int root;Trie() : child(1), fail(1), node_info(1), root(0) {}void add_keyword(string str, T info){int now = 0;for (auto c : str){if (child[now].count(c) == 0){child[now][c] = fail.size();child.emplace_back(map<char, int>());fail.emplace_back(root);node_info.emplace_back(0);}now = child[now][c];}node_info[now] += info;}void build_aho_corasick(){queue<int> q;for (auto pa : child[root]) q.push(pa.second);while (!q.empty()){int s = q.front();q.pop();for (auto pa : child[s]){int t = fail[s];while (t and child[t].count(pa.first) == 0) t = fail[t];int u = (child[t].count(pa.first) ? child[t][pa.first] : root);fail[pa.second] = u;node_info[pa.second] += node_info[u];q.push(pa.second);}}}};int main(){int N;lint L, R;cin >> N >> L >> R;vector<lint> fibs;{lint f1 = 1, f2 = 0;while (true) {lint fnew = f1 + f2;if (fnew >= L and fnew <= R) {fibs.emplace_back(fnew);}else if (fnew > R) break;f2 = f1;f1 = fnew;}}Trie<int> aho;for (auto v : fibs) {aho.add_keyword(to_string(v), 1);}aho.build_aho_corasick();dbg(fibs);dbg(aho.fail);dbg(aho.child);dbg(fibs);const int V = aho.fail.size();vector<vector<int>> to(V, vector<int>(10));const vector<int> &bad = aho.node_info;REP(i, V) {REP(d, 10) {int now = i;while (now != 0 and aho.child[now].count('0' + d) == 0) {now = aho.fail[now];}if (aho.child[now].count('0' + d)) {to[i][d] = aho.child[now]['0' + d];}}}vector<mint> dp(V);dp[0] = 1;REP(_, N) {vector<mint> nxt(V);REP(i, V) for (auto j : to[i]) {if (!bad[j]) nxt[j] += dp[i];}dp = nxt;}cout << accumulate(dp.begin(), dp.end(), mint(0)) - 1 << '\n';}