add day-05 + benchmarks

day-05/internal/one/benchmark

@@ -0,0 +1,6 @@
+goos: linux
+goarch: amd64
+pkg: github.com/onyx-and-iris/aoc2024/day-05/internal/one
+cpu: Intel(R) Core(TM) i7-8700K CPU @ 3.70GHz
+BenchmarkSolve-12    	1000000000	         0.007571 ns/op
+ok  	github.com/onyx-and-iris/aoc2024/day-05/internal/one	0.052s

day-05/internal/one/solve.go

@@ -0,0 +1,43 @@
+package one
+
+import (
+	"bytes"
+	"slices"
+
+	"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 _, rules := range data[0] {
+				if !slices.Contains(rules, product) {
+					continue
+				}
+
+				indx1, indx2 := slices.Index(products, rules[0]), slices.Index(products, rules[1])
+				if indx1 != -1 && indx2 != -1 && indx2 < indx1 {
+					inOrder = false
+					break
+				}
+			}
+			if !inOrder {
+				break
+			}
+		}
+		if inOrder {
+			sum += data[1][i][len(data[1][i])/2]
+		}
+	}
+
+	return sum, nil
+}

day-05/internal/one/solve_internal_test.go

@@ -0,0 +1,15 @@
+package one
+
+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)
+}

day-05/internal/two/benchmark

@@ -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

day-05/internal/two/solve.go

@@ -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]
+}

day-05/internal/two/solve_internal_test.go

@@ -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)
+}

day-05/internal/util/util.go

@@ -0,0 +1,49 @@
+package util
+
+import (
+	"bufio"
+	"io"
+	"log"
+	"strconv"
+	"strings"
+)
+
+func MustConv(s string) int {
+	n, err := strconv.Atoi(s)
+	if err != nil {
+		panic(err)
+	}
+	return n
+}
+
+func ParseLines(r io.Reader) ([][][]int, error) {
+	data := make([][][]int, 2)
+
+	filter := func(r rune) bool {
+		return r == '|' || r == ','
+	}
+
+	buf, err := io.ReadAll(r)
+	if err != nil {
+		log.Fatal(err)
+	}
+	parts := strings.Split(string(buf), "\n\n")
+
+	for i, part := range parts {
+		scanner := bufio.NewScanner(strings.NewReader(part))
+		for scanner.Scan() {
+			filtered := strings.FieldsFunc(scanner.Text(), filter)
+			var nums []int
+			for _, n := range filtered {
+				nums = append(nums, MustConv(n))
+			}
+			data[i] = append(data[i], nums)
+		}
+
+		if err := scanner.Err(); err != nil {
+			return nil, err
+		}
+	}
+
+	return data, nil
+}