advent_of_ruby 0.2.0 → 0.3.0

data/data/solutions/github/ZogStriP/2019/09_2.yml

@@ -0,0 +1,76 @@
+---
+- :name: '09_sensor_boost.rb'
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2019
+  :solution: |-
+    program = DATA.read.split(",").map(&:to_i)
+
+    class IntCode
+
+      def initialize(mem, input: [])
+        @pc = 0
+        @base = 0
+        @input = input
+        @mem = mem.map.with_index { |m, i| [i, m] }.to_h
+        @mem.default = 0
+      end
+
+      def read(address, mode)
+        case mode.to_i
+        when 0 then @mem[@mem[address]]
+        when 1 then @mem[address]
+        when 2 then @mem[@mem[address] + @base]
+        end
+      end
+
+      def write(address, mode, value)
+        case mode.to_i
+        when 0 then @mem[@mem[address]] = value
+        when 2 then @mem[@mem[address] + @base] = value
+        end
+      end
+
+      def run(input = nil)
+        @input.push(input) if input
+
+        loop do
+          mode, opcode = @mem[@pc].divmod(100)
+          m = mode.digits
+          a = read(@pc + 1, m[0])
+          b = read(@pc + 2, m[1])
+
+          case opcode
+          when 1
+            write(@pc + 3, m[2], a + b)
+            @pc += 4
+          when 2
+            write(@pc + 3, m[2], a * b)
+            @pc += 4
+          when 3
+            write(@pc + 1, m[0], @input.shift)
+            @pc += 2
+          when 4
+            @pc += 2
+            return a
+          when 5
+            a != 0 ? @pc = b : @pc += 3
+          when 6
+            a == 0 ? @pc = b : @pc += 3
+          when 7
+            write(@pc + 3, m[2], a < b ? 1 : 0)
+            @pc += 4
+          when 8
+            write(@pc + 3, m[2], a == b ? 1 : 0)
+            @pc += 4
+          when 9
+            @base += a
+            @pc += 2
+          when 99
+            return
+          end
+        end
+      end
+
+    end
+
+    p IntCode.new(program).run(1)
+    p IntCode.new(program).run(2)

data/data/solutions/github/ZogStriP/2019/10_1.yml

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

data/data/solutions/github/ZogStriP/2019/10_2.yml

@@ -0,0 +1,20 @@
+---
+- :name: 10_monitoring_station.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2019
+  :solution: |-
+    map = DATA.read.split("\n").map(&:chars)
+
+    asteroids = [*0...map.size].product([*0...map[0].size]).select { |x, y| map[x][y] == ?# }
+
+    visible = asteroids.map { |x, y|
+      asteroids
+        .reject { |xx, yy| xx == x && yy == y }
+        .sort_by { |xx, yy| (xx - x) ** 2 + (yy - y) ** 2 }
+        .group_by { |xx, yy| -Math.atan2(yy - y, xx - x) }
+    }
+
+    best = visible.max_by(&:size)
+    p best.size
+
+    x, y = best.sort_by(&:first)[199][1][0]
+    p y * 100 + x

data/data/solutions/github/ZogStriP/2019/11_1.yml

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

data/data/solutions/github/ZogStriP/2019/11_2.yml

@@ -0,0 +1,109 @@
+---
+- :name: 11_space_police.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2019
+  :solution: |-
+    program = DATA.read.split(?,).map(&:to_i)
+
+    class IntCode
+
+      def initialize(mem, input: [])
+        @pc = 0
+        @base = 0
+        @input = input
+        @mem = mem.map.with_index { |m, i| [i, m] }.to_h
+        @mem.default = 0
+      end
+
+      def read(address, mode)
+        case mode.to_i
+        when 0 then @mem[@mem[address]]
+        when 1 then @mem[address]
+        when 2 then @mem[@mem[address] + @base]
+        end
+      end
+
+      def write(address, mode, value)
+        case mode.to_i
+        when 0 then @mem[@mem[address]] = value
+        when 2 then @mem[@mem[address] + @base] = value
+        end
+      end
+
+      def run(input = nil)
+        @input.push(input) if input
+
+        loop do
+          mode, opcode = @mem[@pc].divmod(100)
+          m = mode.digits
+          a = read(@pc + 1, m[0])
+          b = read(@pc + 2, m[1])
+
+          case opcode
+          when 1
+            write(@pc + 3, m[2], a + b)
+            @pc += 4
+          when 2
+            write(@pc + 3, m[2], a * b)
+            @pc += 4
+          when 3
+            write(@pc + 1, m[0], @input.shift)
+            @pc += 2
+          when 4
+            @pc += 2
+            return a
+          when 5
+            a != 0 ? @pc = b : @pc += 3
+          when 6
+            a == 0 ? @pc = b : @pc += 3
+          when 7
+            write(@pc + 3, m[2], a < b ? 1 : 0)
+            @pc += 4
+          when 8
+            write(@pc + 3, m[2], a == b ? 1 : 0)
+            @pc += 4
+          when 9
+            @base += a
+            @pc += 2
+          when 99
+            return
+          end
+        end
+      end
+
+    end
+
+    DIR = [
+      [ 0, -1],
+      [ 1,  0],
+      [ 0,  1],
+      [-1,  0],
+    ]
+
+    def paint(program, start_color)
+      d = 0
+      p = [0, 0]
+      grid = Hash.new(0)
+      grid[p] = start_color
+      robot = IntCode.new(program.dup)
+
+      loop {
+        color, dir = robot.run(grid[p]), robot.run
+        break if color.nil? || dir.nil?
+        grid[p] = color
+        d = (dir == 0 ? d - 1 : d + 1) % DIR.size
+        p = [p[0] + DIR[d][0], p[1] + DIR[d][1]]
+      }
+
+      grid
+    end
+
+    p paint(program, 0).keys.size
+
+    grid = paint(program, 1)
+    xs, ys = grid.keys.transpose
+
+    Range.new(*ys.minmax).each { |y|
+      puts Range.new(*xs.minmax).map { |x|
+        grid[[x, y]] == 1 ? "█" : " "
+      }.join
+    }

data/data/solutions/github/ZogStriP/2019/12_1.yml

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

data/data/solutions/github/ZogStriP/2019/12_2.yml

@@ -0,0 +1,28 @@
+---
+- :name: 12_the_n-body_problem.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2019
+  :solution: |-
+    moons = DATA.each_line.map { |l| [l.scan(/-?\d+/).map(&:to_i), [0, 0, 0]] }
+    start = moons.map(&:first).transpose
+
+    1000.times {
+      moons = moons.map { |p, v|
+        vv = v.zip(*moons.map { |pp, _| pp.zip(p).map { |a, b| a <=> b }}).map(&:sum)
+        [p.zip(vv).map(&:sum), vv]
+      }
+    }
+
+    p moons.sum { |p, v| p.sum(&:abs) * v.sum(&:abs) }
+
+    def period(a)
+      v = [0] * a.size
+
+      (1..).each { |t|
+        g = a.map { |b| a.sum { |c| c <=> b }}
+        v = v.zip(g).map(&:sum)
+        a = a.zip(v).map(&:sum)
+        return t * 2 if v.all?(&:zero?)
+      }
+    end
+
+    p start.map { |a| period(a) }.reduce(1, :lcm)

data/data/solutions/github/ZogStriP/2019/13_1.yml

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

data/data/solutions/github/ZogStriP/2019/13_2.yml

@@ -0,0 +1,109 @@
+---
+- :name: 13_care_package.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2019
+  :solution: |-
+    program = DATA.read.split(?,).map(&:to_i)
+
+    class IntCode
+
+      def initialize(mem, input: nil)
+        @pc = 0
+        @base = 0
+        @input = input
+        @mem = mem.map.with_index { |m, i| [i, m] }.to_h
+        @mem.default = 0
+      end
+
+      def read(address, mode)
+        case mode.to_i
+        when 0 then @mem[@mem[address]]
+        when 1 then @mem[address]
+        when 2 then @mem[@mem[address] + @base]
+        end
+      end
+
+      def write(address, mode, value)
+        case mode.to_i
+        when 0 then @mem[@mem[address]] = value
+        when 2 then @mem[@mem[address] + @base] = value
+        end
+      end
+
+      def run
+        loop do
+          mode, opcode = @mem[@pc].divmod(100)
+          m = mode.digits
+          a = read(@pc + 1, m[0])
+          b = read(@pc + 2, m[1])
+
+          case opcode
+          when 1
+            write(@pc + 3, m[2], a + b)
+            @pc += 4
+          when 2
+            write(@pc + 3, m[2], a * b)
+            @pc += 4
+          when 3
+            write(@pc + 1, m[0], @input.call)
+            @pc += 2
+          when 4
+            @pc += 2
+            return a
+          when 5
+            a != 0 ? @pc = b : @pc += 3
+          when 6
+            a == 0 ? @pc = b : @pc += 3
+          when 7
+            write(@pc + 3, m[2], a < b ? 1 : 0)
+            @pc += 4
+          when 8
+            write(@pc + 3, m[2], a == b ? 1 : 0)
+            @pc += 4
+          when 9
+            @base += a
+            @pc += 2
+          when 99
+            return
+          else
+            throw "Unknown opcode: #{opcode}"
+          end
+        end
+      end
+
+    end
+
+    def display(grid)
+      xs, ys = grid.keys.transpose
+      Range.new(*ys.minmax).each { |y|
+        puts Range.new(*xs.minmax).map { |x|
+          case grid[[x, y]]
+          when 0 then " "
+          when 1 then "█"
+          when 2 then "+"
+          when 3 then "="
+          when 4 then "@"
+          end
+        }.join
+      }
+      puts
+    end
+
+    def play(program, quarters)
+      grid = {}
+      ball = paddle = 0
+      program[0] = quarters
+      game = IntCode.new(program, input: ->() { ball <=> paddle })
+
+      loop {
+        x, y, tile = game.run, game.run, game.run
+        break if x.nil? || y.nil? || tile.nil?
+        grid[[x, y]] = tile
+        paddle = x if tile == 3
+        ball = x   if tile == 4
+      }
+
+      grid
+    end
+
+    p play(program, 1).values.count(2)
+    p play(program, 2)[[-1, 0]]

data/data/solutions/github/ZogStriP/2019/14_1.yml

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

data/data/solutions/github/ZogStriP/2019/14_2.yml

@@ -0,0 +1,33 @@
+---
+- :name: 14_space_stoichiometry.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2019
+  :solution: |-
+    ONE_TRILLION = 1_000_000_000_000
+
+    def parse(s)
+      q, n = s.split
+      [q.to_i, n]
+    end
+
+    REACTIONS = DATA.each_line.map { |l|
+      chemicals, product = l.split(" => ")
+      q, n = parse(product)
+      [n, [q, chemicals.split(", ").map { |c| parse(c) }]]
+    }.to_h
+
+    def ore(fuel)
+      c = Hash.new(0)
+      c["FUEL"] = fuel
+
+      while (n, q = c.find { |n, q| n != "ORE" && q > 0 })
+        o = REACTIONS[n][0]
+        t = (1.0 * q / o).ceil
+        c[n] -= o * t
+        REACTIONS[n][1].each { |qq, nn| c[nn] += qq * t }
+      end
+
+      c["ORE"]
+    end
+
+    p ore(1)
+    p (1..).bsearch { |f| ore(f) > ONE_TRILLION } - 1

data/data/solutions/github/ZogStriP/2019/15_1.yml

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

data/data/solutions/github/ZogStriP/2019/15_2.yml

@@ -0,0 +1,126 @@
+---
+- :name: 15_oxygen_system.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2019
+  :solution: |-
+    program = DATA.read.split(?,).map(&:to_i)
+
+    class IntCode
+
+      def initialize(mem, pc: 0, base: 0)
+        @pc = pc
+        @base = base
+        @input = []
+        @mem = Array === mem ? mem.map.with_index { |m, i| [i, m] }.to_h : mem.dup
+        @mem.default = 0
+      end
+
+      def read(address, mode)
+        case mode.to_i
+        when 0 then @mem[@mem[address]]
+        when 1 then @mem[address]
+        when 2 then @mem[@mem[address] + @base]
+        end
+      end
+
+      def write(address, mode, value)
+        case mode.to_i
+        when 0 then @mem[@mem[address]] = value
+        when 2 then @mem[@mem[address] + @base] = value
+        end
+      end
+
+      def run(input = nil)
+        @input.push(input) if input
+
+        loop do
+          mode, opcode = @mem[@pc].divmod(100)
+          m = mode.digits
+          a = read(@pc + 1, m[0])
+          b = read(@pc + 2, m[1])
+
+          case opcode
+          when 1
+            write(@pc + 3, m[2], a + b)
+            @pc += 4
+          when 2
+            write(@pc + 3, m[2], a * b)
+            @pc += 4
+          when 3
+            write(@pc + 1, m[0], @input.shift)
+            @pc += 2
+          when 4
+            @pc += 2
+            return a
+          when 5
+            a != 0 ? @pc = b : @pc += 3
+          when 6
+            a == 0 ? @pc = b : @pc += 3
+          when 7
+            write(@pc + 3, m[2], a < b ? 1 : 0)
+            @pc += 4
+          when 8
+            write(@pc + 3, m[2], a == b ? 1 : 0)
+            @pc += 4
+          when 9
+            @base += a
+            @pc += 2
+          when 99
+            return
+          else
+            throw "Unknown opcode: #{opcode}"
+          end
+        end
+      end
+
+      def clone
+        self.class.new(@mem, pc: @pc, base: @base)
+      end
+
+    end
+
+    START = [0, 0]
+
+    DIR = [
+      nil,
+      [ 0,  1], # north
+      [ 0, -1], # south
+      [-1,  0], # west
+      [ 1,  0], # east
+    ]
+
+    def explore(program)
+      grid = { START => 1 }
+      queue = [START]
+      droids = { START => IntCode.new(program) }
+
+      while c = queue.pop
+        (1..4).each { |d|
+          p = [c[0] + DIR[d][0], c[1] + DIR[d][1]]
+          next if grid[p]
+          grid[p] = (droids[p] ||= droids[c].clone).run(d)
+          queue << p if grid[p] > 0
+        }
+      end
+
+      grid
+    end
+
+    def distances(grid, start)
+      dists = { start => 0 }
+      queue = [start]
+
+      while c = queue.pop
+        (1..4)
+          .map { |d| [c[0] + DIR[d][0], c[1] + DIR[d][1]] }
+          .select { |p| grid[p] > 0 && !dists[p] }
+          .each { |p| dists[p] = dists[c] + 1; queue << p }
+      end
+
+      dists
+    end
+
+    grid = explore(program)
+    oxygen = grid.find { |_, v| v == 2 }[0]
+
+    p distances(grid, START)[oxygen]
+    p distances(grid, oxygen).values.max

data/data/solutions/github/ZogStriP/2019/16_1.yml

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

data/data/solutions/github/ZogStriP/2019/16_2.yml

@@ -0,0 +1,32 @@
+---
+- :name: 16_flawed_frequency_transmission.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2019
+  :solution: |-
+    signal  = DATA.read.strip.chars.map(&:to_i)
+    offset  = signal.take(7).join.to_i
+    message = (signal * 10_000).drop(offset)
+
+    def fft(s)
+      s.size.times { |i|
+        sum = [0, 0]
+        len = i + 1
+
+        (i..s.size).step(len * 2).each.with_index { |o, d|
+          sum[d % 2] += s[o, len].sum
+        }
+
+        s[i] = (sum[0] - sum[1]).abs % 10
+      }
+    end
+
+    100.times { fft(signal) }
+    puts signal.take(8).join
+
+    def fftt(s)
+      (s.size - 1).downto(0).each { |i|
+        s[i] = ((s[i + 1] || 0) + s[i]) % 10
+      }
+    end
+
+    100.times { fftt(message) }
+    puts message.take(8).join

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

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

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

@@ -0,0 +1,139 @@
+---
+- :name: 17_set_and_forget.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2019
+  :solution: |-
+    require "set"
+    require "matrix"
+
+    program = DATA.read.split(?,).map(&:to_i)
+
+    class IntCode
+
+      def initialize(mem, input = [])
+        @pc = 0
+        @base = 0
+        @input = input
+        @mem = mem.map.with_index { |m, i| [i, m] }.to_h
+        @mem.default = 0
+      end
+
+      def read(address, mode)
+        case mode.to_i
+        when 0 then @mem[@mem[address]]
+        when 1 then @mem[address]
+        when 2 then @mem[@mem[address] + @base]
+        end
+      end
+
+      def write(address, mode, value)
+        case mode.to_i
+        when 0 then @mem[@mem[address]] = value
+        when 2 then @mem[@mem[address] + @base] = value
+        end
+      end
+
+      def run
+        loop do
+          mode, opcode = @mem[@pc].divmod(100)
+          m = mode.digits
+          a = read(@pc + 1, m[0])
+          b = read(@pc + 2, m[1])
+
+          case opcode
+          when 1
+            write(@pc + 3, m[2], a + b)
+            @pc += 4
+          when 2
+            write(@pc + 3, m[2], a * b)
+            @pc += 4
+          when 3
+            write(@pc + 1, m[0], @input.shift)
+            @pc += 2
+          when 4
+            @pc += 2
+            return a
+          when 5
+            a != 0 ? @pc = b : @pc += 3
+          when 6
+            a == 0 ? @pc = b : @pc += 3
+          when 7
+            write(@pc + 3, m[2], a < b ? 1 : 0)
+            @pc += 4
+          when 8
+            write(@pc + 3, m[2], a == b ? 1 : 0)
+            @pc += 4
+          when 9
+            @base += a
+            @pc += 2
+          when 99
+            return
+          else
+            throw "Unknown opcode: #{opcode}"
+          end
+        end
+      end
+
+    end
+
+    ROBOTS = "^>v<"
+
+    DIRS = [
+      Vector[ 0, -1],
+      Vector[ 1,  0],
+      Vector[ 0,  1],
+      Vector[-1,  0],
+    ]
+
+    map = ""
+    ascii = IntCode.new(program)
+
+    while o = ascii.run
+      map << o.chr
+    end
+
+    grid = map.split("\n").flat_map.with_index { |r, y|
+      r.chars.map.with_index { |c, x|
+        [Vector[x, y], c]
+      }
+    }.to_h
+
+    p grid.select { |k, v| v == ?# && DIRS.all? { |n| grid[k + n] == ?# }}.sum { |k, _| k[0] * k[1] }
+
+    path = ""
+    pos, robot = grid.find { |_, v| ROBOTS[v] }
+    dir = DIRS[ROBOTS.index(robot)]
+
+    left  = -> (p) { Vector[p[1], -p[0]] }
+    right = -> (p) { Vector[-p[1], p[0]] }
+    steps = -> (p, d) { (1..).find { |s| grid[p + d * s] != ?# } - 1 }
+
+    loop {
+      if grid[pos + left[dir]] == ?#
+        dir = left[dir]
+        s = steps[pos, dir]
+        pos += dir * s
+        path << ?L << s.to_s
+      elsif grid[pos + right[dir]] == ?#
+        dir = right[dir]
+        s = steps[pos, dir]
+        pos += dir * s
+        path << ?R << s.to_s
+      else
+        break
+      end
+    }
+
+    a, b, c = /^(.{1,11})\1*(.{1,11})(?:\1|\2)*(.{1,11})(?:\1|\2|\3)*$/.match(path).captures
+    m = path.gsub(a, ?A).gsub(b, ?B).gsub(c, ?C)
+    v = ?n
+
+    input = [m, a, b, c, v].flat_map { |i|
+      i.scan(/[a-z]|\d+/i).join(?,).bytes << 10
+    }
+
+    program[0] = 2
+    ascii = IntCode.new(program, input)
+
+    while o = ascii.run
+      p o if o > 255
+    end

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

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