-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.go
196 lines (157 loc) · 3.43 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
package main
import (
"github.com/danvolchek/AdventOfCode/lib"
"strconv"
"strings"
)
type cdInstr struct {
arg string
}
type lsEntry struct {
dir bool
name string
size int
}
type lsInstr struct {
entries []lsEntry
}
type instruction struct {
cd *cdInstr
ls *lsInstr
}
func parse(line string) []instruction {
lines := strings.Split(line, "\n")
var instructions []instruction
i := 0
for i < len(lines) {
if strings.Index(lines[i], "$ cd ") == 0 {
instructions = append(instructions, instruction{
cd: &cdInstr{arg: lines[i][len("$ cd "):]},
ls: nil,
})
i += 1
} else if strings.Index(lines[i], "$ ls") == 0 {
var lsEntries []lsEntry
j := i + 1
for {
ints := lib.Ints(lines[j])
if len(ints) != 0 {
lsEntries = append(lsEntries, lsEntry{
name: strings.TrimSpace(strings.ReplaceAll(lines[j], strconv.Itoa(ints[0]), "")),
size: ints[0],
})
} else if strings.Index(lines[j], "dir") == 0 {
lsEntries = append(lsEntries, lsEntry{
dir: true,
name: lines[j][len("dir "):],
})
} else {
break
}
j += 1
if j == len(lines) {
break
}
}
instructions = append(instructions, instruction{ls: &lsInstr{lsEntries}})
i = j
} else if lines[i] != "" {
panic(lines[i])
} else {
break
}
}
return instructions
}
type file struct {
name string
size int
}
func (f file) Size() int {
return f.size
}
type directory struct {
name string
files []file
directories []*directory
parent *directory
size int
}
func (d *directory) Size() int {
if d.size != 0 {
return d.size
}
mySize := lib.SumSlice(lib.Map(d.files, file.Size)) + lib.SumSlice(lib.Map(d.directories, func(dd *directory) int {
return dd.Size()
}))
d.size = mySize
return mySize
}
func buildFileSystem(lines []instruction) *directory {
var root = &directory{
name: "/",
}
var cwd = root
outer:
for _, instr := range lines {
if instr.cd != nil {
if instr.cd.arg == ".." {
cwd = cwd.parent
continue outer
}
for _, dirs := range cwd.directories {
if dirs.name == instr.cd.arg {
cwd = dirs
continue outer
}
}
if cwd != root {
panic("bad")
}
} else {
for _, entry := range instr.ls.entries {
if !entry.dir {
cwd.files = append(cwd.files, file{
name: entry.name,
size: entry.size,
})
} else {
newDir := &directory{
name: entry.name,
parent: cwd,
}
cwd.directories = append(cwd.directories, newDir)
}
}
}
}
return root
}
func getSmallestToDel(d *directory, smallest int, min int) int {
for _, child := range d.directories {
r := getSmallestToDel(child, smallest, min)
if r < smallest {
smallest = r
}
}
if d.Size() < smallest && d.Size() >= min {
smallest = d.Size()
}
return smallest
}
func solve(lines []instruction) int {
root := buildFileSystem(lines)
totalSpaceUsed := root.Size()
totalSpaceRemaining := 70000000 - totalSpaceUsed
totalSpaceNeeded := 30000000 - totalSpaceRemaining
ret := getSmallestToDel(root, 70000000*2, totalSpaceNeeded)
return ret
}
func main() {
solver := lib.Solver[[]instruction, int]{
ParseF: parse,
SolveF: solve,
}
solver.Expect("$ cd /\n$ ls\ndir a\n14848514 b.txt\n8504156 c.dat\ndir d\n$ cd a\n$ ls\ndir e\n29116 f\n2557 g\n62596 h.lst\n$ cd e\n$ ls\n584 i\n$ cd ..\n$ cd ..\n$ cd d\n$ ls\n4060174 j\n8033020 d.log\n5626152 d.ext\n7214296 k", 24933642)
solver.Verify(214171)
}