-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlargest-magic-square.go
More file actions
157 lines (133 loc) · 2.43 KB
/
Copy pathlargest-magic-square.go
File metadata and controls
157 lines (133 loc) · 2.43 KB
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
145
146
147
148
149
150
151
152
153
154
155
156
157
package main
import (
"fmt"
)
const (
h = iota
v
dl
dr
)
func largestMagicSquare(grid [][]int) int {
n, m := len(grid), len(grid[0])
ps := make([][][]int, 4)
for i := range ps {
ps[i] = make([][]int, n)
for j := range ps[i] {
ps[i][j] = make([]int, m)
}
}
// building prefix sums
for i := range n {
for j := range m {
// horizontal
var p int
if j > 0 {
p = ps[h][i][j-1]
}
ps[h][i][j] = p + grid[i][j]
// vertical
p = 0
if i > 0 {
p = ps[v][i-1][j]
}
ps[v][i][j] = p + grid[i][j]
// diagonal left
p = 0
if i > 0 && j > 0 {
p = ps[dl][i-1][j-1]
}
ps[dl][i][j] = p + grid[i][j]
// diagonal right
p = 0
if i > 0 && j < m-1 {
p = ps[dr][i-1][j+1]
}
ps[dr][i][j] = p + grid[i][j]
}
}
size := min(m, n)
for size > 1 {
for i := 0; i <= n-size; i++ {
for j := 0; j <= m-size; j++ {
// diagonal left
var value int
var p int
if i > 0 && j > 0 {
p = ps[dl][i-1][j-1]
}
value = ps[dl][i+size-1][j+size-1] - p
// diagonal right
p = 0
if i > 0 && j+size < m {
p = ps[dr][i-1][j+size]
}
if nv := ps[dr][i+size-1][j] - p; value != nv {
continue
}
// horizontal
ok := true
for di := i; di < i+size; di++ {
p = 0
if j > 0 {
p = ps[h][di][j-1]
}
if nv := ps[h][di][j+size-1] - p; value != nv {
ok = false
break
}
}
if !ok {
continue
}
// vertical
for dj := j; dj < j+size; dj++ {
p = 0
if i > 0 {
p = ps[v][i-1][dj]
}
if nv := ps[v][i+size-1][dj] - p; value != nv {
ok = false
break
}
}
if !ok {
continue
}
return size
}
}
size--
}
return size
}
func main() {
testCases := []struct {
grid [][]int
want int
}{
{
grid: [][]int{{7, 1, 4, 5, 6}, {2, 5, 1, 6, 4}, {1, 5, 4, 3, 2}, {1, 2, 7, 3, 4}},
want: 3,
},
{
grid: [][]int{{5, 1, 3, 1}, {9, 3, 3, 1}, {1, 3, 3, 8}},
want: 2,
},
}
successes := 0
for _, tc := range testCases {
x := largestMagicSquare(tc.grid)
status := "ERROR"
if fmt.Sprint(x) == fmt.Sprint(tc.want) {
status = "OK"
successes++
}
fmt.Println(status, " Expected: ", tc.want, " Actual: ", x)
}
if l := len(testCases); successes == len(testCases) {
fmt.Printf("===\nSUCCESS: %d of %d tests ended successfully\n", successes, l)
} else {
fmt.Printf("===\nFAIL: %d tests failed\n", l-successes)
}
}