advent_of_ruby 0.2.0 → 0.3.0

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

@@ -0,0 +1,57 @@
+---
+- :name: 24b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: |-
+    moves = File.readlines('24.txt', chomp: true).map { |line| line.scan(/e|se|sw|w|nw|ne/).map(&:to_sym) }
+
+    #  NW NE
+    # W  O  E
+    #  SW SE
+    # --> 1
+    # \
+    #  v
+    #   1
+
+    WHITE, BLACK = false, true
+
+    tiles = Hash.new(WHITE)
+
+    DIRS = {
+      e:  0.i + 1,
+      se: 1.i,
+      sw: 1.i - 1,
+      w:  0.i - 1,
+      nw: -1.i,
+      ne: -1.i + 1,
+    }.freeze
+
+    NEIGHBORS = DIRS.values.freeze
+
+    moves.each { |move|
+      pos = 0 + 0.i
+      move.each { |step| pos += DIRS[step] }
+      tiles[pos] = !tiles[pos]
+    }
+
+    tiles.select! { |pos, color| color == BLACK }
+
+    100.times do
+      next_tiles = Hash.new(WHITE)
+
+      tiles.each_pair { |pos, color|
+        raise unless color == BLACK
+        neighbors = NEIGHBORS.map { |dir| pos + dir }
+
+        blacks = neighbors.count { |at| tiles[at] == BLACK }
+        next_tiles[pos] = BLACK if (1..2).include?(blacks)
+
+        neighbors.each { |at|
+          if tiles[at] == WHITE and NEIGHBORS.count { |dir| tiles[at + dir] == BLACK } == 2
+            next_tiles[at] = BLACK
+          end
+        }
+      }
+
+      tiles = next_tiles
+    end
+    p tiles.size

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

@@ -0,0 +1,28 @@
+---
+- :name: 25a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: |-
+    def subject_number(initial, loop_size)
+      n = 1
+      loop_size.times {
+        n = (n * initial) % 20201227
+      }
+      n
+    end
+
+    def find_loop_size(initial, key)
+      n = 1
+      (1..).find {
+        n = (n * initial) % 20201227
+        n == key
+      }
+    end
+
+    card_key = 1526110
+    door_key = 20175123
+
+    p card_loop = find_loop_size(7, card_key)
+    p door_loop = find_loop_size(7, door_key)
+
+    p subject_number(door_key, card_loop)
+    p subject_number(card_key, door_loop)

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

@@ -0,0 +1,8 @@
+---
+- :name: 1a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2021
+  :solution: |-
+    require_relative 'lib'
+
+    data = File.readlines('1.txt').map(&Integer)
+    p data.each_cons(2).count { _1 < _2 }

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

@@ -0,0 +1,8 @@
+---
+- :name: 1b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2021
+  :solution: |-
+    require_relative 'lib'
+
+    data = File.readlines('1.txt').map(&Integer)
+    p data.each_cons(3).map(&:sum).each_cons(2).count { _1 < _2 }

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

@@ -0,0 +1,17 @@
+---
+- :name: 2a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2021
+  :solution: |-
+    actions = File.readlines('2.txt').map { |line|
+      line.split.then { [_1, Integer(_2)] }
+    }
+
+    x, depth = 0, 0
+    actions.each { |action, n|
+      case action
+      in 'forward' then x += n
+      in 'down' then depth += n
+      in 'up' then depth -= n
+      end
+    }
+    p x * depth

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

@@ -0,0 +1,17 @@
+---
+- :name: 2b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2021
+  :solution: |-
+    actions = File.readlines('2.txt').map { |line|
+      line.split.then { [_1, Integer(_2)] }
+    }
+
+    x, depth, aim = 0, 0, 0
+    actions.each { |action, n|
+      case action
+      in 'forward' then x += n and depth += aim * n
+      in 'down' then aim += n
+      in 'up' then aim -= n
+      end
+    }
+    p x * depth

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

@@ -0,0 +1,14 @@
+---
+- :name: 3a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2021
+  :solution: |-
+    data = File.readlines('3.txt', chomp: true)
+    gamma, epsilon = "", ""
+    data.first.length.times { |i|
+      zeros, ones = data.map { _1[i] }.tally.values_at('0', '1')
+      case zeros <=> ones
+      in 1 then gamma << '0' and epsilon << '1'
+      in -1 then gamma << '1' and epsilon << '0'
+      end
+    }
+    p gamma.to_i(2) * epsilon.to_i(2)

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

@@ -0,0 +1,18 @@
+---
+- :name: 3b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2021
+  :solution: |-
+    data = File.readlines('3.txt', chomp: true)
+
+    def rating(numbers, i, criteria)
+      return numbers[0] if numbers.size == 1
+      zeros, ones = numbers.map { _1[i] }.tally.values_at('0', '1')
+      keep = criteria[zeros <=> ones]
+      numbers = numbers.select { _1[i] == keep }
+      rating(numbers, i+1, criteria)
+    end
+
+    oxygen = rating(data, 0, { -1 => '1', 0 => '1', 1 => '0' })
+    co2 = rating(data, 0, { -1 => '0', 0 => '0', 1 => '1' })
+
+    p oxygen.to_i(2) * co2.to_i(2)

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

@@ -0,0 +1,29 @@
+---
+- :name: 4a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2021
+  :solution: |-
+    require_relative 'lib'
+
+    def negate(n) = n > 0 ? -n : (n == 0 ? -Float::INFINITY : raise)
+
+    numbers, _, *boards = File.readlines('4.txt', chomp: true)
+    numbers = numbers.split(',').map(&Integer)
+
+    boards = boards.join("\n").split("\n\n").map { |board|
+      board.lines.map { _1.split.map(&Integer) }
+    }
+
+    numbers.each { |n|
+      boards.each { |board|
+        board.each { |row|
+          if i = row.index(n)
+            row[i] = negate(n)
+            if row.all?(&:negative?) or
+                board.map { _1[i] }.all?(&:negative?)
+              p board.flatten.reject(&:negative?).sum * n
+              exit
+            end
+          end
+        }
+      }
+    }

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

@@ -0,0 +1,33 @@
+---
+- :name: 4b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2021
+  :solution: |-
+    require_relative 'lib'
+
+    def negate(n) = n > 0 ? -n : (n == 0 ? -Float::INFINITY : raise)
+
+    numbers, _, *boards = File.readlines('4.txt', chomp: true)
+    numbers = numbers.split(',').map(&Integer)
+
+    boards = boards.join("\n").split("\n\n").map { |board|
+      board.lines.map { _1.split.map(&Integer) }
+    }
+
+    numbers.each { |n|
+      boards.dup.each { |board|
+        board.each { |row|
+          if i = row.index(n)
+            row[i] = negate(n)
+            if row.all?(&:negative?) or
+                board.map { _1[i] }.all?(&:negative?)
+              if boards.size == 1
+                p board.flatten.reject(&:negative?).sum * n
+                exit
+              else
+                boards.delete(board)
+              end
+            end
+          end
+        }
+      }
+    }

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

@@ -0,0 +1,27 @@
+---
+- :name: 5a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2021
+  :solution: |-
+    require_relative 'lib'
+
+    lines = File.readlines('5.txt', chomp: true).map { |line|
+      line.split(' -> ').map { |coord|
+        coord.split(',').map(&Integer).then {
+          _1 + _2.i
+        }
+      }
+    }
+
+    lines = lines.select { |a,b| a.real == b.real or a.imag == b.imag }
+
+    crossings = Hash.new(0)
+    lines.each { |a,b|
+      dir = b - a
+      dir /= dir.abs
+      Enumerator.produce(a) { _1 + dir }.find {
+        crossings[_1] += 1
+        _1 == b
+      }
+    }
+
+    p crossings.values.count { _1 > 1 }

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

@@ -0,0 +1,26 @@
+---
+- :name: 5b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2021
+  :solution: |-
+    require_relative 'lib'
+
+    lines = File.readlines('5.txt', chomp: true).map { |line|
+      line.split(' -> ').map { |coord|
+        coord.split(',').map(&Integer).then {
+          _1 + _2.i
+        }
+      }
+    }
+
+    crossings = Hash.new(0)
+    lines.each { |a,b|
+      dir = b - a
+      dir /= [(b.real - a.real).abs, (b.imag - a.imag).abs].max
+      pos = a
+      Enumerator.produce(a) { _1 + dir }.find {
+        crossings[_1] += 1
+        _1 == b
+      }
+    }
+
+    p crossings.values.count { _1 > 1 }

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

@@ -0,0 +1,21 @@
+---
+- :name: 6a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2021
+  :solution: |-
+    require_relative 'lib'
+
+    lanternfish = File.read('6.txt').chomp.split(',').map(&Integer)
+
+    80.times { |day|
+      n = lanternfish.size
+      n.times { |i|
+        age = lanternfish[i]
+        lanternfish[i] = if age > 0
+          age - 1
+        else
+          lanternfish << 8
+          6
+        end
+      }
+    }
+    p lanternfish.size

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

@@ -0,0 +1,17 @@
+---
+- :name: 6b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2021
+  :solution: |-
+    require_relative 'lib'
+
+    lanternfish = File.read('6.txt').chomp.split(',').map(&Integer)
+
+    days = 256
+
+    simulate = Hash.new { |h, state|
+      h[state] = 1 + state.step(days, 7).sum { |day|
+        simulate[day + 9]
+      }
+    }
+
+    p lanternfish.sum { |day| simulate[day + 1] }

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

@@ -0,0 +1,12 @@
+---
+- :name: 7a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2021
+  :solution: |-
+    require_relative 'lib'
+
+    crabs = File.read('7.txt').chomp.split(',').map(&Integer)
+
+    p Range.new(*crabs.minmax).map { |pos|
+      cost = crabs.sum { |i| (i - pos).abs }
+      [cost, pos]
+    }.min.first

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

@@ -0,0 +1,12 @@
+---
+- :name: 7b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2021
+  :solution: |-
+    require_relative 'lib'
+
+    crabs = File.read('7.txt').chomp.split(',').map(&Integer)
+
+    p Range.new(*crabs.minmax).map { |pos|
+      cost = crabs.sum { |i| n = (i - pos).abs and (n * n.succ) / 2 }
+      [cost, pos]
+    }.min.first

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

@@ -0,0 +1,16 @@
+---
+- :name: 8a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2021
+  :solution: |-
+    require_relative 'lib'
+
+    outputs = File.readlines('8.txt', chomp: true).map { _1.split(' | ').last.split }
+
+    segments_to_digit = {
+      2 => 1,
+      4 => 4,
+      3 => 7,
+      7 => 8,
+    }
+
+    p outputs.sum { |output| output.count { |v| segments_to_digit.include? v.size } }

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

@@ -0,0 +1,64 @@
+---
+- :name: 8b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2021
+  :solution: |-
+    require_relative 'lib'
+
+    lines = File.readlines('8.txt', chomp: true).map { |line| line.split(' | ').map { _1.split } }
+
+    segments_to_digit = {
+      'abcefg' => 0,
+      'cf' => 1,
+      'acdeg' => 2,
+      'acdfg' => 3,
+      'bcdf' => 4,
+      'abdfg' => 5,
+      'abdefg' => 6,
+      'acf' => 7,
+      'abcdefg' => 8,
+      'abcdfg' => 9,
+    }
+
+    def reduce(possibilities)
+      possibilities.values.select { _1.size == 1 }.each { |found|
+        possibilities.each { |k, v| v.delete(*found) unless v == found }
+      }
+
+      possibilities.values.group_by(&:itself).select { |k, v| k.size == 2 and v.size == 2 }.each_key { |double|
+        possibilities.each { |k, v| double.each { v.delete(_1) } unless v == double }
+      }
+    end
+
+    p lines.sum { |inputs, outputs|
+      possibilities = {}
+      ('a'..'g').each { |l| possibilities[l] = ('a'..'g').to_a }
+
+      one = inputs.find { _1.size == 2 }
+      cf1, cf2 = one.chars
+      [cf1, cf2].each { |c| possibilities[c] = %w[c f] }
+
+      seven = inputs.find { _1.size == 3 }
+      a = (seven.chars - one.chars)[0]
+      possibilities[a] = %w[a]
+
+      four = inputs.find { _1.size == 4 }
+      bd1, bd2 = four.chars - one.chars
+      [bd1, bd2].each { |c| possibilities[c] = %w[b d] }
+
+      zero = inputs.find { _1.size == 6 and _1.count("#{bd1}#{bd2}") == 1 }
+      d = zero.include?(bd1) ? bd2 : bd1
+      possibilities[d] = %w[d]
+
+      six = inputs.find { _1.size == 6 and _1.count("#{cf1}#{cf2}") == 1 }
+      c = six.include?(cf1) ? cf2 : cf1
+      possibilities[c] = %w[c]
+
+      nine = inputs.find { _1.size == 6 and _1.count("#{cf1}#{cf2}") == 2 and _1 != zero }
+      e = (('a'..'g').to_a - nine.chars)[0]
+      possibilities[e] = %w[e]
+
+      reduce(possibilities) until possibilities.values.all? { _1.size == 1 }
+
+      tr = [possibilities.keys.join, possibilities.values.join]
+      outputs.map { |output| segments_to_digit.fetch(output.tr(*tr).chars.sort.join) }.join.to_i
+    }

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

@@ -0,0 +1,21 @@
+---
+- :name: 9a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2021
+  :solution: |-
+    require_relative 'lib'
+
+    map = File.readlines('9.txt', chomp: true).map { _1.chars.map(&Integer) }
+
+    coords = {}
+
+    map.each_with_index { |row, y|
+      row.each_with_index { |depth, x|
+        coords[x + y.i] = depth
+      }
+    }
+
+    p coords.select { |coord, depth|
+      [coord - 1i, coord + 1, coord + 1i, coord - 1].select { |c|
+        coords.include? c
+      }.all? { |c| depth < coords[c] }
+    }.values.sum { _1 + 1 }

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

@@ -0,0 +1,48 @@
+---
+- :name: 9b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2021
+  :solution: |-
+    require_relative 'lib'
+
+    map = File.readlines('9.txt', chomp: true).map { _1.chars.map(&Integer) }
+
+    coords = {}
+
+    map.each_with_index { |row, y|
+      row.each_with_index { |depth, x|
+        coords[x + y.i] = depth
+      }
+    }
+
+    neighbors = -> coord {
+      [coord - 1i, coord + 1, coord + 1i, coord - 1].select { |c| coords.include? c }
+    }
+
+    low_points = coords.select { |coord, depth|
+      neighbors[coord].all? { |c| depth < coords[c] }
+    }.keys
+
+    def bfs(result, neighbors)
+      q = result.keys
+      while c = q.shift
+        neighbors[c].each { |neighbor|
+          unless result.include? neighbor
+            v = yield(neighbor)
+            result[neighbor] = v
+            q << neighbor if v
+          end
+        }
+      end
+    end
+
+    coord_to_basin = low_points.each_with_index.to_h
+
+    bfs(coord_to_basin, neighbors) { |c|
+      if coords[c] == 9
+        nil
+      else
+        neighbors[c].map { |n| coord_to_basin[n] }.compact.uniq.single
+      end
+    }
+
+    p coord_to_basin.group_by { _2 }.to_h { [_1, _2.size] }.select { _1 != nil }.values.sort[-3..].reduce(:*)

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

@@ -0,0 +1,33 @@
+---
+- :name: 10a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2021
+  :solution: |-
+    require_relative 'lib'
+
+    lines = File.readlines('10.txt', chomp: true)
+
+    pairs = {
+      '(' => ')',
+      '[' => ']',
+      '{' => '}',
+      '<' => '>',
+    }
+    opening = pairs
+    closing = pairs.invert
+    values = { ')' => 3, ']' => 57, '}' => 1197, '>' => 25137 }
+
+    score = 0
+    lines.each { |line|
+      nesting = []
+      line.chars.each { |c|
+        if opening[c]
+          nesting << pairs[c]
+        elsif closing[c]
+          expected = nesting.pop
+          if c != expected
+            break score += values[c]
+          end
+        end
+      }
+    }
+    p score

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

@@ -0,0 +1,37 @@
+---
+- :name: 10b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2021
+  :solution: |-
+    require_relative 'lib'
+
+    lines = File.readlines('10.txt', chomp: true)
+
+    pairs = {
+      '(' => ')',
+      '[' => ']',
+      '{' => '}',
+      '<' => '>',
+    }
+    opening = pairs
+    closing = pairs.invert
+    values = { ')' => 1, ']' => 2, '}' => 3, '>' => 4 }
+
+    scores = []
+    lines.each { |line|
+      nesting = []
+      line.chars.each { |c|
+        if opening[c]
+          nesting << pairs[c]
+        elsif closing[c]
+          expected = nesting.pop
+          if c != expected
+            break nesting.clear
+          end
+        end
+      }
+
+      unless nesting.empty?
+        scores << nesting.reverse.inject(0) { |score, close| score * 5 + values[close] }
+      end
+    }
+    p scores.sort[scores.size / 2]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

@@ -0,0 +1,46 @@
+---
+- :name: 16a.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)
+    }
+
+    sum = 0
+
+    parse = -> {
+      version = int[3]
+      sum += version
+
+      type = int[3]
+      case type
+      when 4 # read number
+        parts = ''
+        begin
+          last = int[1]
+          parts << read[4]
+        end until last == 0
+      else
+        if int[1] == 0
+          bit_length = int[15]
+          start = index
+          parse[] while index < start + bit_length
+          raise unless index == start + bit_length
+        else
+          n_packets = int[11]
+          n_packets.times { parse[] }
+        end
+      end
+    }
+
+    parse[]
+    p sum