-
Notifications
You must be signed in to change notification settings - Fork 3
/
main.go
217 lines (176 loc) · 3.6 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
package main
import (
"io"
"strings"
aoc "github.com/teivah/advent-of-code"
)
func fs1(input io.Reader) int {
lines := aoc.ReaderToStrings(input)
rules, _, options := parse(lines)
sum := 0
for _, values := range options {
for _, value := range values {
valid := false
outer:
for _, windows := range rules {
for _, window := range windows {
if window.isValid(value) {
valid = true
break outer
}
}
}
if !valid {
sum += value
}
}
}
return sum
}
func parse(lines []string) (map[string][]Window, []int, [][]int) {
rules := make(map[string][]Window)
i := 0
for ; i < len(lines); i++ {
s := lines[i]
if s == "" {
break
}
idx := strings.Index(s, ":")
name := s[:idx]
s = s[idx+2:]
del := aoc.NewDelimiter(s, " or ")
rules[name] = append(rules[name], toWindow(del.GetString(0)))
rules[name] = append(rules[name], toWindow(del.GetString(1)))
}
i += 2
ticket := parseInts(lines[i])
i += 3
var options [][]int
for ; i < len(lines); i++ {
options = append(options, parseInts(lines[i]))
}
return rules, ticket, options
}
func parseInts(s string) []int {
del := aoc.NewDelimiter(s, ",")
w := del.GetStrings()
return aoc.StringsToInts(w)
}
type Window struct {
from int
to int
}
func (w Window) isValid(n int) bool {
return n >= w.from && n <= w.to
}
func toWindow(s string) Window {
del := aoc.NewDelimiter(s, "-")
return Window{
from: del.GetInt(0),
to: del.GetInt(1),
}
}
func fs2(input io.Reader) int {
lines := aoc.ReaderToStrings(input)
rules, ticket, options := parse(lines)
invalidTickets := make(map[int]bool)
for optionIdx, values := range options {
for _, value := range values {
valid := false
outer:
for _, windows := range rules {
for _, window := range windows {
if window.isValid(value) {
valid = true
break outer
}
}
}
if !valid {
invalidTickets[optionIdx] = true
break
}
}
}
possibilities := make(map[int]map[string]struct{})
for i := 0; i < len(options[0]); i++ {
remainingClasses := make(map[string]bool)
for name := range rules {
remainingClasses[name] = true
}
for ticketID, values := range options {
if invalidTickets[ticketID] {
continue
}
// Option
value := values[i]
for className := range remainingClasses {
rule := rules[className]
valid := false
for _, window := range rule {
if window.isValid(value) {
valid = true
break
}
}
if !valid {
delete(remainingClasses, className)
}
}
// Ticket
value = ticket[i]
for className := range remainingClasses {
rule := rules[className]
valid := false
for _, window := range rule {
if window.isValid(value) {
valid = true
break
}
}
if !valid {
delete(remainingClasses, className)
}
}
}
possibilities[i] = make(map[string]struct{})
for name := range remainingClasses {
possibilities[i][name] = struct{}{}
}
}
inDegree := make(map[int]int)
var q []string
for k, v := range possibilities {
inDegree[k] = len(v)
if len(v) == 1 {
q = append(q, getName(v))
}
}
for len(q) != 0 {
found := q[0]
q = q[1:]
for _, opts := range possibilities {
if len(opts) == 1 {
continue
}
delete(opts, found)
if len(opts) == 1 {
q = append(q, getName(opts))
}
}
}
res := 1
for rowID, names := range possibilities {
name := getName(names)
if strings.Contains(name, "departure") {
res *= ticket[rowID]
}
}
return res
}
func getName(m map[string]struct{}) string {
for k := range m {
return k
}
panic("not found")
}