-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.go
More file actions
141 lines (114 loc) · 3.11 KB
/
main.go
File metadata and controls
141 lines (114 loc) · 3.11 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
package main
import (
"bufio"
"fmt"
"io"
"math"
"os"
"path"
"sort"
"strings"
"time"
)
func input() *os.File {
input, err := os.Open(path.Join("2021", "8", "input.txt"))
if err != nil {
panic(err)
}
return input
}
type record struct {
patterns []string
output []string
}
var segmentsToDigit = map[string]int{
"abcefg": 0,
"cf": 1,
"acdeg": 2,
"acdfg": 3,
"bcdf": 4,
"abdfg": 5,
"abdefg": 6,
"acf": 7,
"abcdefg": 8,
"abcdfg": 9,
}
func solve(r io.Reader) {
scanner := bufio.NewScanner(r)
var records []record
for scanner.Scan() {
line := scanner.Text()
parts := strings.Split(line, " | ")
records = append(records, record{
patterns: strings.Split(parts[0], " "),
output: strings.Split(parts[1], " "),
})
}
if scanner.Err() != nil {
panic(scanner.Err())
}
sum := 0
now := time.Now()
for i, record := range records {
fmt.Println(i, time.Now().Sub(now))
mapping := findSignalSegmentMapping(record.patterns)
sum += translateDigits(record.output, mapping)
}
fmt.Println(sum)
}
var segments = []byte{'a', 'b', 'c', 'd', 'e', 'f', 'g'}
func findSignalSegmentMapping(patterns []string) map[byte]byte {
mapping := map[byte]byte{
'a': 'a',
'b': 'a',
'c': 'a',
'd': 'a',
'e': 'a',
'f': 'a',
'g': 'a',
}
for !areAllDigitsValid(patterns, mapping) {
index := 0
for mapping[segments[index]] == 'g' {
mapping[segments[index]] = 'a'
index++
}
mapping[segments[index]]++
}
return mapping
}
func translateDigits(digits []string, mapping map[byte]byte) int {
sum := 0
for i, digit := range digits {
v, ok := translateDigit(digit, mapping)
if !ok {
panic("should be a valid mapping")
}
sum += int(math.Pow10(len(digits)-i-1)) * v
}
return sum
}
func areAllDigitsValid(digits []string, mapping map[byte]byte) bool {
for _, digit := range digits {
_, ok := translateDigit(digit, mapping)
if !ok {
return false
}
}
return true
}
func translateDigit(digit string, mapping map[byte]byte) (int, bool) {
bytes := make([]byte, len(digit))
for i := 0; i < len(digit); i++ {
bytes[i] = mapping[digit[i]]
}
sort.Slice(bytes, func(i, j int) bool {
return bytes[i] < bytes[j]
})
val, ok := segmentsToDigit[string(bytes)]
return val, ok
}
func main() {
solve(strings.NewReader("be cfbegad cbdgef fgaecd cgeb fdcge agebfd fecdb fabcd edb | fdgacbe cefdb cefbgd gcbe\nedbfga begcd cbg gc gcadebf fbgde acbgfd abcde gfcbed gfec | fcgedb cgb dgebacf gc\nfgaebd cg bdaec gdafb agbcfd gdcbef bgcad gfac gcb cdgabef | cg cg fdcagb cbg\nfbegcd cbd adcefb dageb afcb bc aefdc ecdab fgdeca fcdbega | efabcd cedba gadfec cb\naecbfdg fbg gf bafeg dbefa fcge gcbea fcaegb dgceab fcbdga | gecf egdcabf bgf bfgea\nfgeab ca afcebg bdacfeg cfaedg gcfdb baec bfadeg bafgc acf | gebdcfa ecba ca fadegcb\ndbcfg fgd bdegcaf fgec aegbdf ecdfab fbedc dacgb gdcebf gf | cefg dcbef fcge gbcadfe\nbdfegc cbegaf gecbf dfcage bdacg ed bedf ced adcbefg gebcd | ed bcgafe cdgba cbgef\negadfb cdbfeg cegd fecab cgb gbdefca cg fgcdab egfdb bfceg | gbdfcae bgc cg cgb\ngcafb gcf dcaebfg ecagb gf abcdeg gaef cafbge fdbac fegbdc | fgae cfgab fg bagce"))
solve(input())
}