|
| 1 | +//! [Day 2: 1202 Program Alarm](https://adventofcode.com/2019/day/2) |
| 2 | +
|
| 3 | +struct Puzzle { |
| 4 | + program: Vec<u32>, |
| 5 | +} |
| 6 | + |
| 7 | +const ADD: u32 = 1; |
| 8 | +const MUL: u32 = 2; |
| 9 | + |
| 10 | +impl Puzzle { |
| 11 | + fn new() -> Puzzle { |
| 12 | + Puzzle { |
| 13 | + program: Vec::new(), |
| 14 | + } |
| 15 | + } |
| 16 | + |
| 17 | + /// Get the puzzle input. |
| 18 | + fn configure(&mut self, path: &str) { |
| 19 | + let data = std::fs::read_to_string(path).unwrap(); |
| 20 | + |
| 21 | + self.load(&data); |
| 22 | + } |
| 23 | + |
| 24 | + fn load(&mut self, data: &str) { |
| 25 | + self.program = data |
| 26 | + .trim_ascii() |
| 27 | + .split(',') |
| 28 | + .map(|x| x.parse::<_>().unwrap()) |
| 29 | + .collect(); |
| 30 | + } |
| 31 | + |
| 32 | + #[cfg(test)] |
| 33 | + fn dump(&self) -> String { |
| 34 | + self.program |
| 35 | + .iter() |
| 36 | + .map(|x| x.to_string()) |
| 37 | + .collect::<Vec<String>>() |
| 38 | + .join(",") |
| 39 | + } |
| 40 | + |
| 41 | + fn run(memory: &mut [u32]) { |
| 42 | + let mut ip = 0; |
| 43 | + while memory[ip] != 99 { |
| 44 | + assert!(ip + 3 < memory.len()); |
| 45 | + |
| 46 | + let opcode = memory[ip]; |
| 47 | + let noun = usize::try_from(memory[ip + 1]).unwrap(); |
| 48 | + let verb = usize::try_from(memory[ip + 2]).unwrap(); |
| 49 | + let result = usize::try_from(memory[ip + 3]).unwrap(); |
| 50 | + |
| 51 | + memory[result] = match opcode { |
| 52 | + ADD => memory[noun] + memory[verb], |
| 53 | + MUL => memory[noun] * memory[verb], |
| 54 | + _ => panic!("Invalid opcode"), |
| 55 | + }; |
| 56 | + ip += 4; |
| 57 | + } |
| 58 | + } |
| 59 | + |
| 60 | + /// Solve part one. |
| 61 | + fn part1(&self) -> u32 { |
| 62 | + let mut memory = self.program.clone(); |
| 63 | + memory[1] = 12; |
| 64 | + memory[2] = 2; |
| 65 | + |
| 66 | + Self::run(&mut memory); |
| 67 | + |
| 68 | + memory[0] |
| 69 | + } |
| 70 | + |
| 71 | + /// Solve part two. |
| 72 | + fn part2(&self) -> u32 { |
| 73 | + for noun in 0..100 { |
| 74 | + for verb in 0..100 { |
| 75 | + let mut memory = self.program.clone(); |
| 76 | + memory[1] = noun; |
| 77 | + memory[2] = verb; |
| 78 | + |
| 79 | + Self::run(&mut memory); |
| 80 | + |
| 81 | + // clippy... |
| 82 | + if memory[0] == 19_690_720 { |
| 83 | + return 100 * noun + verb; |
| 84 | + } |
| 85 | + } |
| 86 | + } |
| 87 | + 0 |
| 88 | + } |
| 89 | +} |
| 90 | + |
| 91 | +fn main() { |
| 92 | + let args = aoc::parse_args(); |
| 93 | + let mut puzzle = Puzzle::new(); |
| 94 | + puzzle.configure(args.path.as_str()); |
| 95 | + println!("{}", puzzle.part1()); |
| 96 | + println!("{}", puzzle.part2()); |
| 97 | +} |
| 98 | + |
| 99 | +/// Test from puzzle input |
| 100 | +#[cfg(test)] |
| 101 | +mod test { |
| 102 | + use super::*; |
| 103 | + |
| 104 | + #[test] |
| 105 | + fn test01() { |
| 106 | + let mut puzzle = Puzzle::new(); |
| 107 | + |
| 108 | + puzzle.load("1,0,0,0,99"); |
| 109 | + Puzzle::run(&mut puzzle.program); |
| 110 | + assert_eq!(puzzle.dump(), "2,0,0,0,99"); |
| 111 | + |
| 112 | + puzzle.load("2,3,0,3,99"); |
| 113 | + Puzzle::run(&mut puzzle.program); |
| 114 | + assert_eq!(puzzle.dump(), "2,3,0,6,99"); |
| 115 | + puzzle.load("2,4,4,5,99,0"); |
| 116 | + Puzzle::run(&mut puzzle.program); |
| 117 | + assert_eq!(puzzle.dump(), "2,4,4,5,99,9801"); |
| 118 | + |
| 119 | + puzzle.load("1,1,1,4,99,5,6,0,99"); |
| 120 | + Puzzle::run(&mut puzzle.program); |
| 121 | + assert_eq!(puzzle.dump(), "30,1,1,4,2,5,6,0,99"); |
| 122 | + } |
| 123 | +} |
0 commit comments