aoc/year2019/

day17.rs

//! # Set and Forget
//!
//! The key insight is that this is not a pathfinding problem but a *compression*
//! problem. We need to reduce the robot's path into repetitions of three patterns.
//! This is essentially a very simple version of the well-known
//! [LZW](https://en.wikipedia.org/wiki/Lempel-Ziv-Welch)
//! algorithm used by the `GIF` and `ZIP` file formats.
//!
//! First we find the complete path with a simple heuristic:
//! * Rotate left or right to face the current path segment (a horizontal or vertical line).
//! * Go forward until we hit the end of the current path segment.
//! * If it's a dead end then finish.
//!
//! Then we look for three patterns that can be repeated in any order to form the whole path.
//! Without loss of generality the first pattern anchored at the start is always `A`,
//! the next `B` and the last `C`.
//!
//! A good chunk of the Intcode runtime is spent on unpacking compressed memory into the grid
//! that is first displayed to the user. This effort is the same between both parts. Running the
//! entire solution in parse thus reduces the overall runtime.
use std::fmt::Write as _;
use std::iter::once;

use crate::util::hash::*;
use crate::util::intcode::*;
use crate::util::parse::*;
use crate::util::point::*;

type Input = (FastSet<Point>, i64);

struct Movement<'a> {
    routine: String,
    functions: [Option<&'a str>; 3],
}

/// The camera output points from left to right, top to bottom.
pub fn parse(input: &str) -> Input {
    // Only run the part two program. Its initial output matches part one, and avoiding the
    // startup costs of a second machine results in a faster solution.
    let code: Vec<_> = once(2).chain(input.iter_signed().skip(1)).collect();
    let mut computer = Computer::new(&code);

    let mut x = 0;
    let mut y = 0;
    let mut scaffold = FastSet::new();
    let mut position = ORIGIN;
    let mut direction = ORIGIN;

    while let State::Output(next) = computer.run() {
        let next = next as u8;
        let point = Point::new(x, y);

        match next {
            b'\n' => {
                y += 1;
                x = 0;
                continue;
            }
            b'#' => {
                scaffold.insert(point);
            }
            b'<' | b'>' | b'^' | b'v' => {
                scaffold.insert(point);
                position = point;
                direction = Point::from(next);
            }
            _ => (),
        }

        x += 1;
    }

    // With the scaffold now available, construct the compressed path.
    let path = build_path(&scaffold, position, direction);
    let mut movement = Movement { routine: String::new(), functions: [None; 3] };

    compress(&path, &mut movement);

    // Convert trailing comma ',' into a trailing newline '\n'
    let rules: String = once(movement.routine.as_str())
        .chain(movement.functions.into_iter().flatten())
        .flat_map(|s| [s.trim_end_matches(','), "\n"])
        .collect();

    computer.input_ascii(&rules);
    let score = visit(computer);

    (scaffold, score)
}

pub fn part1(input: &Input) -> i32 {
    let (scaffold, _) = input;
    scaffold
        .iter()
        .filter(|&point| ORTHOGONAL.iter().all(|&delta| scaffold.contains(&(*point + delta))))
        .map(|point| point.x * point.y)
        .sum()
}

pub fn part2(input: &Input) -> i64 {
    input.1
}

/// Use a simple heuristic to build a path that visits every part of the scaffold at least once.
/// This string will be too long to use directly in the robot's movement functions, so we'll
/// need to compress it first.
fn build_path(scaffold: &FastSet<Point>, mut position: Point, mut direction: Point) -> String {
    let mut path = String::new();

    loop {
        let left = direction.counter_clockwise();
        let right = direction.clockwise();

        if scaffold.contains(&(position + left)) {
            direction = left;
        } else if scaffold.contains(&(position + right)) {
            direction = right;
        } else {
            break path;
        }

        let mut next = position + direction;
        let mut magnitude = 0;

        while scaffold.contains(&next) {
            position = next;
            next += direction;
            magnitude += 1;
        }

        let direction = if direction == left { 'L' } else { 'R' };
        let _ = write!(path, "{direction},{magnitude},");
    }
}

/// Find three patterns that can be repeated in any order to build the whole path.
///
/// Uses a greedy backtracking algorithm that attempts to match as much of the remaining string
/// as possible with known patterns, before trying combinations of a new pattern (up to the maximum
/// movement function length of 20 characters).
fn compress<'a>(path: &'a str, movement: &mut Movement<'a>) -> bool {
    // Nothing left to match, we've finished successfully.
    if path.is_empty() {
        return true;
    }
    // Safety check just in case very short sequences can match the entire input.
    if movement.routine.len() > 21 {
        return false;
    }

    for (i, &name) in ['A', 'B', 'C'].iter().enumerate() {
        movement.routine.push(name);
        movement.routine.push(',');

        if let Some(needle) = movement.functions[i] {
            // Try known patterns first.
            if let Some(remaining) = path.strip_prefix(needle)
                && compress(remaining, movement)
            {
                return true;
            }
        } else {
            // Then combinations up to length 20 characters.
            for (needle, remaining) in segments(path) {
                movement.functions[i] = Some(needle);
                if compress(remaining, movement) {
                    return true;
                }
                movement.functions[i] = None;
            }
        }

        movement.routine.pop();
        movement.routine.pop();
    }

    false
}

/// Fun with iterators.
fn segments(path: &str) -> impl Iterator<Item = (&str, &str)> {
    path.bytes()
        .enumerate()
        // Index of every comma ',' in the string.
        .filter_map(|(i, b)| (b == b',').then_some(i))
        // Maximum length for movement function is 20 characters.
        .take_while(|&i| i < 21)
        // Include trailing comma in "needle" to make matching easier.
        .map(|i| path.split_at(i + 1))
        // Movement is always pairs of (rotation, magnitude) so return every second comma.
        .skip(1)
        .step_by(2)
}

#[cfg(not(feature = "frivolity"))]
fn visit(mut computer: Computer) -> i64 {
    // Disable continuous video feed.
    computer.input_ascii("n\n");

    let mut result = 0;
    while let State::Output(next) = computer.run() {
        result = next;
    }
    result
}

/// Non essential but fun. Animates the robot traversing the scaffold.
#[cfg(feature = "frivolity")]
fn visit(mut computer: Computer) -> i64 {
    use std::thread::sleep;
    use std::time::Duration;

    use crate::util::ansi::*;

    let mut result = 0;
    let mut previous = ' ';
    let mut buffer = String::new();

    // Enable continuous video feed.
    computer.input_ascii("y\n");

    while let State::Output(next) = computer.run() {
        result = next;
        let ascii = char::from(next as u8);

        // Highlight the robot's position.
        match ascii {
            '^' | 'v' | '<' | '>' => {
                let _ = write!(&mut buffer, "{BOLD}{YELLOW}{ascii}{RESET}");
            }
            _ => buffer.push(ascii),
        }

        // Each frame is separated by a blank line.
        if ascii == '\n' && previous == '\n' {
            print!("{HOME}{CLEAR}{buffer}");
            sleep(Duration::from_millis(25));
            buffer.clear();
        }

        previous = ascii;
    }

    result
}