#21196 (C++11) No.189 SUPER HAPPY DAY

• 問題: No.189 SUPER HAPPY DAY
• ユーザー: __math
• 提出日時: 2015-04-22 00:15:48
• 言語: C++11 (gcc 13.3.0)
• 結果: AC
• 実行時間: 10 ms / 5,000 ms
• コード長: 2,127 bytes
• コンパイル時間: 907 ms
• コンパイル使用メモリ: 104,896 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-04 19:38:29
• 合計ジャッジ時間: 1,755 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

ファイルパターン	結果
sample	AC * 3
other	AC * 23

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_DEPRECATE
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <limits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>
#include <iterator>
#include <bitset>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)(c).size())
#define ten(x) ((int)1e##x)
#define tenll(x) ((ll)1e##x)
// #pragma comment(linker,"/STACK:36777216")
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> void chmax(T& l, const T r) { l = max(l, r); }
template<class T> void chmin(T& l, const T r) { l = min(l, r); }
const int MOD = ten(9) + 9;
vector<ll> digit_dp(const string& s){
    vector<int> a;
    for (auto c : s) a.push_back(c - '0');
    reverse(a.begin(), a.end());
    static ll buf[4][2010];
    memset(buf, 0, sizeof(buf));
    auto pv_leq = buf[0], pv_gt = buf[1], nt_leq = buf[2], nt_gt = buf[3];
    pv_leq[0] = 1;
    FOR(i, sz(a)){
        memset(nt_leq, 0, sizeof(buf[0]));
        memset(nt_gt, 0, sizeof(buf[0]));
        FOR(j, 2010) {
            if (pv_leq[j] == 0 && pv_gt[j] == 0) continue;
            FOR(d, 10) {
                int nj = j + d;
                if (d > a[i]) {
                    (nt_gt[nj] += pv_leq[j] + pv_gt[j]) %= MOD;
                } else if (d < a[i]) {
                    (nt_leq[nj] += pv_leq[j] + pv_gt[j]) %= MOD;
                } else {
                    (nt_leq[nj] += pv_leq[j]) %= MOD;
                    (nt_gt[nj] += pv_gt[j]) %= MOD;
                }
            }
        }
        swap(pv_leq, nt_leq);
        swap(pv_gt, nt_gt);
    }
    --pv_leq[0];
    vector<ll> ret;
    FOR(i, 2010) ret.push_back(pv_leq[i]);
    return ret;
}
int main() {
    string m, d; cin >> m >> d;
    auto x = digit_dp(m);
    auto y = digit_dp(d);
    ll ans = 0;
    FOR(i, 2010) ans += x[i] * y[i] % MOD;
    cout << ans % MOD << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX