advent_of_ruby 0.3.5 → 0.3.6

data/data/solutions/github/ahorner/2025/07_2.yml

@@ -0,0 +1,56 @@
+---
+- :name: 07.rb
+  :url: https://github.com/ahorner/advent-of-code/blob/main/lib/2025
+  :solution: |-
+    require "matrix"
+
+    MANIFOLD = INPUT.split("\n").each_with_index.each_with_object({}) do |(row, y), manifold|
+      row.chars.each_with_index do |char, x|
+        manifold[Vector[x, y]] = char unless char == "."
+      end
+    end
+
+    START_POSITION = MANIFOLD.invert["S"]
+    HEIGHT = INPUT.split("\n").size
+
+    def step(particles, manifold)
+      new_particles = Hash.new(0)
+      splits = 0
+
+      particles.each do |(particle, timelines)|
+        drop = (particle + Vector[0, 1])
+
+        case manifold[drop]
+        when "^"
+          splits += 1
+          new_particles[(drop + Vector[-1, 0])] += timelines
+          new_particles[(drop + Vector[1, 0])] += timelines
+        else
+          new_particles[drop] += timelines
+        end
+      end
+
+      [new_particles, splits]
+    end
+
+    def teleport(manifold)
+      total_splits = 0
+      particles = {START_POSITION => 1}
+      step = 0
+
+      loop do
+        break if step >= HEIGHT
+
+        particles, splits = step(particles, manifold)
+        total_splits += splits
+        step += 1
+      end
+
+      [particles, total_splits]
+    end
+
+    final_particles, splits = teleport(MANIFOLD)
+    solve!("The total number of splits performed is:", splits)
+
+    total_timelines = final_particles.values.sum
+    solve!("The total number of timelines after splitting is:", total_timelines)

data/data/solutions/github/ahorner/2025/08_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/ahorner/2025/08_2.yml

@@ -0,0 +1,59 @@
+---
+- :name: '08.rb'
+  :url: https://github.com/ahorner/advent-of-code/blob/main/lib/2025
+  :solution: |-
+    require "matrix"
+
+    JUNCTION_BOXES = INPUT.split("\n").map do |row|
+      Vector[*row.split(",").map(&:to_i)]
+    end
+
+    N_CLOSEST ||= 1000 # rubocop:disable Lint/OrAssignmentToConstant
+
+    def pairs(boxes)
+      boxes.combination(2).sort_by { |a, b| (a - b).magnitude }
+    end
+
+    def circuits(boxes)
+      connections = pairs(boxes).first(N_CLOSEST)
+      flattened = connections.flatten
+      boxes = connections.flatten.uniq.sort_by { |box| flattened.count(box) }
+
+      circuits = connections
+      loop do
+        break circuits if boxes.empty?
+        box = boxes.shift
+
+        connected, circuits = circuits.partition { |boxes| boxes.include?(box) }
+        circuit = Set.new(connected.flatten)
+        circuits << circuit.to_a
+      end
+    end
+
+    solve!(
+      "The product of the sizes of the three largest circuits is:",
+      circuits(JUNCTION_BOXES).map(&:size).sort.last(3).reduce(:*)
+    )
+
+    def last_connection(boxes)
+      target = boxes.size
+      connections = pairs(boxes)
+
+      used = Set.new
+      connection = nil
+
+      loop do
+        break false if connections.empty?
+        break connection if used.size == target
+
+        connection = connections.shift
+        used << connection[0]
+        used << connection[1]
+      end
+    end
+
+    final = last_connection(JUNCTION_BOXES)
+    solve!(
+      "The product of X coordinates of the last connection is:",
+      final.map(&:first).reduce(:*)
+    )

data/data/solutions/github/ahorner/2025/09_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/ahorner/2025/09_2.yml

@@ -0,0 +1,101 @@
+---
+- :name: '09.rb'
+  :url: https://github.com/ahorner/advent-of-code/blob/main/lib/2025
+  :solution: |-
+    require "matrix"
+
+    RED_TILES = INPUT.split("\n").map { |line| Vector[*line.split(",").map(&:to_i)] }
+
+    def area(v1, v2)
+      width = (v2[0] - v1[0]).abs + 1
+      height = (v2[1] - v1[1]).abs + 1
+      width * height
+    end
+
+    def optimal_corners(tiles)
+      tiles.combination(2).max_by { |v1, v2| area(v1, v2) }
+    end
+
+    largest = area(*optimal_corners(RED_TILES))
+
+    solve!("The largest rectangular area is:", largest)
+
+    LOOP = (RED_TILES + [RED_TILES[0]]).each_cons(2).to_a
+
+    def point_contained?(point, loop)
+      intersections = 0
+
+      loop.each do |v1, v2|
+        if v1[1] == v2[1]
+          x1 = (v1[0] < v2[0]) ? v1[0] : v2[0]
+          x2 = (v1[0] > v2[0]) ? v1[0] : v2[0]
+
+          return true if point[1] == v1[1] && point[0] >= x1 && point[0] <= x2
+        else
+          y1 = (v1[1] < v2[1]) ? v1[1] : v2[1]
+          y2 = (v1[1] > v2[1]) ? v1[1] : v2[1]
+
+          return true if point[0] == v1[0] && point[1] >= y1 && point[1] <= y2
+          intersections += 1 if point[0] < v1[0] && point[1] > y1 && point[1] <= y2
+        end
+      end
+
+      intersections % 2 == 1
+    end
+
+    def edge_intersects?((p1, p2), loop)
+      loop.any? do |v1, v2|
+        next false if (p1[1] == p2[1]) == (v1[1] == v2[1])
+
+        x1 = (v1[0] < v2[0]) ? v1[0] : v2[0]
+        x2 = (v1[0] > v2[0]) ? v1[0] : v2[0]
+        y1 = (v1[1] < v2[1]) ? v1[1] : v2[1]
+        y2 = (v1[1] > v2[1]) ? v1[1] : v2[1]
+
+        if p1[1] == p2[1]
+          x1 > p1[0] && x1 < p2[0] && p1[1] > y1 && p1[1] < y2
+        else
+          p1[0] > x1 && p1[0] < x2 && y1 > p1[1] && y1 < p2[1]
+        end
+      end
+    end
+
+    def optimal_contained(tiles, loop)
+      tiles.combination(2).sort_by { |v1, v2| -area(v1, v2) }.detect do |v1, v2|
+        minx = (v1[0] < v2[0]) ? v1[0] : v2[0]
+        maxx = (v1[0] > v2[0]) ? v1[0] : v2[0]
+        miny = (v1[1] < v2[1]) ? v1[1] : v2[1]
+        maxy = (v1[1] > v2[1]) ? v1[1] : v2[1]
+
+        corners = [
+          Vector[minx, miny],
+          Vector[maxx, miny],
+          Vector[maxx, maxy],
+          Vector[minx, maxy]
+        ]
+        unless corners.all? { |corner| point_contained?(corner, loop) }
+          # puts v1, v2, "rejected bc corner"
+          next false
+        end
+
+        edges = [
+          [corners[0], corners[1]],
+          [corners[1], corners[2]],
+          [corners[3], corners[2]],
+          [corners[0], corners[3]]
+        ]
+        if edges.any? { |edge| edge_intersects?(edge, loop) }
+          # puts v1, v2, "rejected bc edge"
+          next false
+        end
+
+        true
+      end
+    end
+
+    optimal = optimal_contained(RED_TILES, LOOP)
+
+    solve!(
+      "The largest fully-contained rectangular area is:",
+      area(*optimal)
+    )

data/data/solutions/github/ahorner/2025/10_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/ahorner/2025/10_2.yml

@@ -0,0 +1,72 @@
+---
+- :name: 10.rb
+  :url: https://github.com/ahorner/advent-of-code/blob/main/lib/2025
+  :solution: |-
+    require "z3"
+
+    LIGHT_SEQUENCE_MATCHER = /\[(.*?)\]/
+    BUTTON_PATTERN_MATCHER = /\((.*?)\)/
+    JOLTAGE_PATTERN_MATCHER = /\{(.*?)\}/
+
+    Machine = Data.define(:goal, :buttons, :joltages)
+
+    MACHINES = INPUT.split("\n").map do |line|
+      goal = line.match(LIGHT_SEQUENCE_MATCHER)[1].chars.map { |c| (c == "#") ? 1 : 0 }
+      buttons = line.scan(BUTTON_PATTERN_MATCHER).map { |bp| bp[0].split(",").map(&:to_i) }
+      joltages = line.match(JOLTAGE_PATTERN_MATCHER)[1].split(",").map(&:to_i)
+
+      Machine.new(goal:, buttons:, joltages:)
+    end
+
+    def min_sequence_presses(machine)
+      goal = machine.goal
+      buttons = machine.buttons
+
+      combinations = (1..buttons.size).flat_map { |n| buttons.combination(n).to_a }
+      working = combinations.select do |combo|
+        pressed = Array.new(goal.size, 0)
+        combo.each { |button| button.each { |pos| pressed[pos] ^= 1 } }
+
+        pressed == goal
+      end
+
+      working.map(&:size).min
+    end
+
+    solve!(
+      "The minimal number of button presses is:",
+      MACHINES.sum { |machine| min_sequence_presses(machine) }
+    )
+
+    def min_joltage_presses(machine)
+      optimizer = Z3::Optimize.new
+
+      buttons = machine.buttons.each_with_index.map do |button, i|
+        count = Z3::Int("b#{i}")
+        optimizer.assert(count >= 0)
+
+        count
+      end
+
+      machine.joltages.each_with_index do |joltage, i|
+        values = buttons.each_with_index.map do |count, j|
+          button_value = Z3::Int("v#{j}_#{i}")
+          value = machine.buttons[j].include?(i) ? 1 : 0
+
+          optimizer.assert(button_value == (count * value))
+          button_value
+        end
+
+        optimizer.assert(joltage == values.sum)
+      end
+
+      presses = Z3::Int("presses")
+      optimizer.assert(presses == buttons.sum)
+      optimizer.minimize(presses)
+      optimizer.model[presses].to_i if optimizer.satisfiable?
+    end
+
+    solve!(
+      "The minimal number of presses to reach all target joltages is:",
+      MACHINES.sum { |machine| min_joltage_presses(machine) }
+    )

data/data/solutions/github/ahorner/2025/11_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/ahorner/2025/11_2.yml

@@ -0,0 +1,45 @@
+---
+- :name: 11.rb
+  :url: https://github.com/ahorner/advent-of-code/blob/main/lib/2025
+  :solution: |-
+    MAP = INPUT.split("\n").each_with_object({}) do |line, map|
+      loc, neighbors = line.split(": ")
+      map[loc] = neighbors.split(" ")
+    end
+
+    def paths(map, current, goal, known = Hash.new { |h, k| h[k] = 0 })
+      return 1 if current == goal
+      return known[current] if known.key?(current)
+      return 0 if !map[current]
+
+      map[current].each do |neighbor|
+        known[current] += paths(map, neighbor, goal, known)
+      end
+
+      known[current]
+    end
+
+    solve!(
+      "The total number of paths from `you` to `out` is:",
+      paths(MAP, "you", "out")
+    )
+
+    # Given the nature of the problem, we know that there are no loops possible,
+    # so data can only visit `fft` and `dac` in one specific order. We check to see
+    # which direction data flows, and break the path into segments based on that.
+    fft_paths = paths(MAP, "fft", "dac")
+    dac_paths = paths(MAP, "dac", "fft")
+
+    path_segments = [
+      (paths(MAP, "svr", "fft") if fft_paths > 0),
+      (paths(MAP, "svr", "dac") if dac_paths > 0),
+      (fft_paths if fft_paths > 0),
+      (dac_paths if dac_paths > 0),
+      (paths(MAP, "dac", "out") if fft_paths > 0),
+      (paths(MAP, "fft", "out") if dac_paths > 0)
+    ].compact
+
+    solve!(
+      "The total number of output paths from the server through `fft` and `dac` is:",
+      path_segments.reduce(1, :*)
+    )

data/data/solutions/github/ahorner/2025/12_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/eregon/2025/01_1.yml

@@ -0,0 +1,17 @@
+---
+- :name: 1a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2025
+  :solution: |-
+    dial = 50
+    p $<.map {
+      dial = (dial + it.tr('LR', '-+').to_i) % 100
+    }.count(0)
+- :name: 1a_golf.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2025
+  :solution: d=50;p$<.map{(d+=it.tr('LR','-+').to_i)%100}.count 0
+- :name: 1a_golf2.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2025
+  :solution: |-
+    d=50;n=0
+    $<.map{eval"d#{it.sub(?L,'-=').sub(?R,'+=')};n+=1 if d%100==0"}
+    p n

data/data/solutions/github/eregon/2025/01_2.yml

@@ -0,0 +1,14 @@
+---
+- :name: 1b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2025
+  :solution: |-
+    zeros = 0
+    dial = 50
+    $<.each {
+      step = it[0] == 'L' ? -1 : +1
+      it[1..].to_i.times {
+        dial = (dial + step) % 100
+        zeros += 1 if dial == 0
+      }
+    }
+    p zeros

data/data/solutions/github/eregon/2025/02_1.yml

@@ -0,0 +1,22 @@
+---
+- :name: 2a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2025
+  :solution: "ranges = $<.read.strip.split(\",\").map {\n  a, b = it.split('-')\n  a = '1' + '0' * a.size if a.size.odd?  \n  b = '9' * (b.size - 1) if b.size.odd?\n  next if a.to_i > b.to_i\n  raise unless a.size == b.size && a.size.even?\n  [a, b, a.to_i..b.to_i]\n}.compact\n\nsilly = []\nranges.each { |a, b, range|\n  s = a.size\n  (a[0...s/2]..b[0...s/2]).each { |half|\n    n = (half * 2).to_i\n    silly << n if range.cover? n\n  }\n}\np silly.sum"
+- :name: 2a_golf.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2025
+  :solution: |-
+    r=[]
+    $<.read.chomp.split(?,).map{
+      a,b=it.split ?-
+      a=?1+?0*a.size if a.size.odd?
+      b=?9*(b.size-1)if b.size.odd?
+      s=a.size
+      (a[0,s/2]..b[0,s/2]).each{
+        n=(it*2).to_i
+        r<<n if a.to_i<=n&&n<=b.to_i
+      }
+    }
+    p r.sum
+- :name: 2a_golf2.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2025
+  :solution: p$<.read.chomp.split(?,).sum{a,b=it.split ?-;(a[..s=a.size/-2-1].to_i..b[..s].to_i).sum{a.to_i<=(n="#{it}#{it}".to_i)&&n<=b.to_i ? n:0}}

data/data/solutions/github/eregon/2025/02_2.yml

@@ -0,0 +1,58 @@
+---
+- :name: 2b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2025
+  :solution: |-
+    ranges = $<.read.strip.split(",").flat_map {
+      a, b = it.split('-')
+      raise if a.to_i > b.to_i
+
+      if a.size == b.size
+        a..b
+      else
+        raise unless a.size + 1 == b.size
+        [
+          a..('9' * a.size),
+          ('1' + '0' * a.size)..b
+        ]
+      end
+    }
+
+    silly = Set.new
+    ranges.each { |range|
+      a, b = range.begin, range.end
+      s = a.size
+
+      (1..s/2).each { |stride|
+        if s % stride == 0
+          repeats = s / stride
+          (a[0...stride]..b[0...stride]).each { |part|
+            n = part * repeats
+            silly << n.to_i if range.cover? n
+          }
+        end
+      }
+    }
+
+    p silly.sum
+- :name: 2b_golf.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2025
+  :solution: |-
+    r=Set[]
+    $<.read.strip.split(?,).flat_map{
+    a,b=it.split(?-)
+    (s=a.size)==b.size ? [[a,b]]:[[a,?9*s],[?1+?0*s,b]]
+    }.each{|a,b|
+      s=a.size
+      (1..s/2).each{|z|
+        if s%z==0
+          (a[0,z]..b[0,z]).each{
+            n=it*(s/z)
+            r << n.to_i if (a..b).cover? n
+          }
+        end
+      }
+    }
+    p r.sum
+- :name: 2b_golf2.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2025
+  :solution: "$<.read.split(/\\D/).each_slice(2){|a,b,d=(c=b).size|s=a.size;b=?9*s if s<d;(1..s/2).map{|z|(a[0,z]..b[0,z]).map{n=it*(s/z);$*<<n.to_i if(a..b).cover? n}if s%z==0};a,b=?1+?0*s,c;redo if s<d};p$*.uniq.sum"

data/data/solutions/github/eregon/2025/03_1.yml

@@ -0,0 +1,13 @@
+---
+- :name: 3a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2025
+  :solution: |-
+    p $<.sum {
+      d = it.chomp.chars
+      a = d[..-2].max
+      b = d[d.index(a)+1..].max
+      (a+b).to_i
+    }
+- :name: 3a_golf.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2025
+  :solution: p$<.sum{(a=(d=it.to_i.digits)[1..].max)*10+d[...d.rindex(a)].max}

data/data/solutions/github/eregon/2025/03_2.yml

@@ -0,0 +1,13 @@
+---
+- :name: 3b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2025
+  :solution: |-
+    p $<.sum {
+      d = it.chomp.chars.map(&:to_i)
+      i = 0
+      12.times.map { |nth|
+        max = d[i..-(12 - nth)].max
+        i += d[i..].index(max) + 1
+        max
+      }.join.to_i
+    }

data/data/solutions/github/eregon/2025/04_1.yml

@@ -0,0 +1,14 @@
+---
+- :name: 4a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2025
+  :solution: |-
+    set = Set[]
+    $<.each_with_index {|row,y|
+      row.chomp.chars.each_with_index{|v,x|
+        set << y.i+x if v == '@'
+      }
+    }
+
+    p set.count { |c|
+      (set & Set[c-1i-1, c-1i, c-1i+1, c-1, c+1, c+1i-1, c+1i, c+1i+1]).size < 4
+    }

data/data/solutions/github/eregon/2025/04_2.yml

@@ -0,0 +1,16 @@
+---
+- :name: 4b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2025
+  :solution: |-
+    set = Set[]
+    $<.each_with_index {|row,y|
+      row.chomp.chars.each_with_index{|v,x|
+        set << y.i+x if v == '@'
+      }
+    }
+    init = set.dup
+
+    true while set.reject! { |c|
+      (set & Set[c-1i-1, c-1i, c-1i+1, c-1, c+1, c+1i-1, c+1i, c+1i+1]).size < 4
+    }
+    p (init-set).size

data/data/solutions/github/eregon/2025/05_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/eregon/2025/05_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/eregon/2025/06_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/eregon/2025/06_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/eregon/2025/07_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/eregon/2025/07_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/eregon/2025/08_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/eregon/2025/08_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/eregon/2025/09_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/eregon/2025/09_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/eregon/2025/10_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/eregon/2025/10_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/eregon/2025/11_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/eregon/2025/11_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/eregon/2025/12_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/01_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/01_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/02_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/02_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/03_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/03_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/04_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/04_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/05_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/05_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/06_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/06_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/07_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/07_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/08_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/08_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/09_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/09_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/10_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/10_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/11_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/11_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/12_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/erikw/2025/12_2.yml

@@ -0,0 +1 @@
+--- []