|
@@ -0,0 +1,461 @@
|
|
1
|
+use std::collections::HashMap;
|
|
2
|
+use std::convert::TryFrom;
|
|
3
|
+use std::error::Error;
|
|
4
|
+use std::fs::File;
|
|
5
|
+use std::io::prelude::*;
|
|
6
|
+use std::result;
|
|
7
|
+use std::str::FromStr;
|
|
8
|
+
|
|
9
|
+use num_enum::TryFromPrimitive;
|
|
10
|
+
|
|
11
|
+type Result<T> = result::Result<T, Box<dyn Error>>;
|
|
12
|
+
|
|
13
|
+#[derive(Debug, Clone, PartialEq)]
|
|
14
|
+pub struct Intcode {
|
|
15
|
+ pub integers: HashMap<usize, i64>,
|
|
16
|
+ pub pointer: usize,
|
|
17
|
+ pub halted: bool,
|
|
18
|
+ pub relative_base: i64,
|
|
19
|
+}
|
|
20
|
+
|
|
21
|
+#[derive(Debug, PartialEq)]
|
|
22
|
+pub struct Instruction {
|
|
23
|
+ opcode: Opcode,
|
|
24
|
+ parameter_modes: Vec<ParameterMode>,
|
|
25
|
+}
|
|
26
|
+
|
|
27
|
+impl TryFrom<i64> for Instruction {
|
|
28
|
+ type Error = Box<dyn Error>;
|
|
29
|
+
|
|
30
|
+ fn try_from(integer: i64) -> Result<Self> {
|
|
31
|
+ let opcode: Opcode = Opcode::try_from((integer % 100) as u8)?;
|
|
32
|
+ let modes_integer = integer / 100;
|
|
33
|
+ let mut parameter_modes = vec![];
|
|
34
|
+ for parameter_index in 0..opcode.parameter_count() {
|
|
35
|
+ parameter_modes.push(ParameterMode::try_from(
|
|
36
|
+ (modes_integer % (10_i64.pow(parameter_index + 1)) / 10_i64.pow(parameter_index))
|
|
37
|
+ as u8,
|
|
38
|
+ )?)
|
|
39
|
+ }
|
|
40
|
+ Ok(Instruction {
|
|
41
|
+ opcode,
|
|
42
|
+ parameter_modes,
|
|
43
|
+ })
|
|
44
|
+ }
|
|
45
|
+}
|
|
46
|
+
|
|
47
|
+#[derive(Debug, PartialEq, TryFromPrimitive)]
|
|
48
|
+#[repr(u8)]
|
|
49
|
+pub enum Opcode {
|
|
50
|
+ Add = 1,
|
|
51
|
+ Mult = 2,
|
|
52
|
+ Input = 3,
|
|
53
|
+ Output = 4,
|
|
54
|
+ JumpIfTrue = 5,
|
|
55
|
+ JumpIfFalse = 6,
|
|
56
|
+ LessThan = 7,
|
|
57
|
+ Equals = 8,
|
|
58
|
+ RelativeBaseOffset = 9,
|
|
59
|
+ Halt = 99,
|
|
60
|
+}
|
|
61
|
+
|
|
62
|
+impl Opcode {
|
|
63
|
+ pub fn parameter_count(&self) -> u32 {
|
|
64
|
+ match self {
|
|
65
|
+ Opcode::Add => 3,
|
|
66
|
+ Opcode::Mult => 3,
|
|
67
|
+ Opcode::Input => 1,
|
|
68
|
+ Opcode::Output => 1,
|
|
69
|
+ Opcode::JumpIfTrue => 2,
|
|
70
|
+ Opcode::JumpIfFalse => 2,
|
|
71
|
+ Opcode::LessThan => 3,
|
|
72
|
+ Opcode::Equals => 3,
|
|
73
|
+ Opcode::RelativeBaseOffset => 1,
|
|
74
|
+ Opcode::Halt => 0,
|
|
75
|
+ }
|
|
76
|
+ }
|
|
77
|
+
|
|
78
|
+ pub fn target_parameter_index(&self) -> Option<usize> {
|
|
79
|
+ match self {
|
|
80
|
+ Opcode::Add => Some(2),
|
|
81
|
+ Opcode::Mult => Some(2),
|
|
82
|
+ Opcode::Input => Some(0),
|
|
83
|
+ Opcode::Output => None,
|
|
84
|
+ Opcode::JumpIfTrue => None,
|
|
85
|
+ Opcode::JumpIfFalse => None,
|
|
86
|
+ Opcode::LessThan => Some(2),
|
|
87
|
+ Opcode::Equals => Some(2),
|
|
88
|
+ Opcode::RelativeBaseOffset => None,
|
|
89
|
+ Opcode::Halt => None,
|
|
90
|
+ }
|
|
91
|
+ }
|
|
92
|
+}
|
|
93
|
+
|
|
94
|
+#[derive(Debug, PartialEq, TryFromPrimitive)]
|
|
95
|
+#[repr(u8)]
|
|
96
|
+pub enum ParameterMode {
|
|
97
|
+ Position = 0,
|
|
98
|
+ Immediate = 1,
|
|
99
|
+ Relative = 2,
|
|
100
|
+}
|
|
101
|
+
|
|
102
|
+impl FromStr for Intcode {
|
|
103
|
+ type Err = Box<dyn Error>;
|
|
104
|
+
|
|
105
|
+ fn from_str(s: &str) -> Result<Intcode> {
|
|
106
|
+ let intcode_string = s.trim().to_string();
|
|
107
|
+ let mut integers = HashMap::new();
|
|
108
|
+ for (index, code) in intcode_string.split(',').enumerate() {
|
|
109
|
+ integers.insert(index, code.parse().unwrap());
|
|
110
|
+ }
|
|
111
|
+
|
|
112
|
+ Ok(Intcode::new(integers))
|
|
113
|
+ }
|
|
114
|
+}
|
|
115
|
+
|
|
116
|
+impl Intcode {
|
|
117
|
+ fn new(integers: HashMap<usize, i64>) -> Intcode {
|
|
118
|
+ Intcode {
|
|
119
|
+ integers,
|
|
120
|
+ pointer: 0,
|
|
121
|
+ halted: false,
|
|
122
|
+ relative_base: 0,
|
|
123
|
+ }
|
|
124
|
+ }
|
|
125
|
+
|
|
126
|
+ fn load_parameters(&mut self, pointer: usize, instruction: &Instruction) -> Vec<i64> {
|
|
127
|
+ (0..instruction.opcode.parameter_count() as usize)
|
|
128
|
+ .map(|parameter_index| {
|
|
129
|
+ let mut integer = *self
|
|
130
|
+ .integers
|
|
131
|
+ .entry(pointer + parameter_index + 1)
|
|
132
|
+ .or_insert(0);
|
|
133
|
+ match instruction.parameter_modes[parameter_index] {
|
|
134
|
+ ParameterMode::Position => match instruction.opcode.target_parameter_index() {
|
|
135
|
+ Some(target_parameter_index)
|
|
136
|
+ if target_parameter_index == parameter_index => {}
|
|
137
|
+ _ => {
|
|
138
|
+ integer = *self.integers.entry(integer as usize).or_insert(0);
|
|
139
|
+ }
|
|
140
|
+ },
|
|
141
|
+ ParameterMode::Relative => match instruction.opcode.target_parameter_index() {
|
|
142
|
+ Some(target_parameter_index)
|
|
143
|
+ if target_parameter_index == parameter_index =>
|
|
144
|
+ {
|
|
145
|
+ integer += self.relative_base;
|
|
146
|
+ }
|
|
147
|
+ _ => {
|
|
148
|
+ integer = *self
|
|
149
|
+ .integers
|
|
150
|
+ .entry((self.relative_base + integer) as usize)
|
|
151
|
+ .or_insert(0);
|
|
152
|
+ }
|
|
153
|
+ },
|
|
154
|
+ _ => {}
|
|
155
|
+ }
|
|
156
|
+ integer
|
|
157
|
+ })
|
|
158
|
+ .collect()
|
|
159
|
+ }
|
|
160
|
+
|
|
161
|
+ pub fn execute(&mut self, inputs: &[i64]) -> Result<Vec<i64>> {
|
|
162
|
+ let mut input_index = 0;
|
|
163
|
+ let mut output = vec![];
|
|
164
|
+
|
|
165
|
+ loop {
|
|
166
|
+ let instruction =
|
|
167
|
+ Instruction::try_from(*self.integers.entry(self.pointer).or_insert(0))?;
|
|
168
|
+ let parameters = self.load_parameters(self.pointer, &instruction);
|
|
169
|
+ let mut jump_pointer: Option<usize> = None;
|
|
170
|
+
|
|
171
|
+ match instruction.opcode {
|
|
172
|
+ Opcode::Add => {
|
|
173
|
+ self.integers
|
|
174
|
+ .insert(parameters[2] as usize, parameters[0] + parameters[1]);
|
|
175
|
+ }
|
|
176
|
+ Opcode::Mult => {
|
|
177
|
+ self.integers
|
|
178
|
+ .insert(parameters[2] as usize, parameters[0] * parameters[1]);
|
|
179
|
+ }
|
|
180
|
+ Opcode::Input => {
|
|
181
|
+ if input_index >= inputs.len() {
|
|
182
|
+ break; // pause execution to wait for more input
|
|
183
|
+ }
|
|
184
|
+ self.integers
|
|
185
|
+ .insert(parameters[0] as usize, inputs[input_index]);
|
|
186
|
+ input_index += 1;
|
|
187
|
+ }
|
|
188
|
+ Opcode::Output => {
|
|
189
|
+ output.push(parameters[0]);
|
|
190
|
+ }
|
|
191
|
+ Opcode::JumpIfTrue => {
|
|
192
|
+ if parameters[0] != 0 {
|
|
193
|
+ jump_pointer = Some(parameters[1] as usize);
|
|
194
|
+ }
|
|
195
|
+ }
|
|
196
|
+ Opcode::JumpIfFalse => {
|
|
197
|
+ if parameters[0] == 0 {
|
|
198
|
+ jump_pointer = Some(parameters[1] as usize);
|
|
199
|
+ }
|
|
200
|
+ }
|
|
201
|
+ Opcode::LessThan => {
|
|
202
|
+ if parameters[0] < parameters[1] {
|
|
203
|
+ self.integers.insert(parameters[2] as usize, 1);
|
|
204
|
+ } else {
|
|
205
|
+ self.integers.insert(parameters[2] as usize, 0);
|
|
206
|
+ }
|
|
207
|
+ }
|
|
208
|
+ Opcode::Equals => {
|
|
209
|
+ if parameters[0] == parameters[1] {
|
|
210
|
+ self.integers.insert(parameters[2] as usize, 1);
|
|
211
|
+ } else {
|
|
212
|
+ self.integers.insert(parameters[2] as usize, 0);
|
|
213
|
+ }
|
|
214
|
+ }
|
|
215
|
+ Opcode::RelativeBaseOffset => {
|
|
216
|
+ self.relative_base += parameters[0];
|
|
217
|
+ }
|
|
218
|
+ Opcode::Halt => {
|
|
219
|
+ self.halted = true;
|
|
220
|
+ break;
|
|
221
|
+ }
|
|
222
|
+ }
|
|
223
|
+
|
|
224
|
+ match jump_pointer {
|
|
225
|
+ Some(jump_pointer) => self.pointer = jump_pointer,
|
|
226
|
+ None => self.pointer += 1 + instruction.opcode.parameter_count() as usize,
|
|
227
|
+ }
|
|
228
|
+ }
|
|
229
|
+
|
|
230
|
+ Ok(output)
|
|
231
|
+ }
|
|
232
|
+}
|
|
233
|
+
|
|
234
|
+pub fn read_intcode(filename: &str) -> Result<Intcode> {
|
|
235
|
+ let mut file = File::open(filename)?;
|
|
236
|
+ let mut intcode_string = String::new();
|
|
237
|
+ file.read_to_string(&mut intcode_string)?;
|
|
238
|
+
|
|
239
|
+ Ok(intcode_string.parse()?)
|
|
240
|
+}
|
|
241
|
+
|
|
242
|
+#[cfg(test)]
|
|
243
|
+mod tests {
|
|
244
|
+ use super::*;
|
|
245
|
+
|
|
246
|
+ const TEST_INPUT: &str = "input/test1.txt";
|
|
247
|
+
|
|
248
|
+ #[test]
|
|
249
|
+ fn reads_intcode() {
|
|
250
|
+ assert_eq!(
|
|
251
|
+ read_intcode(TEST_INPUT).unwrap(),
|
|
252
|
+ Intcode::new(
|
|
253
|
+ vec![3, 15, 3, 16, 1002, 16, 10, 16, 1, 16, 15, 15, 4, 15, 99, 0, 0]
|
|
254
|
+ .into_iter()
|
|
255
|
+ .enumerate()
|
|
256
|
+ .collect()
|
|
257
|
+ ),
|
|
258
|
+ );
|
|
259
|
+ }
|
|
260
|
+
|
|
261
|
+ #[test]
|
|
262
|
+ fn converts_integer_to_instruction() {
|
|
263
|
+ assert_eq!(
|
|
264
|
+ Instruction::try_from(1002).unwrap(),
|
|
265
|
+ Instruction {
|
|
266
|
+ opcode: Opcode::Mult,
|
|
267
|
+ parameter_modes: vec![
|
|
268
|
+ ParameterMode::Position,
|
|
269
|
+ ParameterMode::Immediate,
|
|
270
|
+ ParameterMode::Position
|
|
271
|
+ ],
|
|
272
|
+ }
|
|
273
|
+ );
|
|
274
|
+
|
|
275
|
+ assert_eq!(
|
|
276
|
+ Instruction::try_from(101).unwrap(),
|
|
277
|
+ Instruction {
|
|
278
|
+ opcode: Opcode::Add,
|
|
279
|
+ parameter_modes: vec![
|
|
280
|
+ ParameterMode::Immediate,
|
|
281
|
+ ParameterMode::Position,
|
|
282
|
+ ParameterMode::Position
|
|
283
|
+ ],
|
|
284
|
+ }
|
|
285
|
+ );
|
|
286
|
+ }
|
|
287
|
+
|
|
288
|
+ #[test]
|
|
289
|
+ fn executes_intcodes() {
|
|
290
|
+ let mut intcode = Intcode::new(vec![1, 0, 0, 0, 99].into_iter().enumerate().collect());
|
|
291
|
+ intcode.execute(&[0]).unwrap();
|
|
292
|
+ assert_eq!(
|
|
293
|
+ intcode.integers,
|
|
294
|
+ vec![2, 0, 0, 0, 99].into_iter().enumerate().collect()
|
|
295
|
+ );
|
|
296
|
+
|
|
297
|
+ let mut intcode = Intcode::new(vec![2, 3, 0, 3, 99].into_iter().enumerate().collect());
|
|
298
|
+ intcode.execute(&[0]).unwrap();
|
|
299
|
+ assert_eq!(
|
|
300
|
+ intcode.integers,
|
|
301
|
+ vec![2, 3, 0, 6, 99].into_iter().enumerate().collect()
|
|
302
|
+ );
|
|
303
|
+
|
|
304
|
+ let mut intcode = Intcode::new(vec![2, 4, 4, 5, 99, 0].into_iter().enumerate().collect());
|
|
305
|
+ intcode.execute(&[0]).unwrap();
|
|
306
|
+ assert_eq!(
|
|
307
|
+ intcode.integers,
|
|
308
|
+ vec![2, 4, 4, 5, 99, 9801].into_iter().enumerate().collect()
|
|
309
|
+ );
|
|
310
|
+
|
|
311
|
+ let mut intcode = Intcode::new(
|
|
312
|
+ vec![1, 1, 1, 4, 99, 5, 6, 0, 99]
|
|
313
|
+ .into_iter()
|
|
314
|
+ .enumerate()
|
|
315
|
+ .collect(),
|
|
316
|
+ );
|
|
317
|
+ intcode.execute(&[0]).unwrap();
|
|
318
|
+ assert_eq!(
|
|
319
|
+ intcode.integers,
|
|
320
|
+ vec![30, 1, 1, 4, 2, 5, 6, 0, 99]
|
|
321
|
+ .into_iter()
|
|
322
|
+ .enumerate()
|
|
323
|
+ .collect()
|
|
324
|
+ );
|
|
325
|
+
|
|
326
|
+ let mut intcode = Intcode::new(
|
|
327
|
+ vec![1, 9, 10, 3, 2, 3, 11, 0, 99, 30, 40, 50]
|
|
328
|
+ .into_iter()
|
|
329
|
+ .enumerate()
|
|
330
|
+ .collect(),
|
|
331
|
+ );
|
|
332
|
+ intcode.execute(&[0]).unwrap();
|
|
333
|
+ assert_eq!(
|
|
334
|
+ intcode.integers,
|
|
335
|
+ vec![3500, 9, 10, 70, 2, 3, 11, 0, 99, 30, 40, 50]
|
|
336
|
+ .into_iter()
|
|
337
|
+ .enumerate()
|
|
338
|
+ .collect()
|
|
339
|
+ );
|
|
340
|
+ }
|
|
341
|
+
|
|
342
|
+ #[test]
|
|
343
|
+ fn less_and_equal_outputs() {
|
|
344
|
+ let intcode = Intcode::new(
|
|
345
|
+ vec![3, 9, 8, 9, 10, 9, 4, 9, 99, -1, 8]
|
|
346
|
+ .into_iter()
|
|
347
|
+ .enumerate()
|
|
348
|
+ .collect(),
|
|
349
|
+ );
|
|
350
|
+ assert_eq!(intcode.clone().execute(&[8]).unwrap(), vec![1]);
|
|
351
|
+ assert_eq!(intcode.clone().execute(&[0]).unwrap(), vec![0]);
|
|
352
|
+
|
|
353
|
+ let intcode = Intcode::new(
|
|
354
|
+ vec![3, 9, 7, 9, 10, 9, 4, 9, 99, -1, 8]
|
|
355
|
+ .into_iter()
|
|
356
|
+ .enumerate()
|
|
357
|
+ .collect(),
|
|
358
|
+ );
|
|
359
|
+ assert_eq!(intcode.clone().execute(&[0]).unwrap(), vec![1]);
|
|
360
|
+ assert_eq!(intcode.clone().execute(&[9]).unwrap(), vec![0]);
|
|
361
|
+
|
|
362
|
+ let intcode = Intcode::new(
|
|
363
|
+ vec![3, 3, 1108, -1, 8, 3, 4, 3, 99]
|
|
364
|
+ .into_iter()
|
|
365
|
+ .enumerate()
|
|
366
|
+ .collect(),
|
|
367
|
+ );
|
|
368
|
+ assert_eq!(intcode.clone().execute(&[8]).unwrap(), vec![1]);
|
|
369
|
+ assert_eq!(intcode.clone().execute(&[0]).unwrap(), vec![0]);
|
|
370
|
+
|
|
371
|
+ let intcode = Intcode::new(
|
|
372
|
+ vec![3, 3, 1107, -1, 8, 3, 4, 3, 99]
|
|
373
|
+ .into_iter()
|
|
374
|
+ .enumerate()
|
|
375
|
+ .collect(),
|
|
376
|
+ );
|
|
377
|
+ assert_eq!(intcode.clone().execute(&[0]).unwrap(), vec![1]);
|
|
378
|
+ assert_eq!(intcode.clone().execute(&[9]).unwrap(), vec![0]);
|
|
379
|
+ }
|
|
380
|
+
|
|
381
|
+ #[test]
|
|
382
|
+ fn jump_outputs() {
|
|
383
|
+ let intcode = Intcode::new(
|
|
384
|
+ vec![3, 12, 6, 12, 15, 1, 13, 14, 13, 4, 13, 99, -1, 0, 1, 9]
|
|
385
|
+ .into_iter()
|
|
386
|
+ .enumerate()
|
|
387
|
+ .collect(),
|
|
388
|
+ );
|
|
389
|
+ assert_eq!(intcode.clone().execute(&[0]).unwrap(), vec![0]);
|
|
390
|
+ assert_eq!(intcode.clone().execute(&[1]).unwrap(), vec![1]);
|
|
391
|
+
|
|
392
|
+ let intcode = Intcode::new(
|
|
393
|
+ vec![3, 3, 1105, -1, 9, 1101, 0, 0, 12, 4, 12, 99, 1]
|
|
394
|
+ .into_iter()
|
|
395
|
+ .enumerate()
|
|
396
|
+ .collect(),
|
|
397
|
+ );
|
|
398
|
+ assert_eq!(intcode.clone().execute(&[0]).unwrap(), vec![0]);
|
|
399
|
+ assert_eq!(intcode.clone().execute(&[1]).unwrap(), vec![1]);
|
|
400
|
+ }
|
|
401
|
+
|
|
402
|
+ #[test]
|
|
403
|
+ fn larger_part2_intcode() {
|
|
404
|
+ let intcode = Intcode::new(
|
|
405
|
+ vec![
|
|
406
|
+ 3, 21, 1008, 21, 8, 20, 1005, 20, 22, 107, 8, 21, 20, 1006, 20, 31, 1106, 0, 36,
|
|
407
|
+ 98, 0, 0, 1002, 21, 125, 20, 4, 20, 1105, 1, 46, 104, 999, 1105, 1, 46, 1101, 1000,
|
|
408
|
+ 1, 20, 4, 20, 1105, 1, 46, 98, 99,
|
|
409
|
+ ]
|
|
410
|
+ .into_iter()
|
|
411
|
+ .enumerate()
|
|
412
|
+ .collect(),
|
|
413
|
+ );
|
|
414
|
+ assert_eq!(intcode.clone().execute(&[0]).unwrap(), vec![999]);
|
|
415
|
+ assert_eq!(intcode.clone().execute(&[8]).unwrap(), vec![1000]);
|
|
416
|
+ assert_eq!(intcode.clone().execute(&[9]).unwrap(), vec![1001]);
|
|
417
|
+ }
|
|
418
|
+
|
|
419
|
+ #[test]
|
|
420
|
+ fn multiple_input_intcode() {
|
|
421
|
+ let intcode = Intcode::new(
|
|
422
|
+ vec![
|
|
423
|
+ 3, 15, 3, 16, 1002, 16, 10, 16, 1, 16, 15, 15, 4, 15, 99, 0, 0,
|
|
424
|
+ ]
|
|
425
|
+ .into_iter()
|
|
426
|
+ .enumerate()
|
|
427
|
+ .collect(),
|
|
428
|
+ );
|
|
429
|
+ assert_eq!(intcode.clone().execute(&[1, 1]).unwrap(), vec![11]);
|
|
430
|
+ }
|
|
431
|
+
|
|
432
|
+ #[test]
|
|
433
|
+ fn relative_base_offset_quine() {
|
|
434
|
+ let code = vec![
|
|
435
|
+ 109, 1, 204, -1, 1001, 100, 1, 100, 1008, 100, 16, 101, 1006, 101, 0, 99,
|
|
436
|
+ ];
|
|
437
|
+ let intcode = Intcode::new(code.clone().into_iter().enumerate().collect());
|
|
438
|
+ assert_eq!(intcode.clone().execute(&[]).unwrap(), code);
|
|
439
|
+ }
|
|
440
|
+
|
|
441
|
+ #[test]
|
|
442
|
+ fn sixteen_digit_output() {
|
|
443
|
+ let code = vec![1102, 34915192, 34915192, 7, 4, 7, 99, 0];
|
|
444
|
+ let intcode = Intcode::new(code.into_iter().enumerate().collect());
|
|
445
|
+ assert_eq!(intcode.clone().execute(&[]).unwrap(), [1219070632396864]);
|
|
446
|
+ }
|
|
447
|
+
|
|
448
|
+ #[test]
|
|
449
|
+ fn large_output() {
|
|
450
|
+ let code = vec![104, 1125899906842624, 99];
|
|
451
|
+ let intcode = Intcode::new(code.into_iter().enumerate().collect());
|
|
452
|
+ assert_eq!(intcode.clone().execute(&[]).unwrap(), [1125899906842624]);
|
|
453
|
+ }
|
|
454
|
+
|
|
455
|
+ #[test]
|
|
456
|
+ fn relative_target_parameters() {
|
|
457
|
+ let code = vec![109, 1, 203, 2, 204, 2, 99];
|
|
458
|
+ let intcode = Intcode::new(code.into_iter().enumerate().collect());
|
|
459
|
+ assert_eq!(intcode.clone().execute(&[123]).unwrap(), [123]);
|
|
460
|
+ }
|
|
461
|
+}
|