aboutsummaryrefslogtreecommitdiff
path: root/day17/part1
blob: a8dc6eeb036794655fc8fe7cd84e3ea818f46911 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
#!/usr/bin/env ruby

class Machine
  def initialize(starting_memory = [])
    @mem = starting_memory
    @pc = 0
    @halt = false
    @buffered_input = []
    @buffered_output = []
    @relative_base = 0
  end

  def mem(start = 0, len = @mem.length)
    @mem[start...(start + len)]
  end

  def halt!
    @halt = true
  end

  def halt?
    @halt
  end

  def buffer_input(x)
    if x.is_a?(Array) then
      @buffered_input += x
    else
      @buffered_input.push(x)
    end
  end

  def buffered_output(flush = false)
    t = @buffered_output
    @buffered_output = [] if flush
    t
  end

  def step
    return if halt?

    opcode = @mem[@pc] % 100

    if opcode == 99 then
      halt!
      @pc += 1
      return
    end

    p3, p2, p1 = ("%03d" % (@mem[@pc] / 100)).chars

    l1w, l1r = get(p1, 1)
    l2w, l2r = get(p2, 2) if [1,2,5,6,7,8].include?(opcode)
    l3w, l3r = get(p3, 3) if [1,2,7,8].include?(opcode)

    case opcode
    when 1
      @mem[l3w] = l1r + l2r
      @pc += 4
    when 2
      @mem[l3w] = l1r * l2r
      @pc += 4
    when 3
      @mem[l1w] = @buffered_input.shift
      @pc += 2
    when 4
      @buffered_output.push(l1r)
      @pc += 2
    when 5
      @pc = (l1r != 0 ? l2r : @pc + 3)
    when 6
      @pc = (l1r == 0 ? l2r : @pc + 3)
    when 7
      @mem[l3w] = (l1r < l2r ? 1 : 0)
      @pc += 4
    when 8
      @mem[l3w] = (l1r == l2r ? 1 : 0)
      @pc += 4
    when 9
      @relative_base += l1r
      @pc += 2
    end
  end

  def run
    until halt? do
      step
    end
  end

  private

  def get(p, a)
    w = case p
        when "0"
          @mem[@pc + a]
        when "2"
          @relative_base + @mem[@pc + a]
        end
    r = case p
        when "0"
          @mem[@mem[@pc + a]]
        when "1"
          @mem[@pc + a]
        when "2"
          @mem[@relative_base + @mem[@pc + a]]
        end
    [w, r || 0]
  end
end

input = $stdin.readlines[0].strip.split(",").map(&:to_i)

m = Machine.new(input)
m.run
grid = m.buffered_output.map(&:chr).join.lines.map(&:strip).map(&:chars).reject(&:empty?)
scaffs = []

grid.length.times do |r|
  grid[0].length.times do |c|
    scaffs << [c, r] unless grid[r][c] == "."
  end
end

def count_vert(x, y, s)
  c = 0
  c += 1 if s.include?([x, y-1])
  c += 1 if s.include?([x, y+1])
  c
end

def count_horz(x, y, s)
  c = 0
  c += 1 if s.include?([x-1, y])
  c += 1 if s.include?([x+1, y])
  c
end

def intersection?(x, y, s)
  cv = count_vert(x, y, s)
  ch = count_horz(x, y, s)
  [[1, 2], [2, 1], [2, 2]].include?([cv, ch])
end

inters = scaffs.select { |x, y| intersection?(x, y, scaffs) }

puts inters.map{ |a,b| a * b }.sum