-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathintcode.py
executable file
·239 lines (210 loc) · 8.07 KB
/
intcode.py
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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
#!/usr/bin/env python3
"""
Advent of Code 2019 'Intcode' interpreter with tracing.
Feature Level: 7.2 (day.part)
"""
import sys
import itertools, collections
import argparse
import fnmatch
g_DefaultTracing = False
g_Code = []
def fmt_addr(x): return "{:5d}".format(x)
def fmt_data(x): return "{:10d}".format(x)
def fmt_marg(x): return "{:6d}".format(x)
def fmt_larg(x): return "#{}".format(x).rjust(6)
def fmt_opcode(x): return "{:05d}".format(x)
def fmt_opname(x): return "{:<5s}".format(x)
LONGEST_ARG = 6
MAX_NUM_ARGS = 3
OP_COLUMN_WIDTH = LONGEST_ARG * MAX_NUM_ARGS + 2 * (MAX_NUM_ARGS - 1)
class Operation:
def __init__(self, name, params=0, mem_inputs=[], mem_outputs=[], func=None, force_tracing=False):
self.name = name
self.params = params
self.inputs = set(mem_inputs)
self.outputs = set(mem_outputs)
self.func = func
self.force_tracing = force_tracing
class Machine:
ops = {
1: Operation("add", 3, [1,2], [3], lambda m,o,i: i[1] + i[2]),
2: Operation("mul", 3, [1,2], [3], lambda m,o,i: i[1] * i[2]),
3: Operation("in", 1, [], [1], lambda m,o,i: m.inq.pop(0) if m.inq else m.rollback()),
4: Operation("out", 1, [1], [], lambda m,o,i: m.outq.append(i[1])),
5: Operation("jnz", 2, [1,2], [0], lambda m,o,i: i[2] if i[1] else m.ip),
6: Operation("jz", 2, [1,2], [0], lambda m,o,i: m.ip if i[1] else i[2]),
7: Operation("cmplt", 3, [1,2], [3], lambda m,o,i: i[1] < i[2]),
8: Operation("cmpeq", 3, [1,2], [3], lambda m,o,i: i[1] == i[2]),
99: Operation("halt", func=lambda m,o,i: m.halt()),
}
def __init__(self, code=None, name="", inputs=[], overrides={}, tracing=None):
if code is None:
code = g_Code
if isinstance(code, dict):
self.M = code.copy()
else:
self.M = collections.defaultdict(int, dict(zip(itertools.count(), code)))
self.M.update(overrides)
self.prefix = ("<{}> ".format(name)) if name else ""
self.running = True
self.halted = False
self.tracing = g_DefaultTracing if (tracing is None) else tracing
self.ip = self.last_ip = 0
self.inq = list(inputs)
self.outq = []
def rollback(self):
self.running = False
self.ip = self.last_ip
def halt(self):
self.running = False
self.halted = True
def send(self, *data):
if len(data) == 1 and not isinstance(data[0], int):
data = data[0]
self.inq.extend(data)
def step(self):
try:
opcode = self.M[self.ip]
op = self.ops[opcode % 100]
except KeyError:
op = Operation("#INV", func=lambda m,o,i: m.halt(), force_tracing=True)
digits = list(map(int, str(opcode)))[::-1] + [0] * (op.params + 2)
raw_args = [self.M[self.ip + i] for i in range(op.params + 1)]
mem_args = [(a if (not(i) or digits[i+1]) else self.M[a]) for i, a in enumerate(raw_args)]
if self.tracing or op.force_tracing:
line = self.prefix \
+ fmt_addr(self.ip) + ": " \
+ fmt_opcode(opcode) + " > " \
+ fmt_opname(op.name) + " " \
+ ", ".join(fmt_larg(a) if l else fmt_marg(a) for a,l in zip(raw_args[1:], digits[2:])).ljust(OP_COLUMN_WIDTH)
inputs = [(m if (i in op.inputs) else r) for r,m,i in zip(raw_args, mem_args, range(op.params + 1))]
self.last_ip = self.ip
self.ip += op.params + 1
res = op.func(self, op, inputs)
if res is not None:
if isinstance(res, (int, bool)):
res = [res]
for i, v in zip(sorted(op.outputs), res):
if i:
self.M[raw_args[i]] = int(v)
elif self.running: # don't clobber IP after rollback!
self.ip = int(v)
if self.tracing or op.force_tracing:
for i in range(1, op.params + 1):
if ((i in op.inputs) and not digits[i+1]) or (i in op.outputs):
line += " | " + fmt_addr(raw_args[i]) + ": " + fmt_data(mem_args[i])
if i in op.outputs:
line += " -> " + fmt_data(self.M[raw_args[i]])
if 0 in op.outputs:
line += " | new ip: " + fmt_addr(self.ip)
print(line, file=sys.stderr)
def run(self, *data):
"""
send data into the output queue
and run until next output is sent and return it,
or None if a halt instruction occurred or the input buffer ran under
"""
self.send(*data)
self.running = True
while self.running and not self.outq:
self.step()
if self.outq:
return self.outq.pop(0)
###############################################################################
Puzzles = []
def puzzle(fn):
Puzzles.append((fn.__name__.strip('_').replace('_', '.'), fn))
return fn
@puzzle
def _2_1():
m = Machine(overrides={1:12, 2:2})
assert m.run() is None
print(m.M[0])
@puzzle
def _2_2():
for nv in range(10000):
m = Machine(overrides={1:nv//100, 2:nv%100})
assert m.run() is None
if m.M[0] == 19690720:
print(nv)
break
@puzzle
def _5_1():
m = Machine(inputs=[1])
r = 0
while r == 0:
r = m.run()
assert m.run() is None
print(r)
@puzzle
def _5_2():
m = Machine(inputs=[5])
r = m.run()
assert m.run() is None
print(r)
@puzzle
def _7_1():
def test(phases):
x = 0
for name, phase in zip("ABCDE", phases):
x = Machine(inputs=[phase, x], name=name).run()
return x
print(max(map(test, itertools.permutations(range(5)))))
@puzzle
def _7_2():
def test(phases):
machines = [Machine(inputs=[phase], name=name) for name, phase in zip("ABCDE", phases)]
x = 0
for m in itertools.cycle(machines):
r = m.run(x)
if r is None:
break
x = r
return x
print(max(map(test, itertools.permutations(range(5,10)))))
###############################################################################
if __name__ == "__main__":
parser = argparse.ArgumentParser()
parser.add_argument("puzzles", metavar="PUZZLE", nargs='*',
help="select a puzzle to solve (choices: {})".format(', '.join(n for n,f in Puzzles)))
parser.add_argument("-f", "--file", metavar="FILE", default="input.txt",
help="intcode file to run")
parser.add_argument("-i", "--inputs", metavar="VALUES",
help="input values to use")
parser.add_argument("-v", "--verbose", action='store_true',
help="trace execution even if running a puzzle")
parser.add_argument("-q", "--quiet", action='store_true',
help="don't trace execution")
parser.add_argument("--vn", metavar="NOUN,VERB",
help="initial values of memory locations 1 and 2")
args = parser.parse_args()
g_DefaultTracing = bool(args.verbose)
g_Code = list(map(int, open(args.file).read().replace(',', ' ').split()))
if args.puzzles:
ok = False
for name, fn in Puzzles:
if any(fnmatch.fnmatch(name, pat) for pat in args.puzzles):
ok = True
fn()
if not ok:
parser.error("no matching puzzle")
else:
m = Machine(
inputs = map(int, args.inputs.replace(',', ' ').split()) if args.inputs else [],
overrides = dict(zip(itertools.count(1), map(int, args.vn.replace(',', ' ').split()))) if args.vn else {},
tracing = g_DefaultTracing or not(args.quiet),
)
have_out = False
while True:
out = m.run()
if out is not None:
print(out)
have_out = True
elif m.halted:
if not have_out:
print("M[0] =", m.M[0])
break
else:
print("Input queue underflow.")
break