mirror of
https://github.com/onyx-and-iris/aoc2024.git
synced 2026-04-08 18:13:36 +00:00
add day-05 + benchmarks
This commit is contained in:
6
day-05/internal/two/benchmark
Normal file
6
day-05/internal/two/benchmark
Normal file
@@ -0,0 +1,6 @@
|
||||
goos: linux
|
||||
goarch: amd64
|
||||
pkg: github.com/onyx-and-iris/aoc2024/day-05/internal/two
|
||||
cpu: Intel(R) Core(TM) i7-8700K CPU @ 3.70GHz
|
||||
BenchmarkSolve-12 1000000000 0.01270 ns/op
|
||||
ok github.com/onyx-and-iris/aoc2024/day-05/internal/two 0.083s
|
||||
65
day-05/internal/two/solve.go
Normal file
65
day-05/internal/two/solve.go
Normal file
@@ -0,0 +1,65 @@
|
||||
package two
|
||||
|
||||
import (
|
||||
"bytes"
|
||||
"slices"
|
||||
|
||||
log "github.com/sirupsen/logrus"
|
||||
|
||||
"github.com/onyx-and-iris/aoc2024/day-05/internal/util"
|
||||
)
|
||||
|
||||
func Solve(buf []byte) (int, error) {
|
||||
r := bytes.NewReader(buf)
|
||||
data, err := util.ParseLines(r)
|
||||
if err != nil {
|
||||
return 0, err
|
||||
}
|
||||
|
||||
var sum int
|
||||
|
||||
for i, products := range data[1] {
|
||||
inOrder := true
|
||||
for _, product := range products {
|
||||
for _, rulesets := range data[0] {
|
||||
if !slices.Contains(rulesets, product) {
|
||||
continue
|
||||
}
|
||||
|
||||
indx1, indx2 := slices.Index(products, rulesets[0]), slices.Index(products, rulesets[1])
|
||||
if indx1 != -1 && indx2 != -1 && indx2 < indx1 {
|
||||
inOrder = false
|
||||
break
|
||||
}
|
||||
}
|
||||
if !inOrder {
|
||||
break
|
||||
}
|
||||
}
|
||||
if !inOrder {
|
||||
sum += midOfFixedOrder(data[1][i], data[0])
|
||||
}
|
||||
}
|
||||
|
||||
return sum, nil
|
||||
}
|
||||
|
||||
func midOfFixedOrder(products []int, rulesets [][]int) int {
|
||||
log.Debugf("unordered products: %v", products)
|
||||
|
||||
for {
|
||||
var sorts int
|
||||
for _, ruleset := range rulesets {
|
||||
indx1, indx2 := slices.Index(products, ruleset[0]), slices.Index(products, ruleset[1])
|
||||
if indx1 != -1 && indx2 != -1 && indx2 < indx1 {
|
||||
products[indx1], products[indx2] = products[indx2], products[indx1]
|
||||
sorts++
|
||||
}
|
||||
}
|
||||
if sorts == 0 {
|
||||
break
|
||||
}
|
||||
}
|
||||
|
||||
return products[len(products)/2]
|
||||
}
|
||||
15
day-05/internal/two/solve_internal_test.go
Normal file
15
day-05/internal/two/solve_internal_test.go
Normal file
@@ -0,0 +1,15 @@
|
||||
package two
|
||||
|
||||
import (
|
||||
_ "embed"
|
||||
"os"
|
||||
"testing"
|
||||
)
|
||||
|
||||
//go:embed testdata/input.txt
|
||||
var data []byte
|
||||
|
||||
func BenchmarkSolve(b *testing.B) {
|
||||
os.Stdout, _ = os.Open(os.DevNull)
|
||||
Solve(data)
|
||||
}
|
||||
Reference in New Issue
Block a user