advent_of_ruby 0.2.0 → 0.3.0

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

@@ -0,0 +1,118 @@
+---
+- :name: 17a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2019
+  :solution: |-
+    input = File.read('17.txt')
+    code = input.chomp.split(',').map { |e| Integer(e) }.freeze
+
+    def interpreter(memory, input, output)
+      memory = memory.dup
+      def memory.[](i)
+        raise if i < 0
+        super(i) || 0
+      end
+      ip = 0
+      mode = 0
+      relative_base = 0
+
+      get_mode = -> i {
+        mode / (10 ** (i-1)) % 10
+      }
+
+      read = -> i {
+        v = memory[ip + i]
+        case m = get_mode[i]
+        when 0 # position
+          memory[v]
+        when 1 # immediate
+          v
+        when 2 # relative
+          memory[relative_base + v]
+        else
+          raise "Unknown read mode #{m} (#{mode} #{i})"
+        end
+      }
+
+      write = -> i, result {
+        v = memory[ip + i]
+        case m = get_mode[i]
+        when 0 # position
+          memory[v] = result
+        when 2 # relative
+          memory[relative_base + v] = result
+        else
+          raise "Unknown write mode #{m} (#{mode} #{i})"
+        end
+      }
+
+      while true
+        instruction = memory[ip]
+        mode, opcode = instruction.divmod(100)
+        case opcode
+        when 1 # add
+          write[3, read[1] + read[2]]
+          ip += 4
+        when 2 # multiply
+          write[3, read[1] * read[2]]
+          ip += 4
+        when 3 # input
+          write[1, input.call]
+          ip += 2
+        when 4 # output
+          output.call(read[1])
+          ip += 2
+        when 5 # jump-if-true
+          ip = read[1] != 0 ? read[2] : ip + 3
+        when 6 # jump-if-false
+          ip = read[1] == 0 ? read[2] : ip + 3
+        when 7 # less than
+          write[3, read[1] < read[2] ? 1 : 0]
+          ip += 4
+        when 8 # equals
+          write[3, read[1] == read[2] ? 1 : 0]
+          ip += 4
+        when 9 # relative base offset
+          relative_base += read[1]
+          ip += 2
+        when 99
+          break
+        else
+          raise "Unknown opcode: #{opcode} at #{ip} (#{instruction})"
+        end
+      end
+    end
+
+    f = Fiber.new do
+      interpreter(code, -> { raise }, -> r { Fiber.yield(r) })
+      nil
+    end
+
+    DIRS = [-1i, 1i, -1, 1]
+    tiles = Hash.new('.')
+    pos = 0 + 0i
+
+    while c = f.resume
+      c = c.chr
+      c = '#' if %w[^ v < >].include?(c)
+
+      if c == "\n"
+        pos = 0 + (pos.imag + 1).i
+      else
+        tiles[pos] = c
+        pos += 1
+      end
+    end
+
+    intersections = tiles.keys.select { |pos|
+      tiles[pos] == '#' and DIRS.all? { |dir| tiles[pos + dir] == '#' }
+    }
+
+    intersections.each { |pos| tiles[pos] = 'O' }
+
+    puts Range.new(*tiles.keys.map(&:imag).minmax).map { |y|
+      Range.new(*tiles.keys.map(&:real).minmax).map { |x|
+        tiles[x + y.i]
+      }.join
+    }.join("\n")
+
+    p intersections.sum { |pos| pos.real * pos.imag }

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

@@ -0,0 +1,138 @@
+---
+- :name: 17b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2019
+  :solution: |-
+    input = File.read('17.txt')
+    code = input.chomp.split(',').map { |e| Integer(e) }.freeze
+
+    def interpreter(memory, input, output)
+      memory = memory.dup
+      def memory.[](i)
+        raise if i < 0
+        super(i) || 0
+      end
+      ip = 0
+      mode = 0
+      relative_base = 0
+
+      get_mode = -> i {
+        mode / (10 ** (i-1)) % 10
+      }
+
+      read = -> i {
+        v = memory[ip + i]
+        case m = get_mode[i]
+        when 0 # position
+          memory[v]
+        when 1 # immediate
+          v
+        when 2 # relative
+          memory[relative_base + v]
+        else
+          raise "Unknown read mode #{m} (#{mode} #{i})"
+        end
+      }
+
+      write = -> i, result {
+        v = memory[ip + i]
+        case m = get_mode[i]
+        when 0 # position
+          memory[v] = result
+        when 2 # relative
+          memory[relative_base + v] = result
+        else
+          raise "Unknown write mode #{m} (#{mode} #{i})"
+        end
+      }
+
+      while true
+        instruction = memory[ip]
+        mode, opcode = instruction.divmod(100)
+        case opcode
+        when 1 # add
+          write[3, read[1] + read[2]]
+          ip += 4
+        when 2 # multiply
+          write[3, read[1] * read[2]]
+          ip += 4
+        when 3 # input
+          write[1, input.call]
+          ip += 2
+        when 4 # output
+          output.call(read[1])
+          ip += 2
+        when 5 # jump-if-true
+          ip = read[1] != 0 ? read[2] : ip + 3
+        when 6 # jump-if-false
+          ip = read[1] == 0 ? read[2] : ip + 3
+        when 7 # less than
+          write[3, read[1] < read[2] ? 1 : 0]
+          ip += 4
+        when 8 # equals
+          write[3, read[1] == read[2] ? 1 : 0]
+          ip += 4
+        when 9 # relative base offset
+          relative_base += read[1]
+          ip += 2
+        when 99
+          break
+        else
+          raise "Unknown opcode: #{opcode} at #{ip} (#{instruction})"
+        end
+      end
+    end
+
+    f = Fiber.new do
+      memory = code.dup
+      # memory[0] = 2
+      interpreter(code, -> { Fiber.yield(:input) }, -> r { Fiber.yield(r) })
+      nil
+    end
+
+    DIRS = [-1i, 1i, -1, 1]
+    tiles = Hash.new('.')
+    pos = 0 + 0i
+    initial_pos = nil
+    current_dir = nil
+
+    while c = f.resume
+      c = c.chr
+      if i = %w[^ v < >].index(c)
+        c = '#'
+        initial_pos = pos
+        current_dir = DIRS[i]
+      end
+
+      if c == "\n"
+        pos = 0 + (pos.imag + 1).i
+      else
+        tiles[pos] = c
+        pos += 1
+      end
+    end
+
+    intersections = tiles.keys.select { |pos|
+      tiles[pos] == '#' and DIRS.all? { |dir| tiles[pos + dir] == '#' }
+    }
+
+    tiles = tiles.select { |pos,c| c == '#' }.to_h
+
+    puts Range.new(*tiles.keys.map(&:imag).minmax).map { |y|
+      Range.new(*tiles.keys.map(&:real).minmax).map { |x|
+        pos = x + y.i
+        pos == initial_pos ? 'V' : tiles[pos] || ' '
+      }.join
+    }.join("\n")
+
+    p current_dir
+
+    pos = initial_pos
+    visited = [initial_pos]
+    until visited.size == tiles.size
+      dirs = DIRS.map { |dir| pos + dir }.select { |at|
+        tiles[at] and !visited.include?(at)
+      }
+      if dirs.size > 1
+        raise unless dirs.include?
+      end
+    end

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

@@ -0,0 +1,4 @@
+---
+- :name: 1a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: p File.readlines('1.txt').map(&:to_i).combination(2).find { |a, b| a + b == 2020 }.reduce(:*)

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

@@ -0,0 +1,4 @@
+---
+- :name: 1b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: p File.readlines('1.txt').map(&:to_i).combination(3).find { |a, b, c| a + b + c == 2020 }.reduce(:*)

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

@@ -0,0 +1,8 @@
+---
+- :name: 2a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: |-
+    p File.readlines('2.txt', chomp: true).count { |line|
+      /^(?<min>\d+)-(?<max>\d+) (?<c>.): (?<password>.+)$/ =~ line or raise line
+      (password.chars.tally[c] || 0).between?(min.to_i, max.to_i)
+    }

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

@@ -0,0 +1,10 @@
+---
+- :name: 2b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: |-
+    p File.readlines('2.txt', chomp: true).count { |line|
+      /^(?<a>\d+)-(?<b>\d+) (?<c>.): (?<password>.+)$/ =~ line or raise line
+      a, b = [a, b].map { |i| i.to_i - 1 }
+      raise if a > password.size or b > password.size
+      (password[a] == c) != (password[b] == c)
+    }

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

@@ -0,0 +1,17 @@
+---
+- :name: 3a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: |-
+    require_relative 'lib'
+    using Refinements
+
+    map = File.readlines('3.txt', chomp: true).map { |line|
+      RepeatingArray.new line.chars.map { |c| c == '#' }
+    }
+
+    p Enumerator.produce([0 + 0i, 0]) { |pos, trees|
+      [
+        pos + 3 + 1i,
+        trees + map[pos.imag][pos.real].to_i
+      ]
+    }.find { |pos,| pos.imag >= map.size }.last

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

@@ -0,0 +1,19 @@
+---
+- :name: 3b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: |-
+    require_relative 'lib'
+    using Refinements
+
+    map = File.readlines('3.txt', chomp: true).map { |line|
+      RepeatingArray.new line.chars.map { |c| c == '#' }
+    }
+
+    p [1+1i, 3+1i, 5+1i, 7+1i, 1+2i].map { |slope|
+      Enumerator.produce([0 + 0.i, 0]) { |pos, trees|
+        [
+          pos + slope,
+          trees + map[pos.imag][pos.real].to_i
+        ]
+      }.find { |pos,| pos.imag >= map.size }.last
+    }.reduce(:*)

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

@@ -0,0 +1,8 @@
+---
+- :name: 4a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: |-
+    FIELDS = %w[byr iyr eyr hgt hcl ecl pid]
+    p File.read('4.txt').split(/\n{2,}/).map { |lines|
+      lines.split.map { |kv| kv[/^(\w+):/, 1] }
+    }.count { |fields| (FIELDS - fields).empty? }

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

@@ -0,0 +1,28 @@
+---
+- :name: 4b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: |-
+    def between?(a, b)
+      -> s { Integer(s, exception: false)&.between?(a, b) }
+    end
+
+    FIELDS = {
+      byr: between?(1920, 2002),
+      iyr: between?(2010, 2020),
+      eyr: between?(2020, 2030),
+      hgt: -> s {
+        /^(?<v>\d+)(?<unit>cm|in)$/ =~ s and
+        (unit == 'cm' ? between?(150, 193) : between?(59, 76)) === v
+      },
+      hcl: /^#\h{6}$/,
+      ecl: %w[amb blu brn gry grn hzl oth].method(:include?),
+      pid: /^\d{9}$/,
+    }
+
+    p File.read('4.txt').split(/\n{2,}/).map { |lines|
+      lines.split.to_h { |kv| kv.split(':', 2) }
+    }.count { |data|
+      FIELDS.each_pair.all? { |name, predicate|
+        value = data[name.to_s] and predicate === value
+      }
+    }

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

@@ -0,0 +1,10 @@
+---
+- :name: 5a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: |-
+    p File.readlines('5.txt', chomp: true).map { |line|
+      /^(?<row>[FB]{7})(?<col>[LR]{3})$/ =~ line or raise line
+      row = row.tr('FB', '01').to_i(2)
+      col = col.tr('LR', '01').to_i(2)
+      row * 8 + col
+    }.max

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

@@ -0,0 +1,33 @@
+---
+- :name: 5b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: |-
+    seats = Hash.new { |h,k| h[k] = [] }
+
+    File.readlines('5.txt', chomp: true).each { |line|
+      /^(?<row>[FB]{7})(?<col>[LR]{3})$/ =~ line or raise line
+      row = row.tr('FB', '01').to_i(2)
+      col = col.tr('LR', '01').to_i(2)
+      seats[row] << col
+    }
+
+    seats.each_pair.select { |row, cols|
+      cols.size < 8 and !seats.keys.minmax.include?(row)
+    }.map { |row, cols| [row, *(8.times.to_a - cols)] }.each { |row, col|
+      p row * 8 + col
+    }
+- :name: 5b_functional.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: |-
+    seats = File.readlines('5.txt', chomp: true).map { |line|
+      /^(?<row>[FB]{7})(?<col>[LR]{3})$/ =~ line or raise line
+      row = row.tr('FB', '01').to_i(2)
+      col = col.tr('LR', '01').to_i(2)
+      [row, col]
+    }.group_by(&:first).transform_values { |v| v.map(&:last) }
+
+    seats.each_pair.select { |row, cols|
+      cols.size < 8 and !seats.keys.minmax.include?(row)
+    }.map { |row, cols| [row, *(8.times.to_a - cols)] }.each { |row, col|
+      p row * 8 + col
+    }

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

@@ -0,0 +1,7 @@
+---
+- :name: 6a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: |-
+    p File.read('6.txt').split(/\n{2,}/).sum { |group|
+      group.gsub("\n", "").chars.uniq.size
+    }

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

@@ -0,0 +1,8 @@
+---
+- :name: 6b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: |-
+    p File.read('6.txt').split(/\n{2,}/).sum { |group|
+      persons = group.lines.size
+      group.gsub("\n", "").chars.tally.count { |q,c| c == persons }
+    }

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

@@ -0,0 +1,102 @@
+---
+- :name: 7a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: |-
+    require 'set'
+
+    COLOR = /\w+ \w+/
+    N_BAGS = /(\d+) (#{COLOR}) bags?/
+
+    contain = File.readlines('7.txt', chomp: true).to_h { |line|
+      case line
+      when /^(?<color>#{COLOR}) bags contain no other bags\.$/
+        [$~[:color], []]
+      when /^(?<color>#{COLOR}) bags contain (?<contained>#{N_BAGS}(, #{N_BAGS})*)\.$/
+        [$~[:color], $~[:contained].split(', ').map { |c| c[/^#{N_BAGS}$/, 2] or raise c }]
+      else
+        raise line
+      end
+    }
+
+    expand = Hash.new { |expanded, color|
+      expanded[color] = contain[color].inject(contain[color].to_set) { |all, c|
+        all.merge(expand[c])
+      }
+    }
+
+    p contain.keys.count { |color| expand[color].include?("shiny gold") }
+- :name: 7a_compare.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: |-
+    require_relative 'lib'
+    using Refinements
+
+    COLOR = /\w+ \w+/
+    N_BAGS = /(\d+) (#{COLOR}) bags?/
+
+    contain = File.readlines('7.txt', chomp: true).to_h { |line|
+      case line
+      when /^(?<color>#{COLOR}) bags contain no other bags\.$/
+        [$~[:color], []]
+      when /^(?<color>#{COLOR}) bags contain (?<contained>#{N_BAGS}(, #{N_BAGS})*)\.$/
+        [$~[:color], $~[:contained].split(', ').map { |c| c[/^#{N_BAGS}$/, 2] or raise c }]
+      else
+        raise line
+      end
+    }
+
+    expand = -> original do
+      # fixed point
+      new = original.deep_copy
+      begin
+        old, new = new.freeze, new.deep_copy
+        old.each_pair { |color, contained|
+          all = contained.dup
+          contained.each { |c|
+            all |= old.fetch(c)
+          }
+          new[color] = all
+        }
+      end until old == new
+      new
+    end
+
+    transitive = expand.call(contain)
+    p transitive.each_pair.count { |color, contained| contained.include?("shiny gold") }
+- :name: 7a_fixed_point.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: |-
+    require 'set'
+
+    COLOR = /\w+ \w+/
+    N_BAGS = /(\d+) (#{COLOR}) bags?/
+
+    contain = File.readlines('7.txt', chomp: true).to_h { |line|
+      case line
+      when /^(?<color>#{COLOR}) bags contain no other bags\.$/
+        [$~[:color], []]
+      when /^(?<color>#{COLOR}) bags contain (?<contained>#{N_BAGS}(, #{N_BAGS})*)\.$/
+        [$~[:color], $~[:contained].split(', ').map { |c| c[/^#{N_BAGS}$/, 2] or raise c }.to_set]
+      else
+        raise line
+      end
+    }
+
+    expand = -> original do
+      # fixed point
+      expanded = original.dup.transform_values(&:dup)
+      begin
+        changed = false
+        expanded.each_pair { |color, contained|
+          contained.to_a.each { |c|
+            expanded[c].each { |cc|
+              changed = true if contained.add?(cc)
+            }
+          }
+        }
+      end while changed
+      expanded
+    end
+
+    transitive = expand.call(contain)
+    p transitive.each_pair.count { |color, contained| contained.include?("shiny gold") }

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

@@ -0,0 +1,24 @@
+---
+- :name: 7b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: |-
+    COLOR = /\w+ \w+/
+    N_BAGS = /(\d+) (#{COLOR}) bags?/
+
+    contain = File.readlines('7.txt', chomp: true).to_h { |line|
+      case line
+      when /^(?<color>#{COLOR}) bags contain no other bags\.$/
+        [$~[:color], []]
+      when /^(?<color>#{COLOR}) bags contain (?<contained>#{N_BAGS}(, #{N_BAGS})*)\.$/
+        [$~[:color], $~[:contained].split(', ').to_h { |c|
+          /^#{N_BAGS}$/ =~ c or raise c
+          [$2, Integer($1)]
+        }]
+      else
+        raise line
+      end
+    }
+
+    p Hash.new { |total, color|
+      total[color] = 1 + contain.fetch(color).sum { |c,q| q * total[c] }
+    }["shiny gold"] - 1

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

@@ -0,0 +1,70 @@
+---
+- :name: 8a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: |-
+    instructions = File.readlines('8.txt', chomp: true).map { |line|
+      line.split.then { [_1.to_sym, Integer(_2)] }
+    }
+
+    cpu = Enumerator.produce([0, 0]) { |pc, accumulator|
+      case instructions.fetch(pc)
+      in [:nop, _]
+        [pc + 1, accumulator]
+      in [:acc, n]
+        [pc + 1, accumulator + n]
+      in [:jmp, offset]
+        [pc + offset, accumulator]
+      end
+    }
+
+    visited = [false] * instructions.size
+    p cpu.find { |pc, acc| visited[pc] or (visited[pc] = true and next) }.last
+- :name: 8a_case_when.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: |-
+    instructions = File.readlines('8.txt', chomp: true).map { |line|
+      line.split.then { [_1.to_sym, Integer(_2)] }
+    }
+
+    cpu = Enumerator.produce([0, 0]) { |pc, accumulator|
+      operation, argument = instructions.fetch(pc)
+      case operation
+      when :nop
+        [pc + 1, accumulator]
+      when :acc
+        [pc + 1, accumulator + argument]
+      when :jmp
+        [pc + argument, accumulator]
+      else
+        raise operation
+      end
+    }
+
+    visited = [false] * instructions.size
+    p cpu.find { |pc, acc| visited[pc] or (visited[pc] = true and next) }.last
+- :name: 8a_while.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2020
+  :solution: |-
+    instructions = File.readlines('8.txt', chomp: true).map { |line|
+      line.split.then { [_1.to_sym, Integer(_2)] }
+    }
+
+    visited = [false] * instructions.size
+    pc, accumulator = 0, 0
+
+    until visited[pc]
+      visited[pc] = true
+      operation, argument = instructions.fetch(pc)
+      case operation
+      when :nop
+      when :acc
+        accumulator += argument
+      when :jmp
+        next pc += argument
+      else
+        raise operation
+      end
+      pc += 1
+    end
+
+    p accumulator