advent_of_ruby 0.2.0 → 0.3.0

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

@@ -0,0 +1,30 @@
+---
+- :name: 10b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    instructions = File.readlines('10.txt', chomp: true)
+    x = 1
+    crt = 0
+    cycle = 1
+    screen = Array.new(240, false)
+
+    clock = -> {
+      screen[crt] = true if (x - (crt % 40)).abs <= 1
+      cycle += 1
+      crt += 1
+    }
+
+    instructions.each { |instruction|
+      case instruction
+      in /^noop$/
+        clock.()
+      in /^addx (-?\d+)$/
+        clock.()
+        clock.()
+        x += Integer($1)
+      end
+    }
+
+    puts screen.each_slice(40).map { |row| row.map { _1 ? '#' : '.' }.join }

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

@@ -0,0 +1,38 @@
+---
+- :name: 11a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    Monkey = Struct.new(:items, :operation, :next, :inspected, keyword_init: true)
+
+    monkeys = File.read('11.txt').split("\n\n").map { |data|
+      div = data[/Test: divisible by (\d+)$/, 1]
+      Monkey.new(
+        items: data[/Starting items: (.+)$/, 1].split(', ').map(&Int),
+        operation: eval("-> old { #{data[/Operation: new = (.+)$/, 1]} }"),
+        next: eval(<<~RUBY),
+          -> n {
+            if n % #{data[/Test: divisible by (\d+)$/, 1]} == 0
+              #{data[/If true: throw to monkey (\d+)$/, 1]}
+            else
+              #{data[/If false: throw to monkey (\d+)$/, 1]}
+            end
+          }
+        RUBY
+        inspected: 0)
+    }
+
+    (1..20).each { |round|
+      monkeys.each { |monkey|
+        while item = monkey.items.shift
+          item = monkey.operation.call(item)
+          monkey.inspected += 1
+          item /= 3
+          throw_to = monkey.next.call(item)
+          monkeys[throw_to].items << item
+        end
+      }
+    }
+
+    p monkeys.map(&:inspected).max(2).reduce(:*)

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

@@ -0,0 +1,40 @@
+---
+- :name: 11b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    Monkey = Struct.new(:items, :operation, :divisor, :next, :inspected, keyword_init: true)
+
+    monkeys = File.read('11.txt').split("\n\n").map { |data|
+      div = data[/Test: divisible by (\d+)$/, 1]
+      Monkey.new(
+        items: data[/Starting items: (.+)$/, 1].split(', ').map(&Int),
+        operation: eval("-> old { #{data[/Operation: new = (.+)$/, 1]} }"),
+        divisor: Integer(data[/Test: divisible by (\d+)$/, 1]),
+        next: eval(<<~RUBY),
+          -> n {
+            if n % #{data[/Test: divisible by (\d+)$/, 1]} == 0
+              #{data[/If true: throw to monkey (\d+)$/, 1]}
+            else
+              #{data[/If false: throw to monkey (\d+)$/, 1]}
+            end
+          }
+        RUBY
+        inspected: 0)
+    }
+
+    MODULO = monkeys.map(&:divisor).reduce(:*)
+
+    (1..10000).each { |round|
+      monkeys.each { |monkey|
+        while item = monkey.items.shift
+          item = monkey.operation.call(item) % MODULO
+          monkey.inspected += 1
+          throw_to = monkey.next.call(item)
+          monkeys[throw_to].items << item
+        end
+      }
+    }
+
+    p monkeys.map(&:inspected).max(2).reduce(:*)

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

@@ -0,0 +1,51 @@
+---
+- :name: 12a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    coords = {}
+    start = 0i
+    finish = 0i
+
+    File.readlines('12.txt', chomp: true).each_with_index { |row, y|
+      row.chars.each_with_index { |height, x|
+        if height == 'S'
+          start = x + y.i
+          height = 'a'
+        elsif height == 'E'
+          finish = x + y.i
+          height = 'z'
+        end
+        height = height.ord - 'a'.ord + 1
+        coords[x + y.i] = height
+      }
+    }
+
+    neighbors = -> coord {
+      current = coords[coord]
+      [coord - 1i, coord + 1, coord + 1i, coord - 1].select { |c|
+        h = coords[c] and h <= current + 1
+      }
+    }
+
+    def bfs(result, neighbors, stop)
+      q = result.keys
+      while c = q.shift
+        neighbors[c].each { |neighbor|
+          unless result.include? neighbor
+            v = yield(c, neighbor)
+            result[neighbor] = v
+            return if stop[neighbor]
+            q << neighbor
+          end
+        }
+      end
+    end
+
+    result = { start => 0 }
+    bfs(result, neighbors, finish.method(:==)) { |prev, c|
+      result[prev] + 1
+    }
+
+    p result[finish]

data/data/solutions/github/eregon/2022/12_2.yml

@@ -0,0 +1,53 @@
+---
+- :name: 12b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    coords = {}
+    start = 0i
+    goals = []
+
+    File.readlines('12.txt', chomp: true).each_with_index { |row, y|
+      row.chars.each_with_index { |height, x|
+        if height == 'S'
+          height = 'a'
+        elsif height == 'E'
+          start = x + y.i
+          height = 'z'
+        end
+        if height == 'a'
+          goals << x + y.i
+        end
+        height = height.ord - 'a'.ord + 1
+        coords[x + y.i] = height
+      }
+    }
+
+    neighbors = -> coord {
+      current = coords[coord]
+      [coord - 1i, coord + 1, coord + 1i, coord - 1].select { |c|
+        h = coords[c] and h >= current - 1
+      }
+    }
+
+    def bfs(result, neighbors, stop)
+      q = result.keys
+      while c = q.shift
+        neighbors[c].each { |neighbor|
+          unless result.include? neighbor
+            v = yield(c, neighbor)
+            result[neighbor] = v
+            return if stop[neighbor]
+            q << neighbor
+          end
+        }
+      end
+    end
+
+    result = { start => 0 }
+    bfs(result, neighbors, goals.method(:include?)) { |prev, c|
+      result[prev] + 1
+    }
+
+    p goals.map { result[_1] }.compact.min

data/data/solutions/github/eregon/2022/13_1.yml

@@ -0,0 +1,38 @@
+---
+- :name: 13a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    pairs = File.read('13.txt').split("\n\n").map { |pair| pair.lines.map { eval _1 } }
+
+    def compare(a, b)
+      case [a, b]
+      in [Integer, Integer]
+        return true if a < b
+        return false if a > b
+        nil
+      in [Array, Array]
+        a += [nil] * (b.size - a.size) if a.size < b.size
+        a.zip(b) { |c,d|
+          case [c, d]
+          in [nil, _]
+            return true
+          in [_, nil]
+            return false
+          else
+            v = compare(c, d)
+            return v unless v.nil?
+          end
+        }
+        nil
+      in [Integer, Array]
+        compare([a], b)
+      in [Array, Integer]
+        compare(a, [b])
+      end
+    end
+
+    p pairs.each.with_index(1).sum { |(a,b), i|
+      (i if compare(a, b)).to_i
+    }

data/data/solutions/github/eregon/2022/13_2.yml

@@ -0,0 +1,46 @@
+---
+- :name: 13b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    packets = File.read('13.txt').split("\n\n").flat_map { |pair| pair.lines.map { eval _1 } }
+    extra = [[[2]], [[6]]]
+    packets += extra
+
+    def compare(a, b)
+      case [a, b]
+      in [Integer, Integer]
+        return true if a < b
+        return false if a > b
+        nil
+      in [Array, Array]
+        a += [nil] * (b.size - a.size) if a.size < b.size
+        a.zip(b) { |c,d|
+          case [c, d]
+          in [nil, _]
+            return true
+          in [_, nil]
+            return false
+          else
+            v = compare(c, d)
+            return v unless v.nil?
+          end
+        }
+        nil
+      in [Integer, Array]
+        compare([a], b)
+      in [Array, Integer]
+        compare(a, [b])
+      end
+    end
+
+    packets.sort! { |a, b|
+      case compare(a, b)
+      in true then -1
+      in false then 1
+      in nil then 0
+      end
+    }
+
+    p extra.map { packets.index(_1) + 1 }.reduce(:*)

data/data/solutions/github/eregon/2022/14_1.yml

@@ -0,0 +1,63 @@
+---
+- :name: 14a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    map = {}
+    source = 500 + 0i
+    map[source] = '+'
+
+    File.readlines('14.txt', chomp: true).each { |line|
+      line.split(' -> ').each_cons(2) { |a,b|
+        a = a.split(',').map(&Int).then { _1 + _2.i }
+        b = b.split(',').map(&Int).then { _1 + _2.i }
+        dir = (b - a) / (b - a).abs
+        pos = a
+        until pos == b + dir
+          map[pos] = '#'
+          pos += dir
+        end
+      }
+    }
+
+    x_range = Range.new(*map.keys.map(&:real).minmax)
+    y_range = Range.new(*map.keys.map(&:imag).minmax)
+    max_y = y_range.end
+
+    show = -> {
+      puts
+      y_range.each { |y|
+        puts x_range.map { |x|
+          map[x + y.i] || '.'
+        }.join
+      }
+    }
+    show[]
+
+    simulate = -> {
+      sand = source
+
+      while true
+        return false if sand.imag >= max_y
+
+        below = sand + 1i
+        if map[below].nil?
+          sand = below
+        elsif map[below - 1].nil?
+          sand = below - 1
+        elsif map[below + 1].nil?
+          sand = below + 1
+        else
+          map[sand] = 'o'
+          break true
+        end
+      end
+    }
+
+    while simulate[]
+      # show[]
+    end
+    show[]
+
+    p map.values.count('o')

data/data/solutions/github/eregon/2022/14_2.yml

@@ -0,0 +1,75 @@
+---
+- :name: 14b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    map = {}
+    source = 500 + 0i
+    map[source] = '+'
+
+    File.readlines('14.txt', chomp: true).each { |line|
+      line.split(' -> ').each_cons(2) { |a,b|
+        a = a.split(',').map(&Int).then { _1 + _2.i }
+        b = b.split(',').map(&Int).then { _1 + _2.i }
+        dir = (b - a) / (b - a).abs
+        pos = a
+        until pos == b + dir
+          map[pos] = '#'
+          pos += dir
+        end
+      }
+    }
+
+
+    x_range = Range.new(*map.keys.map(&:real).minmax)
+    y_range = Range.new(*map.keys.map(&:imag).minmax)
+    max_y = y_range.end
+
+    height = (y_range.end - y_range.begin) + 2
+
+    ((source.real - height)..(source.real + height)).each { |x|
+      map[x + (max_y + 2).i] = '#'
+    }
+
+    x_range = Range.new(*map.keys.map(&:real).minmax)
+    y_range = Range.new(*map.keys.map(&:imag).minmax)
+    max_y = y_range.end
+
+    show = -> {
+      puts
+      y_range.each { |y|
+        puts x_range.map { |x|
+          map[x + y.i] || '.'
+        }.join
+      }
+    }
+    show[]
+
+    simulate = -> {
+      sand = source
+
+      while true
+        raise if sand.imag >= max_y
+
+        below = sand + 1i
+        if map[below].nil?
+          sand = below
+        elsif map[below - 1].nil?
+          sand = below - 1
+        elsif map[below + 1].nil?
+          sand = below + 1
+        else
+          map[sand] = 'o'
+          return false if sand == source
+          break true
+        end
+      end
+    }
+
+    while simulate[]
+      # show[]
+    end
+    show[]
+
+    p map.values.count('o')

data/data/solutions/github/eregon/2022/15_1.yml

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

data/data/solutions/github/eregon/2022/15_2.yml

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

data/data/solutions/github/eregon/2022/16_1.yml

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

data/data/solutions/github/eregon/2022/16_2.yml

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

data/data/solutions/github/eregon/2022/17_1.yml

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

data/data/solutions/github/eregon/2022/17_2.yml

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

data/data/solutions/github/eregon/2022/18_1.yml

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

data/data/solutions/github/eregon/2022/18_2.yml

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

data/data/solutions/github/eregon/2022/19_1.yml

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

data/data/solutions/github/eregon/2022/19_2.yml

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

data/data/solutions/github/eregon/2022/20_1.yml

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

data/data/solutions/github/eregon/2022/20_2.yml

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

data/data/solutions/github/eregon/2022/21_1.yml

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

data/data/solutions/github/eregon/2022/21_2.yml

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

data/data/solutions/github/eregon/2022/22_1.yml

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

data/data/solutions/github/eregon/2022/22_2.yml

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

data/data/solutions/github/eregon/2022/23_1.yml

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

data/data/solutions/github/eregon/2022/23_2.yml

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

data/data/solutions/github/eregon/2022/24_1.yml

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

data/data/solutions/github/eregon/2022/24_2.yml

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

data/data/solutions/github/eregon/2022/25_1.yml

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

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

@@ -0,0 +1,7 @@
+---
+- :name: 1a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: p File.readlines('1.txt').sum { /(\d)(?:.*(\d))?/ =~ _1 and ($1 + ($2 || $1)).to_i }
+- :name: 1a_golf.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: p$<.sum{_1[/(\d)(.*(\d))?/]&&($1+($3||$1)).to_i}

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

@@ -0,0 +1,18 @@
+---
+- :name: 1b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    digits = (%w[one two three four five six seven eight nine].zip(1..9) + ('0'..'9').zip(0..9)).to_h
+    digit = digits.keys.join '|'
+    p File.readlines('1.txt').sum { /(#{digit})(?:.*(#{digit}))?/o =~ _1 and digits[$1] * 10 + digits[$2 || $1] }
+- :name: 1b_golf.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    a=[*?0..?9,*%w[0 one two three four five six seven eight nine]].zip([*0..9]*2).to_h
+    d=[*a]*?|
+    p$<.sum{_1[/(#{d})(.*(#{d}))?/]&&a[$1]*10+a[$3||$1]}
+- :name: 1b_golf2.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    a=[*?0..?9]+%w[0 one two three four five six seven eight nine]
+    p$<.sum{_1[/(#{a*?|})(.*(#{a*?|}))?/]&&a.index($1)%10*10+a.index($3||$1)%10}

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

@@ -0,0 +1,17 @@
+---
+- :name: 2a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    max = %w[red green blue].zip(12..14).to_h
+    p File.readlines('2.txt').sum { |line|
+      game = line[/^Game (\d+): (.+)$/, 1].to_i
+      $2.split('; ').all? { |pick|
+        pick.split(', ').all? {
+          _1[/^(\d+) (\w+)$/]
+          $1.to_i <= max.fetch($2)
+        }
+      } ? game : 0
+    }
+- :name: 2a_golf.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: 'p$<.sum{|l|l.scan(/(\d+) (\w+)/).all?{_1.to_i<%w[red green blue].index(_2)+13}?l[/\d+/].to_i: 0}'

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

@@ -0,0 +1,14 @@
+---
+- :name: 2b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    p File.readlines('2.txt').sum { |line|
+      max = %w[red green blue].zip([0] * 3).to_h
+      line[/: (.+)$/, 1].split('; ').each { |pick|
+        pick.split(', ').each {
+          _1[/^(\d+) (\w+)$/]
+          max[$2] = [max[$2], $1.to_i].max
+        }
+      }
+      max.values.reduce(:*)
+    }

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

@@ -0,0 +1,33 @@
+---
+- :name: 3a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    map = {}
+    $<.each_with_index{ |line,y|
+      line.chomp.chars.each_with_index { |c,x| map[x+y.i] = c }
+    }
+
+    numbers = map.each_pair.chunk { |p,c| [!!c[/\d/], p.imag] }.select { |(d,_),| d }.map(&:last)
+    numbers = numbers.select do |number|
+      number.any? { |p,_|
+        [p-1i, p-1i+1, p+1, p+1+1i, p+1i, p+1i-1, p-1, p-1-1i].any? { map[_1] =~ /[^0-9.]/ }
+      }
+    end
+    p numbers.sum { _1.map(&:last).sum('').to_i }
+- :name: 3a_golf.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    s=$<.read
+    w=(s=~/$/)+1
+    s.scan(/\d+/){|n|$.+=n.to_i if Range.new(*$~.offset(0),1).any?{|i|[i-w,i,i+w].any?{(_1>0?s[_1-1,3]:s[_1,2])=~/[^\d\s.]/}}}
+    p $.
+- :name: 3a_golf2.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    s=$<.read
+    w=(s=~/$/)+1
+    s.scan(/\d+/){|n|$.+=n.to_i if Range.new(*$~.offset(0),1).any?{|i|[i-w,i,i+w].any?{(s[_1-1,3]if _1>0)=~/[^\d\s.]/}}}
+    p $.
+- :name: 3a_golf3.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: s=$<.read;w=s=~/$/;s.scan(/\d+/){|n|i=$`.size;$.+=n.to_i if[i-w-2,i-1,i+w].any?{_1>=0&&s[_1,2+n.size]=~/[^\d\s.]/}};p$.

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

@@ -0,0 +1,21 @@
+---
+- :name: 3b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    map = {}
+    $<.each_with_index{ |line,y|
+      line.chomp.chars.each_with_index { |c,x| map[x+y.i] = c }
+    }
+
+    gears = map.each_pair.select { _2 == '*' }.map(&:first)
+
+    p gears.sum { |g|
+      adj = [g-1i, g-1i+1, g+1, g+1+1i, g+1i, g+1i-1, g-1, g-1-1i].select { map[_1] =~ /\d/ }
+      adj.dup.each { |p|
+        adj << p while map[p-=1] =~ /\d/
+        adj << p while map[p+=1] =~ /\d/
+      }
+      adj = adj.uniq.sort_by { _1.rect.reverse }
+      numbers = adj.slice_when { (_2 - _1) != 1 }.to_a
+      numbers.size == 2 ? numbers.map { |n| n.sum('') { map[_1] }.to_i }.reduce(:*) : 0
+    }

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

@@ -0,0 +1,15 @@
+---
+- :name: 4a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    p $<.sum { |line|
+      winning, got = line.split(/[:|]/)[1..].map { |series| series.split.map { Integer(_1) } }
+      winning_cards = got.count { |card| winning.include?(card) }
+      1 << winning_cards-1
+    }
+- :name: 4a_golf.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: p$<.sum{1<<(_1[/.+\|/].split&$'.split).size-1}
+- :name: 4a_golf2.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: p$<.sum{1<<(_1=~/\|/;$`.split&$'.split).size-1}

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

@@ -0,0 +1,13 @@
+---
+- :name: 4b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    lines = $<.readlines
+    cards = [1] * lines.size
+    lines.each_with_index { |line, card|
+      winning, got = line.split(/[:|]/)[1..].map { |series| series.split.map { Integer(_1) } }
+      win = got.count { winning.include?(_1) }
+      i = card
+      win.times { cards[i += 1] += cards[card] }
+    }
+    p cards.sum