-
Notifications
You must be signed in to change notification settings - Fork 27
/
Copy path11450.go
53 lines (48 loc) · 982 Bytes
/
11450.go
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
// UVa 11450 - Wedding shopping
package main
import (
"fmt"
"os"
)
func solve(m, c int, garments [][]int) int {
dp := make([][]int, c+1)
for i := range dp {
dp[i] = make([]int, m+1)
}
dp[0][0] = 1
for i, garment := range garments {
for _, price := range garment {
for k := price; k <= m; k++ {
dp[i+1][k] += dp[i][k-price]
}
}
}
for ; m >= 0; m-- {
if dp[c][m] != 0 {
return m
}
}
return 0
}
func main() {
in, _ := os.Open("11450.in")
defer in.Close()
out, _ := os.Create("11450.out")
defer out.Close()
var kase, m, c, n, price int
for fmt.Fscanf(in, "%d", &kase); kase > 0; kase-- {
fmt.Fscanf(in, "%d%d", &m, &c)
garments := make([][]int, c)
for i := range garments {
for fmt.Fscanf(in, "%d", &n); n > 0; n-- {
fmt.Fscanf(in, "%d", &price)
garments[i] = append(garments[i], price)
}
}
if max := solve(m, c, garments); max == 0 {
fmt.Fprintln(out, "no solution")
} else {
fmt.Fprintln(out, max)
}
}
}