advent-of-code 2025.5.0

Solutions to Advent of Code
Documentation 
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

use super::assembly::{NumberValue, Program};
use crate::input::Input;

pub fn solve(input: &Input) -> Result<NumberValue, String> {
    let mut program_zero = Program::parse(input.text)?;
    if input.is_part_one() {
        program_zero.run_until_recover(None);
        Ok(program_zero.last_played_frequency)
    } else {
        let mut program_one = program_zero.clone();

        // "Each program also has its own program ID (one 0 and the other 1);
        // the register p should begin with this value."
        program_zero.registers[(b'p' - b'a') as usize] = 0;
        program_one.registers[(b'p' - b'a') as usize] = 1;

        loop {
            if !program_zero.terminated {
                program_zero.run_until_recover(Some(&mut program_one.input_queue));
            }
            if !program_one.terminated {
                program_one.run_until_recover(Some(&mut program_zero.input_queue));
            }

            if (program_zero.terminated && program_one.terminated)
                || (program_zero.input_queue.is_empty() && program_one.input_queue.is_empty())
            {
                // Both programs terminated, or both programs deadlocking.
                break;
            }
        }

        Ok(program_one.sent_value_count)
    }
}

#[test]
pub fn tests() {
    let example_input = "snd 1
snd 2
snd p
rcv a
rcv b
rcv c
rcv d";
    test_part_two!(example_input => 3);

    let real_input = include_str!("day18_input.txt");
    test_part_one!(real_input => 3423);
    test_part_two!(real_input => 7493);
}