結果
問題 | No.189 SUPER HAPPY DAY |
ユーザー |
|
提出日時 | 2024-10-14 13:39:30 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 75 ms / 5,000 ms |
コード長 | 3,254 bytes |
コンパイル時間 | 8,548 ms |
コンパイル使用メモリ | 351,420 KB |
実行使用メモリ | 47,744 KB |
最終ジャッジ日時 | 2024-10-14 13:39:40 |
合計ジャッジ時間 | 9,924 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include<bits/stdc++.h>#include <atcoder/all>using ull = unsigned long long;using namespace std;using namespace atcoder;using vst = vector<string>;using ll = long long;using ld = long double;using P = pair<ll,ll>;using vl = vector<ll>;using vvl = vector<vl>;using vP = vector<P>;#define rep(i, n) for (ll i = 0; i < n; i++)#define repp(i,k,n) for (ll i = k; i < n; i++)#define per(i,s,e) for(ll i = s; i >= e; i--)#define all(v) v.begin(),v.end()#define yesno(a) a ? cout << "Yes" << '\n' : cout << "No" << '\n'#define YESNO(a) a ? cout << "YES" << '\n' : cout << "NO" << '\n'#define UNOmap unordered_map#define UNOset unordered_set#define chmax(a,b) a=max(a,b)#define chmin(a,b) a=min(a,b)#define debug(x) cerr << #x << " = " << x << '\n'template<class... T>void in(T&... a){(cin >> ... >> a);}template<class T, class... Ts>void out(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << '\n';}template<class T> void vin2(vector<T> &u,vector<T> &v){for(ll i = 0; i < (ll)v.size(); i++) in(u[i],v[i]);}template<class T> void vin(vector<T> &v){for(ll i = 0; i < (ll)v.size(); i++)in(v[i]);}template<class T> void vout(vector<T> &v){for(ll i = 0; i < (ll)v.size(); i++) cout << v[i] << ' ';cout << "\n";}void voutm(vector<modint998244353> &v){for(ll i = 0; i < (ll)v.size(); i++) cout << v[i].val() << ' ';cout << "\n";}ll INF = 1152921504606846976;ll MOD =998244353; ll MOD1 =1000000007;/* INF = 1LL << 60 */#define sl(...) ll __VA_ARGS__; in(__VA_ARGS__)// using mint = modint998244353;// using mint1 = modint1000000007;// using mintn = modint;// using vm = vector<mint>;// using vvm = vector<vm>;vl dx = {0,0,1,-1}, dy = {1,-1,0,0};//----------------------------------------------using mint = modint;int main(){ios::sync_with_stdio(false);cin.tie(nullptr);cout<<fixed<<setprecision(15);//==============================================modint::set_mod(MOD1+2);string M,D;in(M,D);// MとDそれぞれで桁dpをする!ll K = M.size();ll L = D.size();vector dp1(K+1,vector(2000,vector(2,mint(0))));dp1[0][0][0] = 1;rep(i,K){rep(j,2000){ll s = M[i]-'0';if(dp1[i][j][0].val()){dp1[i+1][j+s][0] += dp1[i][j][0];rep(k,s){dp1[i+1][j+k][1] += dp1[i][j][0];}}if(dp1[i][j][1].val()){rep(k,10){dp1[i+1][j+k][1] += dp1[i][j][1];}}}}vector dp2(L+1,vector(2000,vector(2,mint(0))));dp2[0][0][0] = 1;rep(i,L){rep(j,2000){ll s = D[i]-'0';if(dp2[i][j][0].val()){dp2[i+1][j+s][0] += dp2[i][j][0];rep(k,s){dp2[i+1][j+k][1] += dp2[i][j][0];}}if(dp2[i][j][1].val()){rep(k,10){dp2[i+1][j+k][1] += dp2[i][j][1];}}}}mint ans = 0;repp(i,1,2000){ans += (dp1[K][i][0] + dp1[K][i][1])*(dp2[L][i][0] + dp2[L][i][1]);}out(ans.val());}