結果
問題 | No.1085 桁和の桁和 |
ユーザー |
![]() |
提出日時 | 2020-06-19 22:05:46 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 281 ms / 2,000 ms |
コード長 | 4,146 bytes |
コンパイル時間 | 2,937 ms |
コンパイル使用メモリ | 200,204 KB |
最終ジャッジ日時 | 2025-01-11 06:25:48 |
ジャッジサーバーID (参考情報) |
judge4 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 35 |
ソースコード
#include "bits/stdc++.h"// Begin Header {{{using namespace std;#ifndef DEBUG#define dump(...)#endif#define all(x) x.begin(), x.end()#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)#define reps(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)constexpr size_t operator""_zu(unsigned long long value) { return value; };constexpr intmax_t operator""_jd(unsigned long long value) { return value; };constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };constexpr int INF = 0x3f3f3f3f;constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;template <class T, class Compare = less<>>using MaxHeap = priority_queue<T, vector<T>, Compare>;template <class T, class Compare = greater<>>using MinHeap = priority_queue<T, vector<T>, Compare>;inline void input() {}template <class Head, class... Tail>inline void input(Head&& head, Tail&&... tail) {cin >> head;input(forward<Tail>(tail)...);}template <class T>inline istream& operator>>(istream &is, vector<T> &vec) {for (auto &e: vec) {is >> e;}return is;}inline void output() { cout << "\n"; }template <class Head, class... Tail>inline void output(Head&& head, Tail&&... tail) {cout << head;if (sizeof...(tail)) {cout << " ";}output(forward<Tail>(tail)...);}template <class T>inline ostream& operator<<(ostream &os, const vector<T> &vec) {static constexpr const char *delim[] = {" ", ""};for (const auto &e: vec) {os << e << delim[&e == &vec.back()];}return os;}template <class T>inline vector<T> makeVector(const T &initValue, size_t sz) {return vector<T>(sz, initValue);}template <class T, class... Args>inline auto makeVector(const T &initValue, size_t sz, Args... args) {return vector<decltype(makeVector<T>(initValue, args...))>(sz, makeVector<T>(initValue, args...));}template <class Func>class FixPoint : Func {public:explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}template <class... Args>constexpr decltype(auto) operator()(Args&&... args) const {return Func::operator()(*this, std::forward<Args>(args)...);}};template <class Func>static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {return FixPoint<Func>{forward<Func>(f)};}template <class Container>struct reverse_t {Container &c;reverse_t(Container &c) : c(c) {}auto begin() { return c.rbegin(); }auto end() { return c.rend(); }};template <class Container>auto reversed(Container &c) {return reverse_t<Container>(c);}template <class T>inline bool chmax(T &a, const T &b) noexcept {return b > a && (a = b, true);}template <class T>inline bool chmin(T &a, const T &b) noexcept {return b < a && (a = b, true);}template <class T>inline T diff(const T &a, const T &b) noexcept {return a < b ? b - a : a - b;}// End Header }}}signed main() {ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.setf(ios_base::fixed);cout.precision(10);var(string, T);var(intmax_t, D);const size_t N = T.size();const intmax_t MOD = intmax_t(1e9) + 7;auto dp = makeVector<intmax_t>(-1, N, 10, 2);const auto res = makeFixPoint([&](auto rec, size_t i, intmax_t sum, bool allofzero) -> intmax_t {if (i == N) {if (!allofzero && sum == 0) sum = 9;return (sum == D);}auto &ret = dp[i][sum][allofzero];if (~ret) return ret;ret = 0;if (T[i] == '?') {rep(d, 0, 10) {ret += rec(i + 1, (sum + d) % 9, allofzero & (d == 0));ret %= MOD;}} else {const intmax_t d = T[i] - '0';ret += rec(i + 1, (sum + d) % 9, allofzero & (d == 0));ret %= MOD;}return ret;})(0, 0, true);output(res);return 0;}