advent_of_ruby 0.2.0 → 0.3.0

data/data/solutions/github/ZogStriP/2023/23_2.yml

@@ -0,0 +1,65 @@
+---
+- :name: 23_a_long_walk.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: |-
+    map = DATA.map &:chomp
+    X = map[0].size
+    map *= ""
+    S, G = map.index(?.), map.rindex(?.)
+    N = [-1, 1, -X, X]
+
+    neighbors = -> l {
+      n = []
+      n << l - X if map[l - X] != ?# && (map[l] == ?. || map[l] == ?<)
+      n << l - 1 if map[l - 1] != ?# && (map[l] == ?. || map[l] == ?^)
+      n << l + 1 if map[l + 1] != ?# && (map[l] == ?. || map[l] == ?>)
+      n << l + X if map[l + X] != ?# && (map[l] == ?. || map[l] == ?v)
+      n
+    }
+
+    best = 0
+    dfs_1 = -> current, visited = [], distance = 0 {
+      best = [best, distance].max if current == G
+      neighbors[current].each { |n|
+        next if visited[n]
+        visited[n] = true
+        dfs_1[n, visited, distance + 1]
+        visited[n] = false
+      }
+    }
+
+    dfs_1[S]
+    p best
+
+    distances = Hash.new { _1[_2] = [] }
+    intersections = [S] | (S..G).filter_map { !map[_1][?#] && neighbors[_1].size > 2 && _1 } | [G]
+
+    intersections.each { |l|
+      q = [l]
+      s = [l].to_set
+      d = 0
+      while q.any?
+        d += 1
+        qq = []
+        q.each { |c|
+          N.each {
+            n = c + _1
+            map[n] && map[n] != ?# && s.add?(n) && (intersections.include?(n) ? distances[l] << [d, n] : qq << n)
+          }
+        }
+        q = qq
+      end
+    }
+
+    dfs_2 = -> current, visited = [], distance = 0 {
+      best = [best, distance].max if current == G
+      distances[current].each { |d, n|
+        next if visited[n]
+        visited[n] = true
+        dfs_2[n, visited, distance + d]
+        visited[n] = false
+      }
+    }
+
+    dfs_2[S]
+    p best

data/data/solutions/github/ZogStriP/2023/24_1.yml

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

data/data/solutions/github/ZogStriP/2023/24_2.yml

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

data/data/solutions/github/ZogStriP/2023/25_1.yml

@@ -0,0 +1,26 @@
+---
+- :name: 25_snowverload.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: |-
+    G = Hash.new { _1[_2] = [] }
+
+    DATA.each { |l|
+      l, *rs = l.scan(/\w+/)
+      rs.each { |r|
+        G[l] << r
+        G[r] << l
+      }
+    }
+
+    start = G.keys.sample
+
+    left = { start => true }
+    bridges = G[start].to_h { [[start, _1], true] }
+
+    while bridges.size > 3
+      add = bridges.keys.map(&:last).uniq.min_by { |u| G[u].sum { |v| left[v] ? -1 : 1 } }
+      left[add] = true
+      G[add].each { |v| left[v] ? bridges.delete([v, add]) : bridges[[add, v]] = true }
+    end
+
+    p left.size * (G.size - left.size)

data/data/solutions/github/ahorner/2015/01_1.yml

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

data/data/solutions/github/ahorner/2015/01_2.yml

@@ -0,0 +1,19 @@
+---
+- :name: 01.rb
+  :url: https://github.com/ahorner/advent-of-code/blob/main/lib/2015
+  :solution: |-
+    STEPS = INPUT.chars
+
+    final_floor = STEPS.count("(") - STEPS.count(")")
+    solve!("Final floor:", final_floor)
+
+    def first_step(target)
+      floor = 0
+
+      STEPS.each_with_index do |step, index|
+        floor += ((step == "(") ? 1 : -1)
+        break index + 1 if floor == target
+      end
+    end
+
+    solve!("First basement step:", first_step(-1))

data/data/solutions/github/ahorner/2015/02_1.yml

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

data/data/solutions/github/ahorner/2015/02_2.yml

@@ -0,0 +1,33 @@
+---
+- :name: 02.rb
+  :url: https://github.com/ahorner/advent-of-code/blob/main/lib/2015
+  :solution: |-
+    def boxes
+      INPUT.split("\n").map do |line|
+        line.split("x").map(&:to_i)
+      end
+    end
+
+    def area(w, h, l)
+      (2 * w * h) + (2 * w * l) + (2 * h * l) + [w * h, w * l, h * l].min
+    end
+
+    def total_area
+      boxes.sum { |edges| area(*edges) }
+    end
+
+    solve!("Total sqft of wrapping paper:", total_area)
+
+    def length(w, h, l)
+      smallest = [w, h, l].sort.take(2)
+      wrapping = smallest.sum { |edge| edge * 2 }
+      bow = w * h * l
+
+      wrapping + bow
+    end
+
+    def total_length
+      boxes.sum { |edges| length(*edges) }
+    end
+
+    solve!("Total ft of ribbon:", total_length)

data/data/solutions/github/ahorner/2015/03_1.yml

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

data/data/solutions/github/ahorner/2015/03_2.yml

@@ -0,0 +1,65 @@
+---
+- :name: 03.rb
+  :url: https://github.com/ahorner/advent-of-code/blob/main/lib/2015
+  :solution: |-
+    class Sled
+      def initialize(map)
+        @map = map
+        @x = 0
+        @y = 0
+
+        drop_gift
+      end
+
+      def move(instruction)
+        case instruction
+        when ">" then @x += 1
+        when "<" then @x -= 1
+        when "^" then @y += 1
+        when "v" then @y -= 1
+        end
+
+        drop_gift
+      end
+
+      def drop_gift
+        @map[[@x, @y]] += 1
+      end
+    end
+
+    def instructions
+      INPUT.chars
+    end
+
+    def base_map
+      Hash.new(0)
+    end
+
+    def flyover
+      map = base_map
+
+      santa = Sled.new(map)
+      instructions.each { |step| santa.move(step) }
+
+      map
+    end
+
+    solve!("Happy houses after flyover:", flyover.count)
+
+    def robo_flyover
+      map = base_map
+
+      santa = Sled.new(map)
+      robo_santa = Sled.new(map)
+
+      robo = false
+
+      instructions.each do |step|
+        robo ? robo_santa.move(step) : santa.move(step)
+        robo = !robo
+      end
+
+      map
+    end
+
+    solve!("Happy houses after tandem robo-flyover:", robo_flyover.count)

data/data/solutions/github/ahorner/2015/04_1.yml

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

data/data/solutions/github/ahorner/2015/04_2.yml

@@ -0,0 +1,21 @@
+---
+- :name: 04.rb
+  :url: https://github.com/ahorner/advent-of-code/blob/main/lib/2015
+  :solution: |-
+    require "digest"
+
+    def matching_digest(pattern)
+      value = 0
+      digest = nil
+
+      loop do
+        value += 1
+        digest = Digest::MD5.new.hexdigest "#{INPUT}#{value}"
+        break if digest.start_with?(pattern)
+      end
+
+      [digest, value]
+    end
+
+    solve!(*matching_digest("00000"))
+    solve!(*matching_digest("000000"))

data/data/solutions/github/ahorner/2015/05_1.yml

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

data/data/solutions/github/ahorner/2015/05_2.yml

@@ -0,0 +1,26 @@
+---
+- :name: 05.rb
+  :url: https://github.com/ahorner/advent-of-code/blob/main/lib/2015
+  :solution: |-
+    LIST = INPUT.split("\n")
+
+    def nice?(line)
+      vowels = line.scan(/[aeiou]/).count >= 3
+      double_char = (line =~ /(.)\1+/)
+      bad_words = (line =~ /ab|cd|pq|xy/)
+
+      !!(vowels && double_char && !bad_words)
+    end
+
+    nice = LIST.select { |line| nice?(line) }
+    solve!("Making a list:", nice.size)
+
+    def still_nice?(line)
+      matching_pairs = (line =~ /(..).*\1/)
+      sandwich = (line =~ /(.).\1/)
+
+      !!(matching_pairs && sandwich)
+    end
+
+    nice = LIST.select { |line| still_nice?(line) }
+    solve!("Checking it twice:", nice.size)

data/data/solutions/github/ahorner/2015/06_1.yml

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

data/data/solutions/github/ahorner/2015/06_2.yml

@@ -0,0 +1,48 @@
+---
+- :name: 06.rb
+  :url: https://github.com/ahorner/advent-of-code/blob/main/lib/2015
+  :solution: |-
+    INSTRUCTION_MATCHER = /(?<step>turn off|turn on|toggle) (?<x>\d+),(?<y>\d+) through (?<x2>\d+),(?<y2>\d+)/
+    INSTRUCTIONS = INPUT.split("\n").map { |line| INSTRUCTION_MATCHER.match(line) }
+
+    def for_step(step)
+      (step[:x].to_i..step[:x2].to_i).each do |x|
+        (step[:y].to_i..step[:y2].to_i).each do |y|
+          yield step[:step], x, y
+        end
+      end
+    end
+
+    def adjust_lights(instruction, lights)
+      for_step(instruction) do |step, x, y|
+        case step
+        when "turn on" then lights[[x, y]] = true
+        when "turn off" then lights[[x, y]] = false
+        when "toggle" then lights[[x, y]] = !lights[[x, y]]
+        end
+      end
+    end
+
+    grid = Hash.new(false)
+    INSTRUCTIONS.each do |line|
+      adjust_lights(line, grid)
+    end
+
+    solve!("All of the lights:", grid.values.count(&:itself))
+
+    def adjust_brightness(instruction, lights)
+      for_step(instruction) do |step, x, y|
+        case step
+        when "turn on" then lights[[x, y]] += 1
+        when "turn off" then lights[[x, y]] = [0, lights[[x, y]] - 1].max
+        when "toggle" then lights[[x, y]] += 2
+        end
+      end
+    end
+
+    grid = Hash.new(0)
+    INSTRUCTIONS.each do |line|
+      adjust_brightness(line, grid)
+    end
+
+    solve!("Required holiday SPF:", grid.values.sum)

data/data/solutions/github/ahorner/2015/07_1.yml

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

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

@@ -0,0 +1,57 @@
+---
+- :name: 07.rb
+  :url: https://github.com/ahorner/advent-of-code/blob/main/lib/2015
+  :solution: |-
+    class Circuit
+      BOUNDARY = 65_536
+
+      def initialize(signals = {})
+        @signals = signals
+        @wires = {}
+      end
+
+      def assemble!(instructions)
+        instructions.each do |step|
+          source, wire = step.split(" -> ")
+          @wires[wire] = source.split
+        end
+      end
+
+      def reset!(signals = {})
+        @signals = signals
+      end
+
+      def signal(wire)
+        return wire.to_i if /\A\d+\z/.match?(wire)
+
+        @signals[wire] ||= begin
+          sources = @wires[wire]
+          result =
+            if sources.include?("AND")
+              signal(sources[0]) & signal(sources[2])
+            elsif sources.include?("OR")
+              signal(sources[0]) | signal(sources[2])
+            elsif sources.include?("NOT")
+              ~signal(sources[1])
+            elsif sources.include?("RSHIFT")
+              signal(sources[0]) >> signal(sources[2])
+            elsif sources.include?("LSHIFT")
+              signal(sources[0]) << signal(sources[2])
+            else
+              signal(sources[0])
+            end
+
+          result % BOUNDARY
+        end
+      end
+    end
+
+    circuit = Circuit.new
+    circuit.assemble!(INPUT.split("\n"))
+
+    WIRE ||= "a".freeze
+    a = circuit.signal(WIRE)
+    solve!("First pass:", a)
+
+    circuit.reset!("b" => a)
+    solve!("Second pass:", circuit.signal(WIRE))

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

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

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

@@ -0,0 +1,21 @@
+---
+- :name: '08.rb'
+  :url: https://github.com/ahorner/advent-of-code/blob/main/lib/2015
+  :solution: |-
+    LINES = INPUT.split("\n")
+
+    def evaluated_difference(line)
+      line.length - eval(line).length
+    end
+
+    total = LINES.map { |line| evaluated_difference(line) }.sum
+
+    solve!("The original strings are longer by:", total)
+
+    def escaped_difference(line)
+      line.inspect.length - line.length
+    end
+
+    total = LINES.map { |line| escaped_difference(line) }.sum
+
+    solve!("The escaped strings are longer by:", total)

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

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

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

@@ -0,0 +1,65 @@
+---
+- :name: '09.rb'
+  :url: https://github.com/ahorner/advent-of-code/blob/main/lib/2015
+  :solution: |-
+    require "set"
+
+    class Map
+      def initialize
+        @cities = Set.new
+        @edges = {}
+      end
+
+      def fill(lines)
+        lines.each do |line|
+          cities, distance = line.split(" = ")
+          origin, destination = cities.split(" to ")
+
+          @cities << origin
+          @cities << destination
+
+          @edges[[origin, destination].sort] = distance.to_i
+        end
+      end
+
+      def best_route
+        route(routes.values.min)
+      end
+
+      def worst_route
+        route(routes.values.max)
+      end
+
+      private
+
+      def route(distance)
+        [routes.key(distance).join(" -> "), distance]
+      end
+
+      def routes
+        @routes ||= @cities.to_a.permutation.each_with_object({}) do |route, distances|
+          origin = nil
+          destination = nil
+
+          distance = route.map do |city|
+            origin = destination
+            destination = city
+            next if origin.nil?
+
+            distance(origin, destination)
+          end.compact.sum
+
+          distances[route] = distance
+        end
+      end
+
+      def distance(origin, destination)
+        @edges[[origin, destination].sort]
+      end
+    end
+
+    map = Map.new
+    map.fill(INPUT.split("\n"))
+
+    solve!("Best route:", *map.best_route)
+    solve!("Worst route:", *map.worst_route)

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

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

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

@@ -0,0 +1,19 @@
+---
+- :name: 10.rb
+  :url: https://github.com/ahorner/advent-of-code/blob/main/lib/2015
+  :solution: |-
+    def look_and_say(string)
+      string.gsub(/(.)\1*/) { |match| "#{match.size}#{match[0]}" }
+    end
+
+    def loop_and_say(string, times)
+      times.times { string = look_and_say(string) }
+      string
+    end
+
+    TIMES ||= 40
+    result = loop_and_say(INPUT, TIMES)
+    solve!("After 40 iterations:", result.length)
+
+    result = loop_and_say(result, 10)
+    solve!("After 50 iterations:", result.length)

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

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

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

@@ -0,0 +1,48 @@
+---
+- :name: 11.rb
+  :url: https://github.com/ahorner/advent-of-code/blob/main/lib/2015
+  :solution: |-
+    class PasswordGenerator
+      def initialize(seed)
+        @current_password = seed
+      end
+
+      def next
+        password = @current_password
+
+        loop do
+          password.succ!
+          break if valid?(password)
+        end
+
+        @current_password = password
+      end
+
+      private
+
+      def valid?(password)
+        increasing_straight?(password) && two_pairs?(password) && !bad_chars?(password)
+      end
+
+      def increasing_straight?(string)
+        # Omitting the following, as they contain i, o, or l (see `bad_chars?`):
+        # ghi|hij|ijk|jkl|klm|lmn|mno|nop|opq
+        string =~ /abc|bcd|cde|def|efg|fgh|pqr|qrs|rst|stu|tuv|uvw|vwx|wxy|xyz/
+      end
+
+      def two_pairs?(string)
+        string =~ /(.)\1.*(.)\2/
+      end
+
+      def bad_chars?(string)
+        string =~ /[iol]/
+      end
+    end
+
+    generator = PasswordGenerator.new(INPUT)
+
+    next_password = generator.next
+    solve!("Next password should be:", next_password)
+
+    next_password = generator.next
+    solve!("And then it should be:", next_password)

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

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

data/data/solutions/github/ahorner/2015/12_2.yml

@@ -0,0 +1,23 @@
+---
+- :name: 12.rb
+  :url: https://github.com/ahorner/advent-of-code/blob/main/lib/2015
+  :solution: |-
+    require "json"
+
+    input = JSON.parse(INPUT)
+
+    def deep_sum(object, ignore: nil)
+      case object
+      when Array
+        object.map { |i| deep_sum(i, ignore: ignore) }.sum
+      when Hash
+        return 0 if object.value?(ignore)
+
+        deep_sum(object.values, ignore: ignore)
+      else
+        object.to_i
+      end
+    end
+
+    solve!("Total Value: ", deep_sum(input))
+    solve!("Total Adjusted Value: ", deep_sum(input, ignore: "red"))

data/data/solutions/github/ahorner/2015/13_1.yml

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

data/data/solutions/github/ahorner/2015/13_2.yml

@@ -0,0 +1,78 @@
+---
+- :name: 13.rb
+  :url: https://github.com/ahorner/advent-of-code/blob/main/lib/2015
+  :solution: |-
+    require "set"
+
+    class Party
+      # rubocop:disable Layout/LineLength
+      INTERACTION_MATCHER = /(?<person>.+) would (?<action>.+) (?<units>\d+) happiness units by sitting next to (?<neighbor>.+)\./
+      # rubocop:enable Layout/LineLength
+
+      attr_reader :people
+
+      def initialize
+        @people = Set.new
+        @relationships = Hash.new(0)
+      end
+
+      def parse(guest_list)
+        guest_list.each do |line|
+          interaction = INTERACTION_MATCHER.match(line)
+
+          @people << interaction[:person]
+          @people << interaction[:neighbor]
+
+          units = interaction[:units].to_i
+          units *= -1 if interaction[:action] == "lose"
+
+          @relationships[[interaction[:person], interaction[:neighbor]]] = units
+        end
+      end
+
+      def seating_chart
+        @people.to_a.permutation.map do |arrangement|
+          SeatingChart.new(arrangement, @relationships)
+        end.max
+      end
+    end
+
+    class SeatingChart
+      def initialize(arrangement, relationships)
+        @relationships = relationships
+        @arrangement = arrangement
+      end
+
+      def happiness
+        @happiness ||= begin
+          total = 0
+
+          @arrangement.each.with_index do |person, index|
+            total += @relationships[[person, @arrangement[(index + 1) % @arrangement.size]]]
+            total += @relationships[[person, @arrangement[index - 1]]]
+          end
+
+          total
+        end
+      end
+
+      def <=>(other)
+        happiness <=> other.happiness
+      end
+
+      def to_s
+        (@arrangement + [@arrangement.first]).join(" - ")
+      end
+    end
+
+    party = Party.new
+    party.parse(INPUT.split("\n"))
+
+    seating_chart = party.seating_chart
+
+    solve!("Best arrangement:", seating_chart.to_s, seating_chart.happiness)
+
+    party.people << "Me"
+    seating_chart = party.seating_chart
+
+    solve!("Best arrangement (with me):", seating_chart.to_s, seating_chart.happiness)

data/data/solutions/github/ahorner/2015/14_1.yml

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