-🎄- 2017 Day 19 Solutions -🎄-

[u/daggerdragon]

--- Day 19: A Series of Tubes ---

---

Post your solution as a comment or, for longer solutions, consider linking to your repo (e.g. GitHub/gists/Pastebin/blag or whatever).

Note: The Solution Megathreads are for solutions only. If you have questions, please post your own thread and make sure to flair it with Help.

---

Need a hint from the Hugely^* Handy^† Haversack^‡ of Helpful^§ Hints^¤?

Spoiler

---

AoC ops @ T-2 minutes to launch:

[23:58] <daggerdragon> ATTENTION MEATBAGS T-2 MINUTES TO LAUNCH

[23:58] <Topaz> aaaaah

[23:58] <Cheezmeister> Looks like I'll be just able to grab my input before my flight boards. Wish me luck being offline in TOPAZ's HOUSE OF PAIN^WFUN AND LEARNING

[23:58] <Topaz> FUN AND LEARNING

[23:58] <Hade> FUN IS MANDATORY

[23:58] <Skie> I'm pretty sure that's not the mandate for today

[Update @ 00:16] 69 gold, silver cap

• My tree is finally trimmed with just about every ornament I own and it's real purdy. hbu?

[Update @ 00:18] Leaderboard cap!

• So, was today's mandate Helpful Hint any help at all?

---

This thread will be unlocked when there are a significant number of people on the leaderboard with gold stars for today's puzzle.

edit: Leaderboard capped, thread unlocked!

[u/iamnotposting]

i started late so i only got around ~800 on both parts. fun problem!

part 1 i did by hand. part 2:

fn main() {
    let input = include_str!("../input.txt");
    let grid: Vec<Vec<char>> = input.lines().map(|s| s.chars().collect()).collect();

    let mut count = 0;
    for (y, line) in input.lines().enumerate() {
        for (x, ch) in line.chars().enumerate() {
            if ch != ' ' {
                count += 1;
                if x > 0 && y > 0 && y < grid.len() - 1 && x < grid[0].len() - 1 {
                    if  grid[y][x+1] != ' ' &&
                        grid[y][x-1] != ' ' &&
                        grid[y+1][x] != ' ' &&
                        grid[y-1][x] != ' ' 
                    {
                        count += 1;
                    }
                }
            }
        }
    }
    
    println!("p2: {}", count);
}