-
-
Notifications
You must be signed in to change notification settings - Fork 26
/
Copy pathtask.go
83 lines (70 loc) · 1.34 KB
/
task.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
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
package main
import (
"bufio"
"fmt"
"io"
"log"
"os"
"strconv"
"strings"
)
const (
SUCCESS = "True"
FAIL = "False"
)
func main() {
s := strings.Builder{}
Solution(os.Stdin, &s)
fmt.Println(s.String())
}
func Solution(r io.Reader, s *strings.Builder) {
var (
n int
sum int
err error
scanner = bufio.NewScanner(r)
)
// количество выигранных партий
scanner.Scan()
n, err = strconv.Atoi(scanner.Text())
if err != nil {
log.Fatal(err)
}
// соберем слайс заработанных в партиях очков
data := make([]int, n)
for scanner.Scan() {
arrString := strings.Split(scanner.Text(), " ")
for i := 0; i < len(arrString); i++ {
data[i], _ = strconv.Atoi(arrString[i])
sum += data[i]
}
}
if !CheckSum(n, sum, data) {
s.WriteString(FAIL)
return
}
s.WriteString(SUCCESS)
}
// CheckSum проверка суммы
func CheckSum(n, sum int, data []int) bool {
// базовый случай
if sum%2 != 0 {
return false
}
dpPrev := make([]int, sum/2+1)
dp := make([]int, sum/2+1)
for i := 1; i < n+1; i++ {
for g := 1; g < sum/2+1; g++ {
dp[g] = dpPrev[g]
if g == data[i-1] {
dp[g]++
}
if g > data[i-1] && dpPrev[g-data[i-1]] > 0 {
dp[g]++
}
}
dpPrev = dp
dp = make([]int, sum/2+1)
}
return dpPrev[sum/2] > 1
}