#549260 (Go) No.189 SUPER HAPPY DAY

• 問題: No.189 SUPER HAPPY DAY
• ユーザー: aru aru
• 提出日時: 2020-09-06 20:58:50
• 言語: Go (1.23.4)
• 結果: AC
• 実行時間: 53 ms / 5,000 ms
• コード長: 1,911 bytes
• コンパイル時間: 12,186 ms
• コンパイル使用メモリ: 223,260 KB
• 実行使用メモリ: 14,720 KB
• 最終ジャッジ日時: 2024-11-29 07:35:41
• 合計ジャッジ時間: 13,839 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

ファイルパターン	結果
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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
package main
import (
    "bufio"
    "fmt"
    "os"
    "sort"
    "strconv"
)
func out(x ...interface{}) {
    fmt.Println(x...)
}
var sc = bufio.NewScanner(os.Stdin)
func getInt() int {
    sc.Scan()
    i, e := strconv.Atoi(sc.Text())
    if e != nil {
        panic(e)
    }
    return i
}
func getInts(N int) []int {
    ret := make([]int, N)
    for i := 0; i < N; i++ {
        ret[i] = getInt()
    }
    return ret
}
func getString() string {
    sc.Scan()
    return sc.Text()
}
// min, max, asub, absなど基本関数
func max(a, b int) int {
    if a > b {
        return a
    }
    return b
}
func min(a, b int) int {
    if a < b {
        return a
    }
    return b
}
func asub(a, b int) int {
    if a > b {
        return a - b
    }
    return b - a
}
func abs(a int) int {
    if a >= 0 {
        return a
    }
    return -a
}
func lowerBound(a []int, x int) int {
    idx := sort.Search(len(a), func(i int) bool {
        return a[i] >= x
    })
    return idx
}
func upperBound(a []int, x int) int {
    idx := sort.Search(len(a), func(i int) bool {
        return a[i] > x
    })
    return idx
}
func condAB(c bool, a, b int) int {
    if c {
        return a
    }
    return b
}
const mod = 1000000009
func main() {
    sc.Split(bufio.ScanWords)
    M, D := getString(), getString()
    var dp1 [210][2][2020]int
    var dp2 [210][2][2020]int
    var f = func(dp *[210][2][2020]int, n int, d string) {
        dp[0][0][0] = 1
        for i := 0; i < n; i++ {
            for j := 0; j < 2; j++ {
                for k := 0; k <= 2010; k++ {
                    for a := 0; a <= condAB(j != 0, 9, int(d[i]-'0')); a++ {
                        jj := j
                        if a < int(d[i]-'0') {
                            jj = 1
                        }
                        // cond1
                        dp[i+1][jj][k+a] += dp[i][j][k]
                        dp[i+1][jj][k+a] %= mod
                    }
                }
            }
        }
    }
    f(&dp1, len(M), M)
    f(&dp2, len(D), D)
    ans := 0
    for i := 1; i <= 2000; i++ {
        x := dp1[len(M)][1][i] + dp1[len(M)][0][i]
        y := dp2[len(D)][1][i] + dp2[len(D)][0][i]
        // out(i, x, y)
        if x != 0 && y != 0 {
            ans += x * y
            ans %= mod
        }
    }
    out(ans)
    // out(dp1[len(M)])
    // out(dp2[len(D)])
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX