feat(2025): add day 11 and bench day 10

Author: believer

go/2025/README.md

@@ -27,22 +27,26 @@ Collect stars by solving puzzles. Two puzzles will be made available on each day
 | [Day 7: Laboratories](https://github.com/believer/advent-of-code/blob/master/go/2025/puzzles/day07/main.go)        | 🌟  |          1711 | 🌟  |  36706966158365 |
 | [Day 8: Playground](https://github.com/believer/advent-of-code/blob/master/go/2025/puzzles/day08/main.go)          | 🌟  |         69192 | 🌟  |      7264308110 |
 | [Day 9: Movie Theater](https://github.com/believer/advent-of-code/blob/master/go/2025/puzzles/day09/main.go)       | 🌟  |    4772103936 | 🌟  |      1529675217 |
+| [Day 10: Factory](https://github.com/believer/advent-of-code/blob/master/go/2025/puzzles/day10/main.go)            | 🌟  |           455 |     |                 |
+| [Day 11: Reactor](https://github.com/believer/advent-of-code/blob/master/go/2025/puzzles/day11/main.go)            | 🌟  |           431 | 🌟  | 358458157650450 |
 
 ## Benchmarks
 
 Using Go's built-in benchmarking with the [testing](https://pkg.go.dev/testing#hdr-Benchmarks) package. Computer is a 2021 MacBook Pro M1 Pro, 32 GB RAM.
 
-| Day |       #1 |        #2 | Improvement\*        |
-| --- | -------: | --------: | -------------------- |
-| 1   |   340532 |    338234 | `52,30%` / `52,86%`  |
-| 2   | 39771972 | 778769562 | `-14,63%` / `46,44%` |
-| 3   |   209025 |    276642 | `5,57%`              |
-| 4   |   214451 |   5483916 |                      |
-| 5   |   116258 |     68155 | `96,29%` / -         |
-| 6   |   149919 |    986335 | `30,99%` / -         |
-| 7   |   671799 |    508323 |                      |
-| 8   | 66756016 |  64329155 |                      |
-| 9   |   593637 | 375621306 | - / `90,43%`         |
+| Day |        #1 |        #2 | Improvement\*        |
+| --- | --------: | --------: | -------------------- |
+| 1   |    340532 |    338234 | `52,30%` / `52,86%`  |
+| 2   |  39771972 | 778769562 | `-14,63%` / `46,44%` |
+| 3   |    209025 |    276642 | `5,57%`              |
+| 4   |    214451 |   5483916 |                      |
+| 5   |    116258 |     68155 | `96,29%` / -         |
+| 6   |    149919 |    986335 | `30,99%` / -         |
+| 7   |    671799 |    508323 |                      |
+| 8   |  66756016 |  64329155 |                      |
+| 9   |    593637 | 375621306 | - / `90,43%`         |
+| 10  | 256756802 |         - |                      |
+| 11  |    106015 |    311170 |                      |
 
 All values are ns/op. \* compared to first solution.
 

go/2025/puzzles/day11/main.go

@@ -0,0 +1,90 @@
+package main
+
+import (
+	"fmt"
+	"strings"
+
+	"github.com/believer/aoc-utils/files"
+)
+
+// Pretty simple DP solution. Nice breather after yesterday.
+// The thing I didn't know was how to create a good cache
+// representation for multiple values and recursion. So, I
+// (actually) asked Gemini about how to solve that part.
+
+func main() {
+	fmt.Println("Part 1: ", part1("input.txt"))
+	fmt.Println("Part 2: ", part2("input.txt"))
+}
+
+func part1(name string) int {
+	paths := createPaths(name)
+
+	// DAC and FFT are not needed in part 1, set to true
+	return countPaths(paths, "you", true, true)
+}
+
+func part2(name string) int {
+	paths := createPaths(name)
+
+	return countPaths(paths, "svr", false, false)
+}
+
+type cacheKey struct {
+	from string
+	dac  bool
+	fft  bool
+}
+
+func countPaths(paths map[string][]string, start string, dac, fft bool) int {
+	cache := make(map[cacheKey]int)
+
+	var solve func(from string, dac, fft bool) int
+
+	solve = func(from string, dac, fft bool) int {
+		key := cacheKey{from, dac, fft}
+
+		if result, ok := cache[key]; ok {
+			return result
+		}
+
+		switch from {
+		case "out":
+			// Has visited both DAC and FFT
+			if dac && fft {
+				return 1
+			}
+			return 0
+		case "dac":
+			dac = true
+		case "fft":
+			fft = true
+		}
+
+		sum := 0
+
+		for _, to := range paths[from] {
+			sum += solve(to, dac, fft)
+		}
+
+		cache[key] = sum
+
+		return sum
+	}
+
+	return solve(start, dac, fft)
+}
+
+// Create a map of all devices and their outputs
+func createPaths(name string) map[string][]string {
+	lines := files.ReadLines(name)
+	paths := map[string][]string{}
+
+	for _, l := range lines {
+		device, outputs, _ := strings.Cut(l, ": ")
+
+		paths[device] = strings.Fields(outputs)
+	}
+
+	return paths
+}

go/2025/puzzles/day11/main_test.go

@@ -0,0 +1,35 @@
+package main
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+func TestPart1(t *testing.T) {
+	t.Run("Part 1", func(t *testing.T) {
+		expected := 5
+		actual := part1("test-input.txt")
+		assert.Equal(t, expected, actual)
+	})
+}
+
+func TestPart2(t *testing.T) {
+	t.Run("Part 2", func(t *testing.T) {
+		expected := 2
+		actual := part2("test-input-part2.txt")
+		assert.Equal(t, expected, actual)
+	})
+}
+
+func BenchmarkPart1(b *testing.B) {
+	for b.Loop() {
+		part1("input.txt")
+	}
+}
+
+func BenchmarkPart2(b *testing.B) {
+	for b.Loop() {
+		part2("input.txt")
+	}
+}

go/2025/puzzles/day11/test-input-part2.txt

@@ -0,0 +1,13 @@
+svr: aaa bbb
+aaa: fft
+fft: ccc
+bbb: tty
+tty: ccc
+ccc: ddd eee
+ddd: hub
+hub: fff
+eee: dac
+dac: fff
+fff: ggg hhh
+ggg: out
+hhh: out

go/2025/puzzles/day11/test-input.txt

@@ -0,0 +1,10 @@
+aaa: you hhh
+you: bbb ccc
+bbb: ddd eee
+ccc: ddd eee fff
+ddd: ggg
+eee: out
+fff: out
+ggg: out
+hhh: ccc fff iii
+iii: out