#396157 (C++17(gcc12)) No.189 SUPER HAPPY DAY

• 問題: No.189 SUPER HAPPY DAY
• ユーザー: firiexp
• 提出日時: 2019-11-08 13:37:05
• 言語: C++17(gcc12) (gcc 12.4.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 21 ms / 5,000 ms
• コード長: 3,421 bytes
• コンパイル時間: 979 ms
• コンパイル使用メモリ: 118,404 KB
• 実行使用メモリ: 14,848 KB
• 最終ジャッジ日時: 2026-03-08 21:45:44
• 合計ジャッジ時間: 1,685 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

ファイルパターン	結果
sample	AC * 3
other	AC * 23

ソースコード

#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000009;
using ll = long long;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

template <class T, class U>
vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }

template<class... Ts, class U>
auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }

template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }
template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }

template <ll M = MOD> struct modint {
    ll val;
    modint(const ll x = 0) : val(x) {
        val = x;
        while(val < 0) val += M;
        while(val > M) val -= M;
    }

    modint operator+(const modint a) const { return modint(*this) += a; }
    modint operator-(const modint a) const { return modint(*this) -= a; }
    modint operator*(const modint a) const { return modint(*this) *= a; }
    modint operator/(const modint a) const { return modint(*this) /= a; }
    modint operator-() const { return modint(M-val); }
    modint inv() const {
        ll u = 1, v = 0, s = 0, t = 1, m = M, x = val;
        while (x) {ll q = m/x; swap(s -= q*u, u); swap(t -= q*v, v); swap(m -= q*x, x); }
        if(s < 0) s += M;
        return modint(s);
    }
    modint pow(ll n) const {
        ll u = 1, xx = val;
        while (n > 0){ if (n&1) u = u * xx % M; xx = xx * xx % M; n >>= 1; }
        return modint(u);
    }
    modint& operator+=(const modint a){ val += a.val; if(val >= M) val -= M; return *this; }
    modint& operator-=(const modint a){ val -= a.val; if(val < 0) val += M; return *this; }
    modint& operator*=(const modint a){ val = val * a.val % M; return *this; }
    modint& operator/=(const modint a){ val = val * a.inv().val % M; return *this;}

    modint& operator=(const int& x){
        val = x;
        while(val < 0) val += M;
        while(val > M) val -= M;
        return *this;
    }
};

using mint = modint<MOD>;

int main() {
    string s, t;
    cin >> s >> t;
    int n = s.size(), m = t.size();
    auto dp1 = make_v(n+1, 2, 9*n+1, mint(0));
    auto dp2 = make_v(m+1, 2, 9*m+1, mint(0));
    dp1[0][0][0] = 1; dp2[0][0][0] = 1;
    for (int i = 0; i < n; ++i) {
        for (int k = 0; k < 9*i+1; ++k) {
            for (int j = 0; j < 2; ++j) {
                int x = (j ? 9 : s[i]-'0');
                for (int d = 0; d <= x; ++d) {
                    dp1[i+1][j|(d < x)][k+d] += dp1[i][j][k];
                }
            }
        }
    }
    dp1.back()[1][0] -= 1;
    for (int i = 0; i < m; ++i) {
        for (int k = 0; k < 9*i+1; ++k) {
            for (int j = 0; j < 2; ++j) {
                int x = (j ? 9 : t[i]-'0');
                for (int d = 0; d <= x; ++d) {
                    dp2[i+1][j|(d < x)][k+d] += dp2[i][j][k];
                }
            }
        }
    }
    dp2.back()[1][0] -= 1;
    mint ans = 0;
    for (int i = 0; i < min(n,m)*9+1; ++i) {
        mint p = 0, q = 0;
        for (int j = 0; j < 2; ++j) {
            p += dp1.back()[j][i];
            q += dp2.back()[j][i];
        }
        ans += p*q;
    }
    cout << ans.val << "\n";
    return 0;
}