test/atcoder/ABC007_D.cpp

View this file on GitHub
Last update: 2022-11-06 06:14:50+09:00
Link: https://atcoder.jp/contests/abc007/tasks/abc007_4

Depends on

Code

// "https://atcoder.jp/contests/abc007/tasks/abc007_4"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#include "digitDP/forbidden.hpp"
#include "digitDP/digit_dp_leq.hpp"

struct Monoid {
    using T = ll;
    T val;
    bool undef = true;
    Monoid() { *this = zero(); }
    Monoid(T val, bool undef = true) : val(val),
                                       undef(undef) {}
    static Monoid zero() { return Monoid(0); }
    static Monoid e() { return Monoid(1,false); }
    Monoid& operator+=(const Monoid &a) {
        if (this->undef) *this = a;
        else if (!a.undef) this->val += a.val;
        return *this;
    }
    Monoid& operator*=(int c) {
        return *this;
    }
    friend Monoid operator+(const Monoid& a, const Monoid& b) {
        return Monoid(a) += b;
    }
    friend Monoid operator*(const Monoid& a, int c) {
        return Monoid(a) *= c;
    }
    friend std::ostream& operator<<(std::ostream &os, const Monoid &x) {
        return os << x.val;
    }
};

int main() {
    string a,b;cin >> a >> b;
    auto M1 = ForbiddenNumberAutomaton({0,0,0,0,1,0,0,0,0,1});
    cout << stoll(b)-stoll(a)+1-digitDP<Monoid>(b,M1).val+digitDP<Monoid>(a,M1,false).val << endl;
    return 0;
}

#line 1 "test/atcoder/ABC007_D.cpp"
// "https://atcoder.jp/contests/abc007/tasks/abc007_4"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#line 3 "digitDP/automaton.hpp"

struct Automaton {
    std::vector<std::vector<int>> delta;
    std::vector<bool> is_accept;
    int qsize;
    int init;
    int alphabet_size = 10;
    inline int next(int state, int c) const { return delta[state][c]; }
    inline bool accept(int state) const { return is_accept[state]; }
    inline int size() const {return qsize; }
};
#line 4 "digitDP/forbidden.hpp"

// ある文字が現れない文字列を受理
struct ForbiddenNumberAutomaton : public Automaton {
private:
    std::vector<bool> banflg;
    
    void initializer() { 
        qsize = 3;
        init = 0;
        set_delta();
        set_is_accept();
    }

    void set_delta() {
        delta.resize(qsize,std::vector<int>(alphabet_size));
        for (int state = 0; state < qsize; state++) {
            for (int c = 0; c < alphabet_size; c++) {
                if (state == 0) {
                    if (c == 0) delta[state][c] = 0;
                    else if (banflg[c]) delta[state][c] = 2;
                    else delta[state][c] = 1;
                }
                else if (state == 1) {
                    if (banflg[c]) delta[state][c] = 2;
                    else delta[state][c] = 1;
                }
                else {
                    delta[state][c] = 2;
                }
            }
        }
    }

    void set_is_accept() {
        is_accept.resize(qsize,false);
        is_accept[1] = true;
    }
public:
    ForbiddenNumberAutomaton(std::vector<bool> banflg, int alpha_size = 10) : banflg(banflg) {
        assert(banflg.size() == alpha_size);
        alphabet_size = alpha_size;
        initializer();
    }
};
#line 4 "digitDP/digit_dp_leq.hpp"

// LeqAutomaton付き桁DP
template<typename Monoid>
Monoid digitDP(const std::string &s, const Automaton &dfa, bool eq = 1) {
    std::vector<std::vector<Monoid>> dp(2,std::vector<Monoid>(dfa.size(),Monoid::zero()));
    dp[1][dfa.init] = Monoid::e();
    for (int i = 0; i < (int)s.size(); i++) {
        std::vector<std::vector<Monoid>> dp2(2,std::vector<Monoid>(dfa.size(),Monoid::zero()));
        for (int tight = 0; tight <= 1; tight++) {
            for (int state = 0; state < dfa.size(); state++) {
                if (dp[tight][state].undef) continue;
                int lim = (tight ? s[i] - '0' : dfa.alphabet_size - 1);
                for (int c = 0; c <= lim; c++) {
                    int tight_ = tight && c == lim;
                    int state_ = dfa.next(state,c);
                    dp2[tight_][state_] += dp[tight][state]*c;
                }
            }
        }
        dp = move(dp2);
    }
    Monoid ans = Monoid::zero();
    for (int tight = 0; tight <= eq; tight++)
        for (int state = 0; state < dfa.size(); state++)
            if (dfa.accept(state)) ans += dp[tight][state];
    return ans;
}
#line 8 "test/atcoder/ABC007_D.cpp"

struct Monoid {
    using T = ll;
    T val;
    bool undef = true;
    Monoid() { *this = zero(); }
    Monoid(T val, bool undef = true) : val(val),
                                       undef(undef) {}
    static Monoid zero() { return Monoid(0); }
    static Monoid e() { return Monoid(1,false); }
    Monoid& operator+=(const Monoid &a) {
        if (this->undef) *this = a;
        else if (!a.undef) this->val += a.val;
        return *this;
    }
    Monoid& operator*=(int c) {
        return *this;
    }
    friend Monoid operator+(const Monoid& a, const Monoid& b) {
        return Monoid(a) += b;
    }
    friend Monoid operator*(const Monoid& a, int c) {
        return Monoid(a) *= c;
    }
    friend std::ostream& operator<<(std::ostream &os, const Monoid &x) {
        return os << x.val;
    }
};

int main() {
    string a,b;cin >> a >> b;
    auto M1 = ForbiddenNumberAutomaton({0,0,0,0,1,0,0,0,0,1});
    cout << stoll(b)-stoll(a)+1-digitDP<Monoid>(b,M1).val+digitDP<Monoid>(a,M1,false).val << endl;
    return 0;
}