-
Notifications
You must be signed in to change notification settings - Fork 529
/
main.go
319 lines (294 loc) · 6.4 KB
/
main.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
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
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
package main
import (
. "fmt"
"sort"
)
func collections() {
ifElseI := func(cond bool, r1, r2 int) int {
if cond {
return r1
}
return r2
}
ifElseS := func(cond bool, r1, r2 string) string {
if cond {
return r1
}
return r2
}
const mod int = 1e9 + 7
dirOffset4 := [...][2]int{{1, 0}, {0, 1}, {-1, 0}, {0, -1}}
min := func(a, b int) int {
if a < b {
return a
}
return b
}
max := func(a, b int) int {
if a > b {
return a
}
return b
}
_ = []interface{}{Print, ifElseI, ifElseS, dirOffset4, min, max}
}
func shiftGrid(grid [][]int, k int) [][]int {
n, m := len(grid), len(grid[0])
g := make([][]int, n)
for i := range g {
g[i] = make([]int, m)
}
for i, gi := range grid {
for j, gij := range gi {
newPos := i*m + j + k
ni, nj := newPos/m%n, newPos%m
g[ni][nj] = gij
}
}
return g
}
type TreeNode struct {
Val int
Left *TreeNode
Right *TreeNode
}
type FindElements struct {
has map[int]bool
}
func Constructor(root *TreeNode) FindElements {
f := FindElements{map[int]bool{}}
f.dfs(root, 0)
return f
}
func (f *FindElements) dfs(o *TreeNode, v int) {
if o != nil {
f.has[v] = true
f.dfs(o.Left, v*2+1)
f.dfs(o.Right, v*2+2)
}
}
func (f *FindElements) Find(target int) bool {
return f.has[target]
}
func maxSumDivThree(nums []int) int {
arr1 := []int{}
arr2 := []int{}
ans := 0
for _, v := range nums {
if v%3 == 0 {
ans += v
} else if v%3 == 1 {
arr1 = append(arr1, v)
} else {
arr2 = append(arr2, v)
}
}
sort.Ints(arr1)
sort.Ints(arr2)
n1, n2 := len(arr1), len(arr2)
if len(arr1) >= 6 {
start := n1%3 + 3
for _, v := range arr1[start:] {
ans += v
}
arr1 = arr1[:start]
}
if len(arr2) >= 6 {
start := n2%3 + 3
for _, v := range arr2[start:] {
ans += v
}
arr2 = arr2[:start]
}
n1, n2 = len(arr1), len(arr2)
max := func(a, b int) int {
if a > b {
return a
}
return b
}
base := ans
for i := 0; i <= n1; i++ {
for j := 0; j <= n2; j++ {
// choose i arr1 and j arr2
if (i+2*j)%3 != 0 {
continue
}
tmpSum := base
for ii := n1 - 1; ii >= n1-i; ii-- {
tmpSum += arr1[ii]
}
for ii := n2 - 1; ii >= n2-j; ii-- {
tmpSum += arr2[ii]
}
ans = max(ans, tmpSum)
}
}
return ans
}
func minPushBox(grid [][]byte) int {
min := func(a, b int) int {
if a < b {
return a
}
return b
}
n, m := len(grid), len(grid[0])
isValid := func(i, j int) bool {
return i >= 0 && i < n && j >= 0 && j < m && grid[i][j] != '#'
}
findPos := func(c byte) (int, int) {
for i, gi := range grid {
for j, gij := range gi {
if gij == c {
return i, j
}
}
}
panic(c)
}
initI, initJ := findPos('S')
finalI, finalJ := findPos('T')
dirOffset4 := [...][2]int{{1, 0}, {0, 1}, {-1, 0}, {0, -1}}
var ti, tj int
var dfsGrid func(i, j int) bool
var vis [20][20]bool
dfsGrid = func(i, j int) bool {
if !isValid(i, j) {
return false
}
if i == ti && j == tj {
return true
}
if vis[i][j] {
return false
}
vis[i][j] = true
res := false
for _, dir := range dirOffset4 {
if dfsGrid(i+dir[0], j+dir[1]) {
res = true
}
}
return res
}
canReach := func(si, sj, i, j int) bool {
if !isValid(i, j) {
return false
}
ti, tj = i, j
// var si, sj int
//outer:
// for i, gi := range grid {
// for j, gij := range gi {
// if gij == 'S' {
// si, sj = i, j
// break outer
// }
// }
// }
vis = [20][20]bool{}
return dfsGrid(si, sj)
}
const inf int = 1e8
// min steps when box in (i,j)
dp := make([][]int, n)
for i := range dp {
dp[i] = make([]int, m)
for j := range dp[i] {
dp[i][j] = inf
}
}
var dfs func(i, j int) int
dfs = func(i, j int) int {
if !isValid(i, j) {
return -1
}
if i == finalI && j == finalJ {
return 0
}
if dp[i][j] != inf {
return dp[i][j]
}
dp[i][j] = 2 * inf
oldI, oldJ := initI, initJ
ans := inf
for _, dir := range dirOffset4 {
if !canReach(oldI, oldJ, i-dir[0], j-dir[1]) {
continue
}
if !isValid(i+dir[0], j+dir[1]) {
continue
}
initI, initJ = i+dir[0], j+dir[1]
//Println(initI, initJ)
newAns := dfs(initI, initJ)
if newAns == -1 {
continue
}
ans = min(ans, newAns+1)
}
initI, initJ = oldI, oldJ
if ans >= inf {
ans = -1
}
dp[i][j] = ans
return ans
}
boxI, boxJ := findPos('B')
return dfs(boxI, boxJ)
}
func main() {
//Println(shiftGrid([][]int{
// {1, 2}, {3, 4}, {5, 6},
//}, 100))
//
//Println(maxSumDivThree([]int{3, 6, 5, 1, 8}))
//Println(maxSumDivThree([]int{4}))
//Println(maxSumDivThree([]int{1, 2, 3, 4, 4}))
//Println(maxSumDivThree([]int{5, 2, 2, 2}))
//Println(maxSumDivThree([]int{13, 21, 7, 27, 40, 18, 37, 7, 31, 5}))
//Println(maxSumDivThree([]int{366, 809, 6, 792, 822, 181, 210, 588, 344, 618, 341, 410, 121, 864, 191, 749, 637, 169, 123, 472, 358, 908, 235, 914, 322, 946, 738, 754, 908, 272, 267, 326, 587, 267, 803, 281, 586, 707, 94, 627, 724, 469, 568, 57, 103, 984, 787, 552, 14, 545, 866, 494, 263, 157, 479, 823, 835, 100, 495, 773, 729, 921, 348, 871, 91, 386, 183, 979, 716, 806, 639, 290, 612, 322, 289, 910, 484, 300, 195, 546, 499, 213, 8, 623, 490, 473, 603, 721, 793, 418, 551, 331, 598, 670, 960, 483, 154, 317, 834, 352}))
toBytes := func(g [][]string) [][]byte {
res := make([][]byte, len(g))
for i := range res {
res[i] = make([]byte, len(g[0]))
for j := range res[i] {
res[i][j] = g[i][j][0]
}
}
return res
}
Println(minPushBox(toBytes([][]string{
{"#", "#", "#", "#", "#", "#"},
{"#", "T", "#", "#", "#", "#"},
{"#", ".", ".", "B", ".", "#"},
{"#", ".", "#", "#", ".", "#"},
{"#", ".", ".", ".", "S", "#"},
{"#", "#", "#", "#", "#", "#"},
})))
Println(minPushBox(toBytes([][]string{
{"#", "#", "#", "#", "#", "#"},
{"#", "T", "#", "#", "#", "#"},
{"#", ".", ".", "B", ".", "#"},
{"#", "#", "#", "#", ".", "#"},
{"#", ".", ".", ".", "S", "#"},
{"#", "#", "#", "#", "#", "#"},
})))
Println(minPushBox(toBytes([][]string{
{"#", "#", "#", "#", "#", "#"},
{"#", "T", ".", ".", "#", "#"},
{"#", ".", "#", "B", ".", "#"},
{"#", ".", ".", ".", ".", "#"},
{"#", ".", ".", ".", "S", "#"},
{"#", "#", "#", "#", "#", "#"},
})))
Println(minPushBox(toBytes([][]string{
{"#", ".", ".", "#", "#", "#", "#", "#"},
{"#", ".", ".", "T", "#", ".", ".", "#"},
{"#", ".", ".", ".", "#", "B", ".", "#"},
{"#", ".", ".", ".", ".", ".", ".", "#"},
{"#", ".", ".", ".", "#", ".", "S", "#"},
{"#", ".", ".", "#", "#", "#", "#", "#"},
})))
}