結果
| 問題 | No.1085 桁和の桁和 |
| ユーザー |
 もりを
|
| 提出日時 | 2020-06-19 22:43:29 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 49 ms / 2,000 ms |
| コード長 | 13,343 bytes |
| コンパイル時間 | 2,462 ms |
| コンパイル使用メモリ | 196,332 KB |
| 最終ジャッジ日時 | 2025-01-11 07:20:37 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 35 |
ソースコード
// #pragma GCC target ("avx")// #pragma GCC optimize("Ofast")// #pragma GCC optimize("unroll-loops")// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")#include <bits/stdc++.h>using namespace std;// #define int long long// #define endl '\n'#pragma region TEMPLATE/* TYPE */typedef long long ll; typedef long double ld;typedef pair<int, int> pii; typedef pair<ll, ll> pll;typedef vector<pii> vpii; typedef vector<pll> vpll;typedef vector<int> vi; typedef vector<ll> vl;typedef vector<string> vst; typedef vector<bool> vb;typedef vector<ld> vld; typedef vector<vector<int>> vvi;template<typename T, typename Cmp = less<>> using prique = priority_queue<T, vector<T>, Cmp>;template<typename T> using prique_r = prique<T, greater<>>;/* CONSTANT */#define ln '\n'const int INF = 1 << 30; const ll INFF = 1LL << 60; const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";const int MOD = 1e9 + 7; const int MODD = 998244353; const string alphabet = "abcdefghijklmnopqrstuvwxyz";const double EPS = 1e-9; const ld PI = 3.14159265358979323846264338327950288;const int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1, 0 };const int dy[] = { 0, 1, 0, -1, -1, -1, 1, 1, 0 };/* CONTAINER */#define PB emplace_back#define ALL(v) (v).begin(), (v).end()#define RALL(v) (v).rbegin(), (v).rend()#define SORT(v) sort(ALL(v))#define RSORT(v) sort(RALL(v))#define LESS(x, val) (lower_bound(x.begin(), x.end(), val) - x.begin())#define LEQ(x, val) (upper_bound(x.begin(), x.end(), val) - x.begin())#define GREATER(x, val) (int)(x).size() - LEQ((x), (val))#define GEQ(x, val) (int)(x).size() - LESS((x), (val))#define UNIQUE(v) sort(ALL(v)); (v).erase(unique(ALL(v)), (v).end())template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }template<typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...)); }template<typename T, typename U, typename... V> enable_if_t<is_same<T, U>::value != 0> fill_v(U &u, const V... v) { u = U(v...); }template<typename T, typename U, typename... V> enable_if_t<is_same<T, U>::value == 0> fill_v(U &u, const V... v) { for (auto &e : u) fill_v<T>(e, v...); }/* LOOP */#define _overload3(_1, _2, _3, name, ...) name#define _REP(i, n) REPI(i, 0, n)#define REPI(i, a, b) for (ll i = (ll)a; i < (ll)b; ++i)#define REP(...) _overload3(__VA_ARGS__, REPI, _REP,)(__VA_ARGS__)#define _RREP(i, n) RREPI(i, n, 0)#define RREPI(i, a, b) for (ll i = (ll)a; i >= (ll)b; --i)#define RREP(...) _overload3(__VA_ARGS__, RREPI, _RREP,)(__VA_ARGS__)#define EACH(e, v) for (auto& e : v)#define PERM(v) sort(ALL(v)); for (bool c##p = true; c##p; c##p = next_permutation(ALL(v)))/* INPUT */template<typename T> void SSS(T& t) { cin >> t; }template<typename Head, typename... Tail> void SSS(Head&& head, Tail&&... tail) { cin >> head; SSS(tail...); }#define SS(T, ...) T __VA_ARGS__; SSS(__VA_ARGS__);#define SV(T, v, n) vector<T> v(n); for (auto& i : v) cin >> i;#define SVV(T, v, n, m) vector<vector<T>> v(n, vector<T>(m)); for (auto& r : v) for (auto& i : r) cin >> i;/* OUTPUT */// Yes / Noinline int YES(bool x) { cout << (x ? "YES" : "NO") << endl; return 0; }inline int Yes(bool x) { cout << (x ? "Yes" : "No") << endl; return 0; }inline int yes(bool x) { cout << (x ? "yes" : "no") << endl; return 0; }inline int yES(bool x) { cout << (x ? "yES" : "nO") << endl; return 0; }inline int Yay(bool x) { cout << (x ? "Yay!" : ":(") << endl; return 0; }// PROTOTYPE DECLARATIONtemplate<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &j);template<typename... T> ostream &operator<<(ostream &os, const tuple<T...> &t);template<class C, enable_if_t<!is_same<C, string>::value, decltype(declval<const C &>().begin(), nullptr)> = nullptr> ostream& operator<<(ostream &os, const C &c);template<typename T> ostream &operator<<(ostream &os, const stack<T> &j);template<typename T> ostream &operator<<(ostream &os, const queue<T> &j);template<typename T, typename C, typename Cmp> ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j);// IMPLEMENTATIONtemplate<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &j) { return os << '{' << j.first << ", " << j.second << '}'; }template<size_t num = 0, typename... T> enable_if_t<num == sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) {}template<size_t num = 0, typename... T> enable_if_t<num < sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) { os << get<num>(t); if (num+ 1 < sizeof...(T)) os << ", "; PRINT_TUPLE<num + 1>(os, t); }template<typename... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { PRINT_TUPLE(os << '{', t); return os << '}'; }template<class C, enable_if_t<!is_same<C, string>::value, decltype(declval<const C &>().begin(), nullptr)>> ostream& operator<<(ostream &os, const C&c) { os << '{'; for (auto it = begin(c); it != end(c); it++) { if (begin(c) != it) os << ", "; os << *it; } return os << '}'; }template<typename T> ostream &operator<<(ostream &os, const stack<T> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top());return os << d; }template<typename T> ostream &operator<<(ostream &os, const queue<T> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_back(c.front());return os << d; }template<typename T, typename C, typename Cmp> ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top()); return os << d; }// OUTPUT FUNCTIONtemplate<typename T> int PV(T &v) { int sz = v.size(); for (int i = 0; i < sz; ++i) cout << v[i] << " \n"[i == sz - 1]; return 0; }inline int print() { cout << endl; return 0; }template<typename Head> int print(Head&& head){ cout << head; return print(); }template<typename Head, typename... Tail> int print(Head&& head, Tail&&... tail) { cout << head << " "; return print(forward<Tail>(tail)...); }#ifdef LOCALinline void dump() { cerr << endl; }template<typename Head> void dump(Head&& head) { cerr << head; dump(); }template<typename Head, typename... Tail> void dump(Head&& head, Tail&&... tail) { cerr << head << ", "; dump(forward<Tail>(tail)...); }#define debug(...) do {cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; dump(__VA_ARGS__); } while (false)#else#define dump(...)#define debug(...)#endif/* OTHER */#define fi first#define se second#define MP make_pair#define MT make_tuple#define tmax(x, y, z) max((x), max((y), (z)))#define tmin(x, y, z) min((x), min((y), (z)))template<typename T, typename A, typename B> inline bool between(T x, A a, B b) { return ((a <= x) && (x < b)); }template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }inline ll POW(ll a, ll b) { ll r = 1; do { if (b & 1) r *= a; a *= a; } while (b >>= 1); return r; }struct abracadabra {abracadabra() {cin.tie(nullptr); ios::sync_with_stdio(false);cout << fixed << setprecision(20);cerr << fixed << setprecision(5);};} ABRACADABRA;#pragma endregion#pragma region math modint/*** @brief ModInt* @docs docs/math/modint.md*/template< int MODULO > struct ModInt {using i32 = int;using i64 = long long;using u32 = unsigned int;using u64 = unsigned long long;u64 x; ModInt() : x(0) {}ModInt(i64 y) : x(set(y % MODULO + MODULO)) {}static u64 set(const i64 &y) { return (y < MODULO) ? y : y - MODULO; }ModInt operator+(const ModInt &m) const { return ModInt(set(x + m.x)); }ModInt operator-(const ModInt &m) const { return ModInt(set(x + MODULO - m.x)); }ModInt operator*(const ModInt &m) const { return ModInt(x * m.x % MODULO); }ModInt operator/(const ModInt &m) const { return ModInt(x) * ~ModInt(m.x); }ModInt &operator+=(const ModInt &m) { return *this = *this + m; }ModInt &operator-=(const ModInt &m) { return *this = *this - m; }ModInt &operator*=(const ModInt &m) { return *this = *this * m; }ModInt &operator/=(const ModInt &m) { return *this = *this / m; }ModInt &operator^=(const u64 &y) { return *this = *this ^ y; }ModInt operator~ () const { return *this ^ (MODULO - 2); }ModInt operator- () const { return ModInt(set(MODULO - x)); }ModInt operator! () const { return getFact(u32(*this)); }ModInt operator& () const { return getFinv(u32(*this)); }ModInt operator++() { return *this = ModInt(set(x + 1)); }ModInt operator--() { return *this = ModInt(set(x + MODULO - 1)); }bool operator==(const ModInt &m) const { return x == m.x; }bool operator!=(const ModInt &m) const { return x != m.x; }bool operator< (const ModInt &m) const { return x < m.x; }bool operator<=(const ModInt &m) const { return x <= m.x; }bool operator> (const ModInt &m) const { return x > m.x; }bool operator>=(const ModInt &m) const { return x >= m.x; }explicit operator u64() const { return x; }ModInt operator^(i64 y) const { return pow(x, y); }static ModInt pow(i64 x, i64 y) {bool neg = false;if (y < 0) y = -y, neg = true;ModInt u(1), t(x);while (y) { if (y & 1) u *= t; t *= t; y >>= 1; }return neg ? ModInt(1) / u : u;}friend ostream &operator<<(ostream &os, const ModInt< MODULO > &m) { return os << m.x; }friend istream &operator>>(istream &is, ModInt< MODULO > &m) { u64 y; is >> y; m = ModInt(y); return is; }static vector< ModInt > fact, finv, invs;static void init(u32 n) {u32 m = fact.size();if (n < m) return;fact.resize(n + 1, 1);finv.resize(n + 1, 1);invs.resize(n + 1, 1);if (m == 0) m = 1;for (u32 i = m; i <= n; ++i) fact[i] = fact[i - 1] * ModInt(i);finv[n] = ModInt(1) / fact[n];for (u32 i = n; i >= m; --i) finv[i - 1] = finv[i] * ModInt(i);for (u32 i = m; i <= n; ++i) invs[i] = finv[i] * fact[i - 1];}static ModInt getFact(u32 n) { init(n); return fact[n]; }static ModInt getFinv(u32 n) { init(n); return finv[n]; }static ModInt getInvs(u32 n) { init(n); return invs[n]; }static ModInt C(i64 n, i64 r) {if (r == 0) return ModInt(1);if (r < 0) return ModInt(0);if (n < 0) return ModInt(r & 1 ? MODULO - 1 : 1) * C(-n + r - 1, r);if (n == 0 || n < r) return ModInt(0);init(n);return fact[n] * finv[n - r] * finv[r];}static ModInt P(i64 n, i64 r) {if (n < r || r < 0) return ModInt(0);init(n);return fact[n] * finv[n - r];}static ModInt H(i64 n, i64 r) {if (n < 0 || r < 0) return ModInt(0);if (!n && !r) return ModInt(1);init(n + r - 1);return C(n + r - 1, r);}static ModInt montmort(u32 n) {ModInt res;init(n);for (u32 k = 2; k <= n; ++k) {if (k & 1) res -= finv[k];else res += finv[k];}return res *= fact[n];}static ModInt LagrangePolynomial(vector<ModInt> &y, i64 t) {u32 n = y.size() - 1;if (t <= n) return y[t];init(n + 1);ModInt res, num(1);for (int i = 0; i <= n; ++i) num *= ModInt(t - i);for (int i = 0; i <= n; ++i) {ModInt tmp = y[i] * num / (ModInt(t - i)) * finv[i] * finv[n - i];if ((n - i) & 1) res -= tmp;else res += tmp;}return res;}};template< int MODULO > vector<ModInt< MODULO >> ModInt< MODULO >::fact = vector<ModInt< MODULO >>();template< int MODULO > vector<ModInt< MODULO >> ModInt< MODULO >::finv = vector<ModInt< MODULO >>();template< int MODULO > vector<ModInt< MODULO >> ModInt< MODULO >::invs = vector<ModInt< MODULO >>();constexpr int MODULO = (int)1e9 + 7;using modint = ModInt< MODULO >;#pragma endregion// mod 9modint dp[100100][10];signed main() {SS(string, S);SS(int, D);int N = S.size();if (D == 0) {int _0 = 0, _1 = 0;REP(i, N) {if (S[i] == '0') ++_0;if (S[i] == '?') ++_1;}if (_0 + _1 != N) return print(0);return print(1);}dp[0][0] = 1;REP(i, N) {REP(j, 9) {if (S[i] == '?') {REP(k, 10) {dp[i + 1][(j + k) % 9] += dp[i][j];}} else {int dig = S[i] - '0';dp[i + 1][(j + dig) % 9] += dp[i][j];}}}if (D != 9) print(dp[N][D % 9]);else {modint res = dp[N][0];int _0 = 0, _1 = 0;REP(i, N) {if (S[i] == '0') ++_0;if (S[i] == '?') ++_1;}if (_0 + _1 == N) {res -= 1;}print(res);}}