## --- Day 14: Docking Data ---

As your ferry approaches the sea port, the captain asks for your help again. The computer system that runs this port isn't compatible with the docking program on the ferry, so the docking parameters aren't being correctly initialized in the docking program's memory.

After a brief inspection, you discover that the sea port's computer system uses a strange bitmask system in its initialization program. Although you don't have the correct decoder chip handy, you can emulate it in software!

The initialization program (your puzzle input) can either update the bitmask or write a value to memory. Values and memory addresses are both 36-bit unsigned integers. For example, ignoring bitmasks for a moment, a line like `mem = 11` would write the value `11` to memory address `8`.

The bitmask is always given as a string of 36 bits, written with the most significant bit (representing `2^35`) on the left and the least significant bit (`2^0`, that is, the `1`s bit) on the right. The current bitmask is applied to values immediately before they are written to memory: a `0` or `1` overwrites the corresponding bit in the value, while an `X` leaves the bit in the value unchanged.

For example, consider the following program:

``````mask = XXXXXXXXXXXXXXXXXXXXXXXXXXXXX1XXXX0X
mem = 11
mem = 101
mem = 0
``````

This program starts by specifying a bitmask (`mask = ....`). The mask it specifies will overwrite two bits in every written value: the `2`s bit is overwritten with `0`, and the `64`s bit is overwritten with `1`.

The program then attempts to write the value `11` to memory address `8`. By expanding everything out to individual bits, the mask is applied as follows:

``````value:  000000000000000000000000000000001011  (decimal 11)
result: 000000000000000000000000000001001001  (decimal 73)
``````

So, because of the mask, the value `73` is written to memory address `8` instead. Then, the program tries to write `101` to address `7`:

``````value:  000000000000000000000000000001100101  (decimal 101)
result: 000000000000000000000000000001100101  (decimal 101)
``````

This time, the mask has no effect, as the bits it overwrote were already the values the mask tried to set. Finally, the program tries to write `0` to address `8`:

``````value:  000000000000000000000000000000000000  (decimal 0)
result: 000000000000000000000000000001000000  (decimal 64)
``````

`64` is written to address `8` instead, overwriting the value that was there previously.

To initialize your ferry's docking program, you need the sum of all values left in memory after the initialization program completes. (The entire 36-bit address space begins initialized to the value `0` at every address.) In the above example, only two values in memory are not zero - `101` (at address `7`) and `64` (at address `8`) - producing a sum of `165`.

Execute the initialization program. What is the sum of all values left in memory after it completes? (Do not truncate the sum to 36 bits.)

## --- Part Two ---

For some reason, the sea port's computer system still can't communicate with your ferry's docking program. It must be using version 2 of the decoder chip!

A version 2 decoder chip doesn't modify the values being written at all. Instead, it acts as a memory address decoder. Immediately before a value is written to memory, each bit in the bitmask modifies the corresponding bit of the destination memory address in the following way:

• If the bitmask bit is `0`, the corresponding memory address bit is unchanged.
• If the bitmask bit is `1`, the corresponding memory address bit is overwritten with `1`.
• If the bitmask bit is `X`, the corresponding memory address bit is floating.

A floating bit is not connected to anything and instead fluctuates unpredictably. In practice, this means the floating bits will take on all possible values, potentially causing many memory addresses to be written all at once!

For example, consider the following program:

``````mask = 000000000000000000000000000000X1001X
mem = 100
mem = 1
``````

When this program goes to write to memory address `42`, it first applies the bitmask:

``````address: 000000000000000000000000000000101010  (decimal 42)
result:  000000000000000000000000000000X1101X
``````

After applying the mask, four bits are overwritten, three of which are different, and two of which are floating. Floating bits take on every possible combination of values; with two floating bits, four actual memory addresses are written:

``````000000000000000000000000000000011010  (decimal 26)
000000000000000000000000000000011011  (decimal 27)
000000000000000000000000000000111010  (decimal 58)
000000000000000000000000000000111011  (decimal 59)
``````

Next, the program is about to write to memory address `26` with a different bitmask:

``````address: 000000000000000000000000000000011010  (decimal 26)
result:  00000000000000000000000000000001X0XX
``````

This results in an address with three floating bits, causing writes to eight memory addresses:

``````000000000000000000000000000000010000  (decimal 16)
000000000000000000000000000000010001  (decimal 17)
000000000000000000000000000000010010  (decimal 18)
000000000000000000000000000000010011  (decimal 19)
000000000000000000000000000000011000  (decimal 24)
000000000000000000000000000000011001  (decimal 25)
000000000000000000000000000000011010  (decimal 26)
000000000000000000000000000000011011  (decimal 27)
``````

The entire 36-bit address space still begins initialized to the value 0 at every address, and you still need the sum of all values left in memory at the end of the program. In this example, the sum is `208`.

Execute the initialization program using an emulator for a version 2 decoder chip. What is the sum of all values left in memory after it completes?

## Rust Solution

``````use rustgym_util::*;
use std::fmt::Write;
use std::io::*;

use std::collections::HashMap;
use std::collections::VecDeque;

#[derive(Clone, Copy)]
enum Instruction {
Mem(u64, u64),
}

#[derive(Default)]
struct VM {
one: u64,
zero: u64,
floating: u64,
mem: HashMap<u64, u64>,
}

impl VM {
fn exec1(&mut self, instruction: Instruction) {
use Instruction::*;
match instruction {
self.zero = zero;
self.one = one;
}
*entry = val;
*entry |= self.one;
*entry &= !self.zero;
}
}
}

fn decode(floating: u64, one: u64, addr: u64) -> VecDeque<u64> {
let mut queue: VecDeque<u64> = VecDeque::new();
for i in 0..36 {
let n = queue.len();
if floating & 1 << i != 0 {
for _ in 0..n {
let x = queue.pop_front().unwrap();
queue.push_back(x);
queue.push_back(x ^ 1 << i);
}
}
}
queue
}

fn exec2(&mut self, instruction: Instruction) {
use Instruction::*;
match instruction {
self.zero = zero;
self.one = one;
self.floating = floating;
}
*entry = val;
}
}
}
}

fn sum(&self) -> u64 {
self.mem.values().sum()
}
}

let mut instructions: Vec<Instruction> = vec![];
for line in it {
let words: Vec<String> = line.split_whitespace().map(|s| s.to_string()).collect();
let mut zero = 0u64;
let mut one = 0u64;
let mut floating = 0u64;
for i in 0..36 {
if c == '0' {
zero |= 1 << i;
}
if c == '1' {
one |= 1 << i;
}
if c == 'X' {
floating |= 1 << i;
}
}
} else {
let address: String = words.chars().filter(|c| c.is_numeric()).collect();
let val = words.parse::<u64>().unwrap();
}
}
let res1 = sum(&instructions);
let res2 = decode(&instructions);
writeln!(writer, "{}", res1).unwrap();
writeln!(writer, "{}", res2).unwrap();
}

fn sum(instructions: &[Instruction]) -> u64 {
let mut vm = VM::default();
for &instruction in instructions {
vm.exec1(instruction);
}
vm.sum()
}

fn decode(instructions: &[Instruction]) -> u64 {
let mut vm = VM::default();
for &instruction in instructions {
vm.exec2(instruction);
}
vm.sum()
}