advent_of_ruby 0.2.0 → 0.3.0

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

@@ -0,0 +1,71 @@
+---
+- :name: 16b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2021
+  :solution: |-
+    require_relative 'lib'
+
+    bits = File.read('16.txt').chomp.chars.map { "%04b" % Integer(_1, 16) }.join.freeze
+
+    index = 0
+    read = -> n_bits {
+      bits[index...(index += n_bits)]
+    }
+
+    int = -> n_bits {
+      Integer(read[n_bits], 2)
+    }
+
+    operations = [:+, :*, :min, :max, nil, :>, :<, :==]
+
+    parse = -> {
+      version = int[3]
+      type = int[3]
+
+      case type
+      when 4 # read number
+        parts = ''
+        begin
+          last = int[1]
+          parts << read[4]
+        end until last == 0
+        parts.to_i(2)
+      else
+        if int[1] == 0
+          bit_length = int[15]
+          start = index
+          args = []
+          args << parse[] while index < start + bit_length
+          raise unless index == start + bit_length
+        else
+          n_packets = int[11]
+          args = n_packets.times.map { parse[] }
+        end
+
+        [operations.fetch(type), *args]
+      end
+    }
+
+    interpret = -> code {
+      case code
+      when Integer
+        code
+      else
+        operation, *args = code
+        args = args.map { interpret[_1] }
+        case operation
+        when :min, :max
+          args.send(operation)
+        else
+          # !!r != r ? r : r ? 1 : 0
+          case args.reduce(operation)
+          in Integer => i then i
+          in true then 1
+          in false then 0
+          end
+        end
+      end
+    }
+
+    code = parse[]
+    # pp code
+    p interpret[code]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

@@ -0,0 +1,8 @@
+---
+- :name: 1a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    elfs = File.read('1.txt').split("\n\n").map { _1.lines.map(&Int) }
+    p elfs.max_by(&:sum).sum

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

@@ -0,0 +1,8 @@
+---
+- :name: 1b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    elfs = File.read('1.txt').split("\n\n").map { |elf| elf.lines.map(&Integer) }
+    p elfs.max_by(3, &:sum).map(&:sum).sum

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

@@ -0,0 +1,22 @@
+---
+- :name: 2a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    ALL = (ROCK, PAPER, SCISSORS = 1, 2, 3)
+    BEATS = ALL.zip(ALL.rotate(-1)).to_h
+
+    rounds = File.readlines('2.txt', chomp: true).map(&:split).map {
+      [_1.ord - 'A'.ord + 1, _2.ord - 'X'.ord + 1]
+    }
+    score = 0
+    rounds.each { |opponent, me|
+      score += me
+      if BEATS[me] == opponent
+        score += 6
+      elsif opponent == me
+        score += 3
+      end
+    }
+    p score

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

@@ -0,0 +1,38 @@
+---
+- :name: 2b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    ROCK = 1
+    PAPER = 2
+    SCISSORS = 3
+
+    BEATS = { ROCK => SCISSORS, PAPER => ROCK, SCISSORS => PAPER }
+    BEATEN_BY = BEATS.invert
+
+    MAPPING = {
+      'A' => ROCK,
+      'B' => PAPER,
+      'C' => SCISSORS,
+    }
+
+    rounds = File.readlines('2.txt', chomp: true).map(&:split).map { [MAPPING[_1], _2] }
+    score = 0
+    rounds.each { |opponent, result|
+      if result == 'X' # lose
+        me = BEATS[opponent]
+      elsif result == 'Y' # draw
+        me = opponent
+      else
+        me = BEATEN_BY[opponent]
+      end
+
+      score += me
+      if BEATS[me] == opponent
+        score += 6
+      elsif opponent == me
+        score += 3
+      end
+    }
+    p score

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

@@ -0,0 +1,17 @@
+---
+- :name: 3a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    p File.readlines('3.txt', chomp: true).sum { |line|
+      a, b = line[0...line.size/2], line[line.size/2..-1]
+      common = (a.chars & b.chars).single
+      if common.between?('a', 'z')
+        common.ord - 'a'.ord + 1
+      elsif common.between?('A', 'Z')
+        common.ord - 'A'.ord + 27
+      else
+        raise common
+      end
+    }

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

@@ -0,0 +1,16 @@
+---
+- :name: 3b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    p File.readlines('3.txt', chomp: true).each_slice(3).sum { |lines|
+      common = lines.map(&:chars).reduce(:&).single
+      if common.between?('a', 'z')
+        common.ord - 'a'.ord + 1
+      elsif common.between?('A', 'Z')
+        common.ord - 'A'.ord + 27
+      else
+        raise common
+      end
+    }

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

@@ -0,0 +1,13 @@
+---
+- :name: 4a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    p File.readlines('4.txt', chomp: true).count { |line|
+      r1, r2 = line.split(',').map { |from_to|
+        from, to = from_to.split('-').map(&Int)
+        (from..to)
+      }
+      r1.cover?(r2) || r2.cover?(r1)
+    }

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

@@ -0,0 +1,20 @@
+---
+- :name: 4b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    class Range
+      def overlap?(range)
+        self.include?(range.begin) or self.include?(range.end) or
+        range.include?(self.begin) or range.include?(self.end)
+      end
+    end
+
+    p File.readlines('4.txt', chomp: true).count { |line|
+      r1, r2 = line.split(',').map { |from_to|
+        from, to = from_to.split('-').map(&Int)
+        (from..to)
+      }
+      r1.overlap?(r2)
+    }

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

@@ -0,0 +1,23 @@
+---
+- :name: 5a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    initial, moves = File.readlines('5.txt', chomp: true).slice_at("").exactly(2)
+
+    stacks = initial.map { |line|
+      line.chars.map { _1 if _1 != " " }
+    }.transpose.map(&:reverse).select(&:first).map { |line|
+      line.compact.drop(1)
+    }
+
+    moves.each { |move|
+      /^move (\d+) from (\d+) to (\d+)$/ =~ move or raise move
+      n, from, to = $~.captures.map(&Int)
+      from -= 1
+      to -= 1
+      n.times { stacks[to] << stacks[from].pop }
+    }
+
+    puts stacks.map(&:last).join

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

@@ -0,0 +1,23 @@
+---
+- :name: 5b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    initial, moves = File.readlines('5.txt', chomp: true).slice_at("").exactly(2)
+
+    stacks = initial.map { |line|
+      line.chars.map { _1 if _1 != " " }
+    }.transpose.map(&:reverse).select(&:first).map { |line|
+      line.compact.drop(1)
+    }
+
+    moves.each { |move|
+      /^move (\d+) from (\d+) to (\d+)$/ =~ move or raise move
+      n, from, to = $~.captures.map(&Int)
+      from -= 1
+      to -= 1
+      stacks[to].push *stacks[from].pop(n)
+    }
+
+    puts stacks.map(&:last).join

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

@@ -0,0 +1,12 @@
+---
+- :name: 6a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    input = File.readlines('6.txt', chomp: true).single
+    # input = STDIN.readlines(chomp: true).single
+
+    p input.chars.each_cons(4).find_index { |chars|
+      chars.uniq == chars
+    } + 4

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

@@ -0,0 +1,12 @@
+---
+- :name: 6b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    input = File.readlines('6.txt', chomp: true).single
+    # input = STDIN.readlines(chomp: true).single
+
+    p input.chars.each_cons(14).find_index { |chars|
+      chars.uniq == chars
+    } + 14

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

@@ -0,0 +1,56 @@
+---
+- :name: 7a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    lines = File.readlines('7.txt', chomp: true)
+
+    fs = Hash.new { |h,k| h[k] = Hash.new(&h.default_proc) }
+    stack = []
+    define_method :cwd do
+      stack.last
+    end
+
+    stream = ArrayIterator.new(lines)
+    while line = stream.next
+      raise line unless line.start_with?('$ ')
+      command, *args = line[2..].split(' ', 2)
+      case command
+      in 'cd'
+        case args.single
+        in '/'
+          stack = [fs]
+        in '..'
+          stack.pop
+        in to
+          stack << cwd[to]
+        end
+      in 'ls'
+        raise unless args.empty?
+        while stream.peek and !stream.peek.start_with?('$ ')
+          line = stream.next
+          case line
+          in /^dir (.+)$/
+            cwd[$1]
+          in /^(\d+) (.+)$/
+            cwd[$2] = Integer($1)
+          end
+        end
+      end
+    end
+
+    # pp fs
+
+    def compute_size(dir, &block)
+      return dir if Int === dir
+      size = dir.each_pair.sum { |name, value|
+        compute_size(value, &block)
+      }
+      yield size
+      size
+    end
+
+    p to_enum(:compute_size, fs).select { |size|
+      size <= 100000
+    }.sum

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

@@ -0,0 +1,62 @@
+---
+- :name: 7b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    lines = File.readlines('7.txt', chomp: true)
+
+    fs = Hash.new { |h,k| h[k] = Hash.new(&h.default_proc) }
+    stack = []
+    define_method :cwd do
+      stack.last
+    end
+
+    stream = ArrayIterator.new(lines)
+    while line = stream.next
+      raise line unless line.start_with?('$ ')
+      command, *args = line[2..].split(' ', 2)
+      case command
+      in 'cd'
+        case args.single
+        in '/'
+          stack = [fs]
+        in '..'
+          stack.pop
+        in to
+          stack << cwd[to]
+        end
+      in 'ls'
+        raise unless args.empty?
+        while stream.peek and !stream.peek.start_with?('$ ')
+          line = stream.next
+          case line
+          in /^dir (.+)$/
+            cwd[$1]
+          in /^(\d+) (.+)$/
+            cwd[$2] = Integer($1)
+          end
+        end
+      end
+    end
+
+    # pp fs
+
+    def compute_size(dir, &block)
+      return dir if Int === dir
+      size = dir.each_pair.sum { |name, value|
+        compute_size(value, &block)
+      }
+      yield size
+      size
+    end
+
+    total = 70000000
+    goal = 30000000
+    used = compute_size(fs) {}
+    left = total - used
+    need = goal - left
+
+    p to_enum(:compute_size, fs).select { |size|
+      size >= need
+    }.min

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

@@ -0,0 +1,40 @@
+---
+- :name: 8a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+    require 'set'
+
+    trees = {}
+
+    grid = File.readlines('8.txt', chomp: true).map.with_index { |line, y|
+      line.chars.map(&Int).map.with_index { |height, x|
+        pos = x+y.i
+        trees[pos] = height
+        pos
+      }
+    }
+
+    visible = Set.new
+
+    define_method(:look) { |starts, dir|
+      starts.each { |start|
+        visible << start
+        prev, pos = start, start + dir
+        max_height = trees[start]
+        while trees[pos]
+          if trees[pos] > max_height
+            visible << pos
+            max_height = trees[pos]
+          end
+          prev, pos = pos, pos + dir
+        end
+      }
+    }
+
+    look grid.first, 1i
+    look grid.last, -1i
+    look grid.map(&:first), 1
+    look grid.map(&:last), -1
+
+    p visible.size

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

@@ -0,0 +1,34 @@
+---
+- :name: 8b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+    require 'set'
+
+    trees = {}
+
+    grid = File.readlines('8.txt', chomp: true).map.with_index { |line, y|
+      line.chars.map(&Int).map.with_index { |height, x|
+        pos = x+y.i
+        trees[pos] = height
+        pos
+      }
+    }
+
+    define_method(:look) { |start, dir|
+      prev, pos = start, start + dir
+      h = trees[start]
+      see = 0
+      while trees[pos] and trees[pos] < h
+        see += 1
+        prev, pos = pos, pos + dir
+      end
+      see += 1 if trees[pos]
+      see
+    }
+
+    border = grid.first + grid.last + grid.map(&:first) + grid.map(&:last)
+    middle = trees.keys - border
+    p middle.map { |pos|
+      look(pos, 1) * look(pos, -1) * look(pos, 1i) * look(pos, -1i)
+    }.max

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

@@ -0,0 +1,39 @@
+---
+- :name: 9a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+    require 'set'
+
+    DIRECTIONS = { 'R' => 1, 'L' => -1, 'U' => 1i, 'D' => -1i }
+    DIAGONAL_MOVES = [1+1i, 1-1i, -1+1i, -1-1i]
+    VISITED = Set.new
+
+    steps = File.readlines('9.txt', chomp: true)
+
+    head = tail = 0i
+    VISITED << tail
+
+    HYPOT_1_1 = Math.hypot(1, 1)
+    HYPOT_1_2 = Math.hypot(1, 2)
+
+    steps.each do |line|
+      dir, n = line.split.then { [DIRECTIONS.fetch(_1), Integer(_2)] }
+      n.times do
+        head += dir
+        distance = (tail - head).abs
+        case distance
+        when 0, 1, HYPOT_1_1
+        when 2
+          tail += (head - tail) / 2
+        when HYPOT_1_2
+          tail += DIAGONAL_MOVES.min_by { |move| ((tail + move) - head).abs }
+        else
+          raise [head, tail, distance].inspect
+        end
+
+        VISITED << tail
+      end
+    end
+
+    p VISITED.size

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

@@ -0,0 +1,50 @@
+---
+- :name: 9b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+    require 'set'
+
+    DIRECTIONS = { 'R' => 1, 'L' => -1, 'U' => 1i, 'D' => -1i }
+    DIAGONAL_MOVES = [1+1i, 1-1i, -1+1i, -1-1i]
+    VISITED = Set.new
+
+    steps = File.readlines('9.txt', chomp: true)
+
+    head = 0i
+    TAILS = 9.times.map { 0i }
+    def tail
+      TAILS.last
+    end
+
+    HYPOT_1_1 = Math.hypot(1, 1)
+    HYPOT_1_2 = Math.hypot(1, 2)
+    HYPOT_2_2 = Math.hypot(2, 2)
+
+    steps.each do |line|
+      dir, n = line.split.then { [DIRECTIONS.fetch(_1), Integer(_2)] }
+      n.times do
+        head += dir
+        prev = head
+        TAILS.each_with_index { |tail, i|
+          distance = (tail - prev).abs
+          case distance
+          when 0, 1, HYPOT_1_1
+          when 2, HYPOT_2_2
+            tail += (prev - tail) / 2
+          when HYPOT_1_2
+            tail += DIAGONAL_MOVES.min_by { |move| ((tail + move) - prev).abs }
+          else
+            p [head, *TAILS]
+            raise [i, prev, tail, distance].inspect
+          end
+
+          prev = TAILS[i] = tail
+          # p head, TAILS
+        }
+
+        VISITED << TAILS.last
+      end
+    end
+
+    p VISITED.size

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

@@ -0,0 +1,28 @@
+---
+- :name: 10a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2022
+  :solution: |-
+    require_relative 'lib'
+
+    instructions = File.readlines('10.txt', chomp: true)
+    x = 1
+    cycle = 1
+    x_values = [nil]
+
+    clock = -> {
+      x_values[cycle] = x
+      cycle += 1
+    }
+
+    instructions.each { |instruction|
+      case instruction
+      in /^noop$/
+        clock.()
+      in /^addx (-?\d+)$/
+        clock.()
+        clock.()
+        x += Integer($1)
+      end
+    }
+
+    p (20..220).step(40).sum { x_values.fetch(_1) * _1 }