From 53139f9ad97eaae69f042b520c5e49c5f7bf0464 Mon Sep 17 00:00:00 2001
From: shoofle <xsigma@gmail.com>
Date: Fri, 13 Dec 2024 10:55:51 -0500
Subject: [PATCH] day 12

---
 day12/src/main.rs |   5 ++-
 day13/Cargo.toml  |   8 ++++
 day13/src/main.rs | 102 ++++++++++++++++++++++++++++++++++++++++++++++
 3 files changed, 113 insertions(+), 2 deletions(-)
 create mode 100644 day13/Cargo.toml
 create mode 100644 day13/src/main.rs

diff --git a/day12/src/main.rs b/day12/src/main.rs
index b111372..d70d139 100644
--- a/day12/src/main.rs
+++ b/day12/src/main.rs
@@ -190,6 +190,7 @@ fn spread_over_side_and_cache(
         // look at each side in the wavefront
         for x in &wavefront {
             // if it's in a side that we already have cached, then we're done.
+            // this loop is what makes this slow i bet
             for existing_side in &cache {
                 if existing_side.contains(x) {
                     // return the cache unchanged.
@@ -217,8 +218,8 @@ fn spread_over_side_and_cache(
         }
 
         // add all the siddes in the wavefront to the accumulator.
-        for x in wavefront.drain() {
-            accumulator.insert(x);
+        for x in &wavefront {
+            accumulator.insert(*x);
         }
 
         wavefront = new_wavefront;
diff --git a/day13/Cargo.toml b/day13/Cargo.toml
new file mode 100644
index 0000000..5673f4f
--- /dev/null
+++ b/day13/Cargo.toml
@@ -0,0 +1,8 @@
+[package]
+name = "day13"
+version = "0.1.0"
+edition = "2021"
+
+[dependencies]
+num = "0.4.3"
+regex = "1.11.1"
diff --git a/day13/src/main.rs b/day13/src/main.rs
new file mode 100644
index 0000000..9713d8a
--- /dev/null
+++ b/day13/src/main.rs
@@ -0,0 +1,102 @@
+use regex::Regex;
+use std::env;
+
+use std::fs;
+
+use num;
+
+#[derive(Debug, Copy, Clone)]
+struct Problem {
+    ax: i128, ay: i128,
+    bx: i128, by: i128,
+    px: i128, py: i128
+}
+
+fn main() {
+    println!("Hello, AoC day 09!");
+
+    let args: Vec<String> = env::args().collect();
+    if args.len() != 2 {
+        println!("wrong number of arguments!");
+        std::process::exit(1);
+    }
+
+    let file_path = &args[1];
+
+    let binding = fs::read_to_string(file_path)
+        .expect("should be able to read the file");
+    let records = binding
+        .split("\n\n");
+
+    let find_record = Regex::new(r"Button A: X\+([0-9]+), Y\+([0-9]+)
+Button B: X\+([0-9]+), Y\+([0-9]+)
+Prize: X=([0-9]+), Y=([0-9]+)").unwrap();
+    
+    let mut games: Vec<Problem> = Vec::new();
+    for record in records {
+        let Some(caps) = find_record.captures(record) else {
+            continue;
+        };
+        println!("a: x{},y{}\nb: x{},y{}\nprize: x{},y{}",
+            &caps[1], &caps[2], &caps[3], &caps[4], &caps[5], &caps[6]);
+
+        games.push(Problem {
+            ax: caps[1].parse().unwrap(), ay: caps[2].parse().unwrap(), 
+            bx: caps[3].parse().unwrap(), by:caps[4].parse().unwrap(), 
+            px: caps[5].parse().unwrap(), py: caps[6].parse().unwrap()});
+    }
+
+    // part a
+    let mut sum = 0;
+    for p in &games {
+        let Some(cost) = solve_b(*p) else { continue; };
+        sum += cost;
+    }
+    println!("total coins required is {sum}");
+
+
+    // part b
+    for p in &mut games {
+        p.px += 10000000000000;
+        p.py += 10000000000000;
+    }
+
+    let mut sum = 0;
+    for p in &games {
+        let Some(cost) = solve_b(*p) else { continue; };
+        sum += cost;
+    }
+    println!("total coins required is {sum}");
+}
+
+fn solve(problem: Problem) -> Option<i128> {
+    let mut sol = 30_000;
+    for a in 0..100 {
+        for b in 0..100 {
+            if a * problem.ax + b * problem.bx == problem.px &&
+                a* problem.ay + b * problem.by == problem.py {
+                    if 3*a + b < sol {
+                        sol = 3*a + b;
+                    }
+                }
+        }
+    }
+
+    if sol == 30_000 { return None; }
+    return Some(sol);
+}
+
+fn solve_b(p: Problem) -> Option<i128> {
+    let det_ab = p.ax*p.by - p.bx*p.ay;
+    if det_ab == 0 { return None; }
+    let a = (p.by*p.px - p.bx*p.py) / det_ab;
+    let b = (-p.ay*p.px+ p.ax*p.py) / det_ab;
+    if check((a, b), p) && a >= 0 && b >= 0 {
+        return Some(3*a + b);
+    }
+    return None;
+}
+
+fn check(s: (i128, i128), p: Problem) -> bool {
+    return s.0*p.ax + s.1*p.bx == p.px && s.0*p.ay + s.1*p.by == p.py;
+}
\ No newline at end of file