結果

問題 No.189 SUPER HAPPY DAY
ユーザー eggkid6
提出日時 2023-09-27 21:19:46
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 60 ms / 5,000 ms
コード長 2,915 bytes
コンパイル時間 2,279 ms
コンパイル使用メモリ 202,520 KB
最終ジャッジ日時 2025-02-17 02:40:34
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using V = vector<ll>;
using VV = vector<V>;
using VVV = vector<VV>;
using VVVV = vector<VVV>;
using VVVVV = vector<VVVV>;
using VVVVVV = vector<VVVVV>;
using VS = vector<string>;
using VB = vector<bool>;
using P = pair<ll,ll>;
using M = map<ll,ll>;
using Q = queue<ll>;
using PQ = priority_queue<ll>;
using PQG = priority_queue<ll,V,greater<ll>>;
using S = set<ll>;
using VP = vector<P>;
const ll MOD = 1000000007;
const ll mod = 998244353;
const ll INF = 1LL << 60;
#define rep(i,n) for(ll i = 0; i < n; i++)
#define rep2(i,s,n) for(ll i = s; i < n; i++)
#define per(i,n) for(ll i = n-1; i >= 0; i--)
#define per2(i,s,n) for(ll i = n-1; i >= s; i--)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define cfix(x) cout<<fixed<<setprecision(x)
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return true;}return false;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return true;}return false;}
template<class T>void Vin(vector<T>&a){rep(i,(ll)a.size())cin>>a[i];}
template<class T>void VVin(vector<vector<T>>&a){rep(i,(ll)a.size())Vin(a[i]);}
template<class T>void Vout(const vector<T>&a){rep(i,(ll)a.size()-1)cout<<a[i]<<" ";cout<<a.back()<<'\n';}
template<class T>void Voutl(const vector<T>&a){rep(i,(ll)a.size())cout<<a[i]<<'\n';}
ll power(ll a,ll b,const ll&M){a%=M;ll res=1;while(b>0){if(b&1)res=res*a%M;a=a*a%M;b>>=1;}return res;}
const ll H[4] = {0,1,0,-1}, W[4] = {1,0,-1,0};
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    string m, d;
    cin >> m >> d;
    ll ms = m.size(), ds = d.size();
    VVV mdp(ms + 1, VV(2, V(2000)));
    mdp[0][0][0] = 1;
    ll M = MOD + 2;
    rep(i, ms) {
        ll digit = m[i] - '0';
        rep(smaller, 2) {
            rep(j, 2000) {
                rep(k, min((smaller ? 10 : digit + 1), 2000 - j)) {
                    mdp[i + 1][smaller || k < digit][j + k] += mdp[i][smaller][j];
                    mdp[i + 1][smaller || k < digit][j + k] %= M;
                }
            }
        }
    }
    VVV ddp(ds + 1, VV(2, V(2000)));
    ddp[0][0][0] = 1;
    rep(i, ds) {
        ll digit = d[i] - '0';
        rep(smaller, 2) {
            rep(j, 2000) {
                rep(k, min((smaller ? 10 : digit + 1), 2000 - j)) {
                    ddp[i + 1][smaller || k < digit][j + k] += ddp[i][smaller][j];
                    ddp[i + 1][smaller || k < digit][j + k] %= M;
                }
            }
        }
    }
    ll ans = 0;
    rep(i, 2000) {
        ans += (mdp[ms][0][i] + mdp[ms][1][i] - (i == 0)) * (ddp[ds][0][i] + ddp[ds][1][i] - (i == 0));
        ans %= M;
    }
    cout << ans << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0