結果
問題 | No.189 SUPER HAPPY DAY |
ユーザー | paruki |
提出日時 | 2016-08-27 11:12:08 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 2,757 bytes |
コンパイル時間 | 1,748 ms |
コンパイル使用メモリ | 170,984 KB |
実行使用メモリ | 6,400 KB |
最終ジャッジ日時 | 2024-11-08 19:03:06 |
合計ジャッジ時間 | 3,431 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4 ms
6,272 KB |
testcase_01 | AC | 4 ms
6,144 KB |
testcase_02 | AC | 4 ms
6,272 KB |
testcase_03 | AC | 4 ms
6,272 KB |
testcase_04 | AC | 4 ms
6,400 KB |
testcase_05 | AC | 4 ms
6,400 KB |
testcase_06 | AC | 4 ms
6,144 KB |
testcase_07 | AC | 5 ms
6,144 KB |
testcase_08 | AC | 4 ms
6,272 KB |
testcase_09 | AC | 4 ms
6,272 KB |
testcase_10 | AC | 4 ms
6,272 KB |
testcase_11 | AC | 4 ms
6,272 KB |
testcase_12 | AC | 4 ms
6,144 KB |
testcase_13 | AC | 8 ms
6,272 KB |
testcase_14 | AC | 9 ms
6,272 KB |
testcase_15 | AC | 9 ms
6,144 KB |
testcase_16 | AC | 10 ms
6,272 KB |
testcase_17 | AC | 10 ms
6,272 KB |
testcase_18 | AC | 9 ms
6,272 KB |
testcase_19 | AC | 11 ms
6,400 KB |
testcase_20 | AC | 7 ms
6,272 KB |
testcase_21 | AC | 6 ms
6,272 KB |
testcase_22 | AC | 4 ms
6,272 KB |
testcase_23 | RE | - |
testcase_24 | RE | - |
testcase_25 | RE | - |
ソースコード
#include "bits/stdc++.h" using namespace std; #define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i)) #define rep(i,j) FOR(i,0,j) #define each(x,y) for(auto &(x):(y)) #define mp make_pair #define all(x) (x).begin(),(x).end() #define debug(x) cout<<#x<<": "<<(x)<<endl #define smax(x,y) (x)=max((x),(y)) #define smin(x,y) (x)=min((x),(y)) #define MEM(x,y) memset((x),(y),sizeof (x)) #define sz(x) (int)(x).size() typedef long long ll; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<ll> vll; template<int MOD> class ModInt{ public: ModInt():value(0){} ModInt(long long val):value((int)(val<0?MOD+val%MOD:val%MOD)){ } ModInt& operator+=(ModInt that){ value = value+that.value; if(value>=MOD)value-=MOD; return *this; } ModInt& operator-=(ModInt that){ value -= that.value; if(value<0)value+=MOD; return *this; } ModInt& operator*=(ModInt that){ value = (int)((long long)value * that.value % MOD); return *this; } ModInt &operator/=(ModInt that){ return *this *= that.inverse(); } ModInt operator+(ModInt that) const{ return ModInt(*this)+=that; } ModInt operator-(ModInt that) const{ return ModInt(*this)-=that; } ModInt operator*(ModInt that) const{ return ModInt(*this)*=that; } ModInt operator/(ModInt that) const { return ModInt(*this) /= that; } ModInt pow(long long k) const{ if(value == 0)return 0; ModInt n = *this, res = 1; while(k){ if(k & 1)res *= n; n *= n; k >>= 1; } return res; } ModInt inverse() const { long long a = value, b = MOD, u = 1, v = 0; while(b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } return ModInt(u); } int toi() const{ return value; } private: int value; }; typedef ModInt<1000000009> mint; ostream& operator<<(ostream& os, const mint& x){ os << x.toi(); return os; } const int R = 1801; mint dp[201][R][2]; vector<mint> f(string &s){ vector<mint> res(R); each(c, s)c -= '0'; rep(i, sz(s) + 1)rep(j, R)rep(k, 2)dp[i][j][k] = 0; dp[0][0][0] = 1; rep(i, sz(s))rep(sm,R)rep(l,2)if(dp[i][sm][l].toi()){ rep(d, 10){ if(d > s[i] && !l)break; dp[i + 1][sm + d][l | (d < s[i])] += dp[i][sm][l]; } } rep(i, R)rep(j, 2)res[i] += dp[sz(s)][i][j]; return res; } int main(){ string M, D; vector<mint> x, y; mint ans; cin >> M >> D; x = f(M); y = f(D); FOR(i,1,R)ans += x[i] * y[i]; cout << ans << endl; }