-
Notifications
You must be signed in to change notification settings - Fork 522
/
d.go
55 lines (51 loc) · 861 Bytes
/
d.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
package main
// github.com/EndlessCheng/codeforces-go
func minChanges(a []int, k int) (ans int) {
cnt := make([][1024]int, k)
n := len(a)
mi := n
for i := 0; i < k; i++ {
mx := 0
for j := i; j < n; j += k {
cnt[i][a[j]]++
mx = max(mx, cnt[i][a[j]])
}
ans += mx
mi = min(mi, mx)
}
ans -= mi
dp := make([][1024]int, k-1)
for i := range dp {
for j := 0; j < 1024; j++ {
dp[i][j] = -1
}
}
var f func(int, int) int
f = func(p, xor int) (res int) {
if p == k-1 {
return cnt[p][xor]
}
dv := &dp[p][xor]
if *dv >= 0 {
return *dv
}
defer func() { *dv = res }()
for i := p; i < n; i += k {
res = max(res, cnt[p][a[i]]+f(p+1, xor^a[i]))
}
return
}
return n - max(ans, f(0, 0))
}
func min(a, b int) int {
if a < b {
return a
}
return b
}
func max(a, b int) int {
if a > b {
return a
}
return b
}