結果

問題 No.1269 I hate Fibonacci Number
ユーザー minatominato
提出日時 2020-10-24 13:50:41
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 13 ms / 3,000 ms
コード長 7,060 bytes
コンパイル時間 4,824 ms
コンパイル使用メモリ 237,356 KB
実行使用メモリ 4,380 KB
最終ジャッジ日時 2023-09-28 20:24:08
合計ジャッジ時間 6,136 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 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 1 ms
4,376 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 2 ms
4,380 KB
testcase_09 AC 2 ms
4,376 KB
testcase_10 AC 2 ms
4,380 KB
testcase_11 AC 2 ms
4,376 KB
testcase_12 AC 2 ms
4,376 KB
testcase_13 AC 3 ms
4,376 KB
testcase_14 AC 12 ms
4,380 KB
testcase_15 AC 3 ms
4,380 KB
testcase_16 AC 13 ms
4,380 KB
testcase_17 AC 2 ms
4,380 KB
testcase_18 AC 13 ms
4,376 KB
testcase_19 AC 11 ms
4,376 KB
testcase_20 AC 4 ms
4,376 KB
testcase_21 AC 9 ms
4,376 KB
testcase_22 AC 8 ms
4,380 KB
testcase_23 AC 9 ms
4,380 KB
testcase_24 AC 5 ms
4,376 KB
testcase_25 AC 6 ms
4,380 KB
testcase_26 AC 2 ms
4,376 KB
testcase_27 AC 2 ms
4,376 KB
testcase_28 AC 2 ms
4,376 KB
testcase_29 AC 6 ms
4,376 KB
testcase_30 AC 3 ms
4,380 KB
testcase_31 AC 10 ms
4,376 KB
testcase_32 AC 6 ms
4,380 KB
testcase_33 AC 6 ms
4,376 KB
testcase_34 AC 2 ms
4,380 KB
testcase_35 AC 4 ms
4,380 KB
testcase_36 AC 2 ms
4,376 KB
testcase_37 AC 1 ms
4,380 KB
testcase_38 AC 2 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#ifdef ONLINE_JUDGE
#pragma GCC target("avx2,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
template<class Container> inline int SZ(Container& v) { return int(v.size()); }
template<typename T> inline void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }
template<class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) {a = b; return true ;} return false ;}
template<class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) {a = b; return true ;} return false ;}
struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

//必要に応じて、len 、par などの情報を持たせる
template<class Char>
struct AhoCorasick {
	struct State {
		map<Char, int> nex;
		int link, last;
		State() : link(0), last(0) {}
	};
	vector<State> node;
	AhoCorasick() {
		node.emplace_back();
		node[0].link = -1;
	}
 
	int process(int cur, Char c) {
		while (~cur and !node[cur].nex.count(c)) cur = node[cur].link;
        if (~cur) return node[cur].nex[c];
        return 0;
	}
 
    int addChar(Char c, int cur = 0) {
        if (!node[cur].nex.count(c)) {
            node[cur].nex[c] = node.size();
            node.emplace_back();
        }
        return node[cur].nex[c];
    }
 
    template<class String>
	int addString(const String& s) {
		int cur = 0;
        for(const Char& c : s) {
            cur = addChar(c,cur);
        }
        node[cur].last = 1;
        return cur;
	}
 
	void build() {
		queue<int> que;
		for (auto& p : node[0].nex) que.emplace(p.second);
		while (!que.empty()) {
			int cur = que.front(); que.pop();
			for(auto& [c,nex] : node[cur].nex) {
				node[nex].link = process(node[cur].link,c);
                node[nex].last |= node[node[nex].link].last;
				que.emplace(nex);
			}
		}
	}
 
	State& operator[](int v) { return node[v]; }

	int size() { return int(node.size()); }
};

/////////////////////////////////////////////////////////////////////////////////////////

template<int m> 
struct ModInt {
  public:
    static constexpr int mod() { return m; }
    static ModInt raw(int v) {
        ModInt x;
        x._v = v;
        return x;
    }

    ModInt() : _v(0) {}
    ModInt(long long v) {
        long long x = (long long)(v % (long long)(umod()));
        if (x < 0) x += umod();
        _v = (unsigned int)(x);
    }

    unsigned int val() const { return _v; }

    ModInt& operator++() {
        _v++;
        if (_v == umod()) _v = 0;
        return *this;
    }
    ModInt& operator--() {
        if (_v == 0) _v = umod();
        _v--;
        return *this;
    }
    ModInt operator++(int) {
        ModInt result = *this;
        ++*this;
        return result;
    }
    ModInt operator--(int) {
        ModInt result = *this;
        --*this;
        return result;
    }

    ModInt& operator+=(const ModInt& rhs) {
        _v += rhs._v;
        if (_v >= umod()) _v -= umod();
        return *this;
    }
    ModInt& operator-=(const ModInt& rhs) {
        _v -= rhs._v;
        if (_v >= umod()) _v += umod();
        return *this;
    }
    ModInt& operator*=(const ModInt& rhs) {
        unsigned long long z = _v;
        z *= rhs._v;
        _v = (unsigned int)(z % umod());
        return *this;
    }
    ModInt& operator^=(long long n) {
        ModInt x = *this;
        *this = 1;
        if (n < 0) x = x.inv(), n = -n;
        while (n) {
            if (n & 1) *this *= x;
            x *= x;
            n >>= 1;
        }
        return *this;
    }
    ModInt& operator/=(const ModInt& rhs) { return *this = *this * rhs.inv(); }

    ModInt operator+() const { return *this; }
    ModInt operator-() const { return ModInt() - *this; }

    ModInt pow(long long n) const {
        ModInt r = *this;
        r ^= n;
        return r;
    }
    ModInt inv() const {
        int a = _v, b = umod(), y = 1, z = 0, t;
        for (; ; ) {
            t = a / b; a -= t * b;
            if (a == 0) {
                assert(b == 1 || b == -1);
                return ModInt(b * z);
            }
            y -= t * z;
            t = b / a; b -= t * a;
            if (b == 0) {
                assert(a == 1 || a == -1);
                return ModInt(a * y);
            }
            z -= t * y;
        }
    }

    friend ModInt operator+(const ModInt& lhs, const ModInt& rhs) { return ModInt(lhs) += rhs; }
    friend ModInt operator-(const ModInt& lhs, const ModInt& rhs) { return ModInt(lhs) -= rhs; }
    friend ModInt operator*(const ModInt& lhs, const ModInt& rhs) { return ModInt(lhs) *= rhs; }
    friend ModInt operator/(const ModInt& lhs, const ModInt& rhs) { return ModInt(lhs) /= rhs; }
    friend ModInt operator^(const ModInt& lhs, long long rhs) { return ModInt(lhs) ^= rhs; }
    friend bool operator==(const ModInt& lhs, const ModInt& rhs) { return lhs._v == rhs._v; }
    friend bool operator!=(const ModInt& lhs, const ModInt& rhs) { return lhs._v != rhs._v; }
    friend ModInt operator+(long long lhs, const ModInt& rhs) { return (ModInt(lhs) += rhs); }
    friend ModInt operator-(long long lhs, const ModInt& rhs) { return (ModInt(lhs) -= rhs); }
    friend ModInt operator*(long long lhs, const ModInt& rhs) { return (ModInt(lhs) *= rhs); }
    friend ostream &operator<<(ostream& os, const ModInt& rhs) { return os << rhs._v; }

  private:
    unsigned int _v;
    static constexpr unsigned int umod() { return m; }
};
 
constexpr int MOD = 1000000007;
//constexpr int MOD = 998244353;

using mint = ModInt<MOD>;

void yukico1269() {
    ll N,L,R; cin >> N >> L >> R;

    AhoCorasick<int> AC;

    ll f1 = 0, f2 = 1;
    while (true) {
        ll f = f1+f2;
        if (f > R) break;
        if (f >= L) {
            vector<int> num;
            for (ll a = f; a > 0;) {
                num.emplace_back(a%10);
                a /= 10;
            }
            reverse(all(num));
            AC.addString(num);
        }
        f1 = f2;
        f2 = f;
    }

    AC.build();
    int M = AC.size();
    vector<vector<int>> nex(M, vector<int>(10));
    rep(i,M) {
        rep(j,10) {
            nex[i][j] = AC.process(i,j);
            if (AC[nex[i][j]].last) nex[i][j] = -1;
        }
    }

    vector<mint> dp(M);
    dp[0] = 1;
    rep(i,N) {
        vector<mint> ndp(M);
        rep(j,M) {
            if (dp[j]==0) continue;
            rep(k,10) {
                if (~nex[j][k]) ndp[nex[j][k]] += dp[j];
            }
        }
        swap(dp,ndp);
    }
    mint ans = 0;
    rep(j,M) ans += dp[j];
    ans--;

    cout << ans << ln;
}

int main() {
    yukico1269();
}
0