#499662 (C++17) No.1085 桁和の桁和

提出ソース

結果

問題	No.1085 桁和の桁和
ユーザー	kcvlex
提出日時	2020-06-19 22:53:29
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	RE
実行時間	-
コード長	5,807 bytes
コンパイル時間	1,397 ms
コンパイル使用メモリ	145,472 KB
実行使用メモリ	10,624 KB
最終ジャッジ日時	2024-07-23 00:22:34
合計ジャッジ時間	3,362 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	RE	-
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	RE	-
testcase_05	RE	-
testcase_06	RE	-
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	WA	-
testcase_10	RE	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	AC	4 ms 5,376 KB
testcase_14	AC	6 ms 5,376 KB
testcase_15	AC	13 ms 6,528 KB
testcase_16	AC	12 ms 6,656 KB
testcase_17	AC	7 ms 5,376 KB
testcase_18	AC	5 ms 5,376 KB
testcase_19	AC	11 ms 6,400 KB
testcase_20	RE	-
testcase_21	AC	8 ms 5,376 KB
testcase_22	AC	10 ms 6,144 KB
testcase_23	AC	3 ms 5,376 KB
testcase_24	AC	2 ms 5,376 KB
testcase_25	AC	7 ms 5,376 KB
testcase_26	AC	11 ms 6,784 KB
testcase_27	AC	10 ms 6,144 KB
testcase_28	AC	15 ms 7,168 KB
testcase_29	AC	8 ms 5,376 KB
testcase_30	AC	8 ms 5,376 KB
testcase_31	AC	12 ms 6,656 KB
testcase_32	AC	9 ms 5,632 KB
testcase_33	AC	25 ms 10,496 KB
testcase_34	AC	25 ms 10,624 KB
testcase_35	AC	24 ms 10,624 KB
testcase_36	AC	24 ms 10,624 KB
testcase_37	AC	24 ms 10,496 KB
testcase_38	AC	24 ms 10,624 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#define CPP17
#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#ifdef CPP17
#include <variant>
#endif

// Yay!!
#define endl codeforces

// macros for iterator
#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)

// alias
using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;

// variadic min/max
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }

// variadic chmin/chmax
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }

// multi demension array
template <typename T, std::size_t Head, std::size_t... Tail> struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };
template <typename T, std::size_t Head> struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;

#ifdef CPP17
// fill container
template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { if constexpr (std::is_invocable<F, Args...>::value) { t = f(args...); } else { for (ssize_t i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); } }
#endif

// make multi dimension vector
template <typename T> vec<T> make_v(ssize_t sz) { return vec<T>(sz); }
template <typename T, typename... Tail> auto make_v(ssize_t hs, Tail&&... ts) { auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); return vec<decltype(v)>(hs, v); }

// init
namespace init__ { 
struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; 
}


namespace math {

template <typename T>
constexpr T pow(const T &n, ll k) {
    T ret = n.mul_id_ele();
    T cur = n;
    while (k) {
        if (k & 1) ret *= cur;
        cur *= cur;
        k /= 2;
    }
    return ret;
}

}

namespace math {

template <ll Mod>
struct Modint {

    constexpr Modint(ll x) noexcept : x((Mod + x % Mod) % Mod) { }
    
    constexpr Modint() noexcept : Modint(0) { }
    
    constexpr Modint<Mod> add_id_ele() const noexcept { 
        return Modint<Mod>(0); 
    }
    
    constexpr Modint<Mod> mul_id_ele() const noexcept {
        return Modint<Mod>(1); 
    }
    
    constexpr ll& value() noexcept { 
        return x; 
    }
    
    constexpr ll value() const noexcept {
        return x; 
    }

    constexpr Modint& operator +=(const Modint &oth) noexcept {
        x += oth.value();
        if (Mod <= x) x -= Mod;
        return *this;
    }

    constexpr Modint& operator -=(const Modint &oth) noexcept {
        x += Mod - oth.value();
        if (Mod <= x) x -= Mod;
        return *this;
    }

    constexpr Modint& operator *=(const Modint &oth) noexcept {
        x *= oth.value();
        x %= Mod;
        return *this;
    }

    constexpr Modint& operator /=(const Modint &oth) noexcept {
        x *= oth.inv().value();
        x %= Mod;
        return *this;
    }

    constexpr Modint operator +(const Modint &oth) const noexcept {
        return Modint(x) += oth;
    }

    constexpr Modint operator -(const Modint &oth) const noexcept {
        return Modint(x) -= oth;
    }

    constexpr Modint operator *(const Modint &oth) const noexcept {
        return Modint(x) *= oth;
    }

    constexpr Modint operator /(const Modint &oth) const noexcept {
        return Modint(x) /= oth;
    }

    constexpr Modint operator -() const noexcept {
        return Modint((x != 0) * (Mod - x)); 
    }

    template <typename T>
    constexpr typename std::enable_if<std::is_integral<T>::value, const Modint&>::type
    operator =(T t) noexcept {
        (*this) = Modint(std::forward<T>(t)); 
        return *this;
    }

    constexpr Modint inv() const noexcept {
        return ::math::pow(*this, Mod - 2);
    }

    constexpr ll mod() const noexcept {
        return Mod;
    }

private:
    ll x;
};

}

const ll mod = 1e9 + 7;
const ssize_t SIZE = 1e6;
using mint = math::Modint<mod>;
mdarray<mint, SIZE, 9> dp;

mint solve() {
    std::string s;
    ll d;
    std::cin >> s >> d;
    ll sum = 0, cnt = 0;
    for (char c : s) {
        if ('0' <= c && c <= '9') sum += c - '0';
        else cnt++;
    }

    assert(d != 0);
    if (d == 0) return mint(sum == 0);

    dp[0][sum % 9] = 1;
    for (ll i = 0; i < cnt; i++) {
        for (ll j = 0; j < 9; j++) for (ll k = 0; k < 10; k++) {
            ll m = (j + k) % 9;
            dp[i + 1][m] += dp[i][j];
        }
    }

    return dp[cnt][d % 9];
}

int main() {
    std::cout << solve().value() << "\n";
    return 0;
}

yukicoder

結果

テストケース

ソースコード