Add day 19

LinAGKar · LinAGKar · commit 0a7577894188 · 2022-12-19T22:45:16.000+01:00
diff --git a/day19_input.txt b/day19_input.txt
@@ -0,0 +1,30 @@
+Blueprint 1: Each ore robot costs 4 ore. Each clay robot costs 4 ore. Each obsidian robot costs 2 ore and 16 clay. Each geode robot costs 4 ore and 16 obsidian.
+Blueprint 2: Each ore robot costs 4 ore. Each clay robot costs 4 ore. Each obsidian robot costs 3 ore and 14 clay. Each geode robot costs 4 ore and 8 obsidian.
+Blueprint 3: Each ore robot costs 3 ore. Each clay robot costs 4 ore. Each obsidian robot costs 3 ore and 18 clay. Each geode robot costs 4 ore and 16 obsidian.
+Blueprint 4: Each ore robot costs 4 ore. Each clay robot costs 3 ore. Each obsidian robot costs 3 ore and 7 clay. Each geode robot costs 2 ore and 7 obsidian.
+Blueprint 5: Each ore robot costs 4 ore. Each clay robot costs 4 ore. Each obsidian robot costs 4 ore and 7 clay. Each geode robot costs 2 ore and 16 obsidian.
+Blueprint 6: Each ore robot costs 3 ore. Each clay robot costs 3 ore. Each obsidian robot costs 3 ore and 17 clay. Each geode robot costs 4 ore and 8 obsidian.
+Blueprint 7: Each ore robot costs 4 ore. Each clay robot costs 3 ore. Each obsidian robot costs 3 ore and 20 clay. Each geode robot costs 2 ore and 19 obsidian.
+Blueprint 8: Each ore robot costs 4 ore. Each clay robot costs 3 ore. Each obsidian robot costs 2 ore and 10 clay. Each geode robot costs 4 ore and 10 obsidian.
+Blueprint 9: Each ore robot costs 3 ore. Each clay robot costs 3 ore. Each obsidian robot costs 4 ore and 19 clay. Each geode robot costs 4 ore and 7 obsidian.
+Blueprint 10: Each ore robot costs 4 ore. Each clay robot costs 3 ore. Each obsidian robot costs 2 ore and 19 clay. Each geode robot costs 3 ore and 13 obsidian.
+Blueprint 11: Each ore robot costs 4 ore. Each clay robot costs 4 ore. Each obsidian robot costs 2 ore and 12 clay. Each geode robot costs 3 ore and 15 obsidian.
+Blueprint 12: Each ore robot costs 4 ore. Each clay robot costs 3 ore. Each obsidian robot costs 2 ore and 14 clay. Each geode robot costs 4 ore and 11 obsidian.
+Blueprint 13: Each ore robot costs 4 ore. Each clay robot costs 3 ore. Each obsidian robot costs 3 ore and 10 clay. Each geode robot costs 2 ore and 10 obsidian.
+Blueprint 14: Each ore robot costs 3 ore. Each clay robot costs 3 ore. Each obsidian robot costs 2 ore and 16 clay. Each geode robot costs 3 ore and 14 obsidian.
+Blueprint 15: Each ore robot costs 3 ore. Each clay robot costs 4 ore. Each obsidian robot costs 3 ore and 20 clay. Each geode robot costs 3 ore and 14 obsidian.
+Blueprint 16: Each ore robot costs 4 ore. Each clay robot costs 4 ore. Each obsidian robot costs 3 ore and 10 clay. Each geode robot costs 2 ore and 14 obsidian.
+Blueprint 17: Each ore robot costs 3 ore. Each clay robot costs 4 ore. Each obsidian robot costs 3 ore and 6 clay. Each geode robot costs 2 ore and 10 obsidian.
+Blueprint 18: Each ore robot costs 2 ore. Each clay robot costs 3 ore. Each obsidian robot costs 3 ore and 8 clay. Each geode robot costs 3 ore and 20 obsidian.
+Blueprint 19: Each ore robot costs 2 ore. Each clay robot costs 4 ore. Each obsidian robot costs 4 ore and 20 clay. Each geode robot costs 3 ore and 14 obsidian.
+Blueprint 20: Each ore robot costs 3 ore. Each clay robot costs 4 ore. Each obsidian robot costs 4 ore and 8 clay. Each geode robot costs 2 ore and 10 obsidian.
+Blueprint 21: Each ore robot costs 2 ore. Each clay robot costs 4 ore. Each obsidian robot costs 3 ore and 19 clay. Each geode robot costs 4 ore and 13 obsidian.
+Blueprint 22: Each ore robot costs 3 ore. Each clay robot costs 3 ore. Each obsidian robot costs 2 ore and 13 clay. Each geode robot costs 3 ore and 12 obsidian.
+Blueprint 23: Each ore robot costs 3 ore. Each clay robot costs 4 ore. Each obsidian robot costs 2 ore and 20 clay. Each geode robot costs 4 ore and 7 obsidian.
+Blueprint 24: Each ore robot costs 4 ore. Each clay robot costs 3 ore. Each obsidian robot costs 3 ore and 7 clay. Each geode robot costs 3 ore and 9 obsidian.
+Blueprint 25: Each ore robot costs 4 ore. Each clay robot costs 3 ore. Each obsidian robot costs 2 ore and 13 clay. Each geode robot costs 2 ore and 9 obsidian.
+Blueprint 26: Each ore robot costs 4 ore. Each clay robot costs 4 ore. Each obsidian robot costs 4 ore and 7 clay. Each geode robot costs 4 ore and 17 obsidian.
+Blueprint 27: Each ore robot costs 3 ore. Each clay robot costs 3 ore. Each obsidian robot costs 3 ore and 19 clay. Each geode robot costs 3 ore and 17 obsidian.
+Blueprint 28: Each ore robot costs 3 ore. Each clay robot costs 3 ore. Each obsidian robot costs 3 ore and 6 clay. Each geode robot costs 2 ore and 16 obsidian.
+Blueprint 29: Each ore robot costs 4 ore. Each clay robot costs 4 ore. Each obsidian robot costs 4 ore and 7 clay. Each geode robot costs 2 ore and 19 obsidian.
+Blueprint 30: Each ore robot costs 4 ore. Each clay robot costs 3 ore. Each obsidian robot costs 2 ore and 20 clay. Each geode robot costs 3 ore and 9 obsidian.
diff --git a/day19a/Cargo.toml b/day19a/Cargo.toml
@@ -0,0 +1,8 @@
+[package]
+name = "day19a"
+version = "0.1.0"
+edition = "2021"
+
+# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
+
+[dependencies]
diff --git a/day19a/src/main.rs b/day19a/src/main.rs
@@ -0,0 +1,90 @@
+use std::io::Read;
+
+fn find_max(
+    costs: &[[u16; 3]; 4],
+    inventory: [u16; 4],
+    bots: [u16; 4],
+    time: u16,
+    level: u8,
+    best: &mut u16,
+) {
+    const MAX_TIME: u16 = 24;
+    let mut time_to_geode_bot = u16::MAX;
+    let mut built_bot = false;
+
+    'outer: for (n, (&cost, &bot)) in costs.iter().zip(&bots).enumerate().rev() {
+        if n < costs[0].len() && costs.iter().all(|cost| bot >= cost[n]) {
+            continue;
+        }
+
+        let mut needed_time = 0;
+        for ((&cost, &inventory), &bots) in cost.iter().zip(&inventory).zip(&bots) {
+            if inventory < cost {
+                if bots == 0 {
+                    continue 'outer;
+                }
+                let needed_resources = cost - inventory;
+                needed_time = std::cmp::max(
+                    needed_time,
+                    needed_resources / bots + if needed_resources % bots != 0 { 1 } else { 0 },
+                )
+            }
+        }
+        needed_time += 1;
+
+        if n == bots.len() - 1 {
+            time_to_geode_bot = needed_time;
+        } else if needed_time >= time_to_geode_bot {
+            continue;
+        }
+
+        if time + needed_time >= MAX_TIME {
+            continue;
+        }
+
+        let mut new_inventory = inventory;
+        for (inv, &bots) in new_inventory.iter_mut().zip(&bots) {
+            *inv += bots * needed_time;
+        }
+        for (inv, &cost) in new_inventory.iter_mut().zip(&cost) {
+            *inv -= cost;
+        }
+
+        let mut new_bots = bots;
+        new_bots[n] += 1;
+
+        let remaining_time = MAX_TIME - (time + needed_time);
+        if new_inventory.last().unwrap() +
+           new_bots.last().unwrap() * remaining_time +
+           remaining_time * (remaining_time - 1) / 2 <= *best {
+            continue;
+        }
+
+        find_max(costs, new_inventory, new_bots, time + needed_time, level + 1, best);
+        built_bot = true;
+    }
+
+    if !built_bot {
+        *best = std::cmp::max(*best, inventory.last().unwrap() + bots.last().unwrap() * (MAX_TIME - time));
+    }
+}
+
+fn main() {
+    let mut input = String::new();
+    std::io::stdin().read_to_string(&mut input).unwrap();
+
+    println!("{}", input.lines().map(|line| {
+        let mut words = line.split_whitespace();
+        let id: u16 = words.nth(1).unwrap().trim_end_matches(':').parse().unwrap();
+        let costs: [[u16; 3]; 4] = [
+            [words.nth(4).unwrap().parse().unwrap(), 0, 0],
+            [words.nth(5).unwrap().parse().unwrap(), 0, 0],
+            [words.nth(5).unwrap().parse().unwrap(), words.nth(2).unwrap().parse().unwrap(), 0],
+            [words.nth(5).unwrap().parse().unwrap(), 0, words.nth(2).unwrap().parse().unwrap()],
+        ];
+
+        let mut result = 0;
+        find_max(&costs, [0; 4], [1, 0, 0, 0], 0, 0, &mut result);
+        id * result
+    }).sum::<u16>());
+}
diff --git a/day19b/Cargo.toml b/day19b/Cargo.toml
@@ -0,0 +1,8 @@
+[package]
+name = "day19b"
+version = "0.1.0"
+edition = "2021"
+
+# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
+
+[dependencies]
diff --git a/day19b/src/main.rs b/day19b/src/main.rs
@@ -0,0 +1,89 @@
+use std::io::Read;
+
+fn find_max(
+    costs: &[[u16; 3]; 4],
+    inventory: [u16; 4],
+    bots: [u16; 4],
+    time: u16,
+    level: u8,
+    best: &mut u16,
+) {
+    const MAX_TIME: u16 = 32;
+    let mut time_to_geode_bot = u16::MAX;
+    let mut built_bot = false;
+
+    'outer: for (n, (&cost, &bot)) in costs.iter().zip(&bots).enumerate().rev() {
+        if n < costs[0].len() && costs.iter().all(|cost| bot >= cost[n]) {
+            continue;
+        }
+
+        let mut needed_time = 0;
+        for ((&cost, &inventory), &bots) in cost.iter().zip(&inventory).zip(&bots) {
+            if inventory < cost {
+                if bots == 0 {
+                    continue 'outer;
+                }
+                let needed_resources = cost - inventory;
+                needed_time = std::cmp::max(
+                    needed_time,
+                    needed_resources / bots + if needed_resources % bots != 0 { 1 } else { 0 },
+                )
+            }
+        }
+        needed_time += 1;
+
+        if n == bots.len() - 1 {
+            time_to_geode_bot = needed_time;
+        } else if needed_time >= time_to_geode_bot {
+            continue;
+        }
+
+        if time + needed_time >= MAX_TIME {
+            continue;
+        }
+
+        let mut new_inventory = inventory;
+        for (inv, &bots) in new_inventory.iter_mut().zip(&bots) {
+            *inv += bots * needed_time;
+        }
+        for (inv, &cost) in new_inventory.iter_mut().zip(&cost) {
+            *inv -= cost;
+        }
+
+        let mut new_bots = bots;
+        new_bots[n] += 1;
+
+        let remaining_time = MAX_TIME - (time + needed_time);
+        if new_inventory.last().unwrap() +
+           new_bots.last().unwrap() * remaining_time +
+           remaining_time * (remaining_time - 1) / 2 <= *best {
+            continue;
+        }
+
+        find_max(costs, new_inventory, new_bots, time + needed_time, level + 1, best);
+        built_bot = true;
+    }
+
+    if !built_bot {
+        *best = std::cmp::max(*best, inventory.last().unwrap() + bots.last().unwrap() * (MAX_TIME - time));
+    }
+}
+
+fn main() {
+    let mut input = String::new();
+    std::io::stdin().read_to_string(&mut input).unwrap();
+
+    println!("{}", input.lines().take(3).map(|line| {
+        let mut words = line.split_whitespace();
+        let costs: [[u16; 3]; 4] = [
+            [words.nth(6).unwrap().parse().unwrap(), 0, 0],
+            [words.nth(5).unwrap().parse().unwrap(), 0, 0],
+            [words.nth(5).unwrap().parse().unwrap(), words.nth(2).unwrap().parse().unwrap(), 0],
+            [words.nth(5).unwrap().parse().unwrap(), 0, words.nth(2).unwrap().parse().unwrap()],
+        ];
+
+        let mut result = 0;
+        find_max(&costs, [0; 4], [1, 0, 0, 0], 0, 0, &mut result);
+        result
+    }).product::<u16>());
+}
