#514481 (Go) No.54 Happy Hallowe'en

• 問題: No.54 Happy Hallowe'en
• ユーザー: aru aru
• 提出日時: 2020-07-19 17:57:05
• 言語: Go (1.23.4)
• 結果: AC
• 実行時間: 67 ms / 5,000 ms
• コード長: 1,929 bytes
• コンパイル時間: 13,262 ms
• コンパイル使用メモリ: 235,776 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-12-16 06:03:20
• 合計ジャッジ時間: 12,391 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

ファイルパターン	結果
other	AC * 19

ソースコード

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
134
135
136
137
138
139
140
141
142
143
144
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
}
type house struct {
    v, t int
}
var N int
var h []house
var memo [][]int
func rec(n, t int) int {
    if n == N {
        return 0
    }
    if t > 10000 {
        return 0
    }
    if memo[n][t] != 0 {
        return memo[n][t]
    }
    ret := rec(n+1, t)
    if t < h[n].t {
        ret = max(ret, rec(n+1, t+h[n].v)+h[n].v)
    }
    memo[n][t] = ret
    return ret
}
func main() {
    sc.Split(bufio.ScanWords)
    N = getInt()
    h = make([]house, N)
    for i := 0; i < N; i++ {
        h[i] = house{getInt(), getInt()}
    }
    sort.Slice(h, func(i, j int) bool {
        return h[i].t+h[i].v < h[j].t+h[j].v
    })
    var dp [200200]bool
    dp[0] = true
    for i := 0; i < N; i++ {
        for j := h[i].t - 1; j >= 0; j-- {
            dp[j+h[i].v] = dp[j+h[i].v] || dp[j]
        }
        // out(h[i], dp[:15])
    }
    ans := -1
    for i := 20000; i >= 0; i-- {
        if dp[i] {
            ans = i
            break
        }
    }
    out(ans)
    // memo = make([][]int, 10000)
    // for i := 0; i < 10000; i++ {
    //  memo[i] = make([]int, 10000)
    // }
    // ret := rec(0, 0)
    // out(ret)
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX