[2025] Init year

Author: connorslade

.github/workflows/aoc_2025.yml

@@ -0,0 +1,21 @@
+name: aoc_2025
+on:
+  workflow_dispatch:
+  push:
+    paths:
+      - "common/**"
+      - "aoc_2025/**"
+
+env:
+  CRATE: aoc_2025
+
+jobs:
+  build:
+    runs-on: ubuntu-latest
+
+    steps:
+      - uses: actions/checkout@v2
+      - name: Build
+        run: cargo build -p ${{ env.CRATE }}
+      - name: Test
+        run: cargo test -p ${{ env.CRATE }}

Cargo.lock

@@ -12,6 +12,7 @@ members = [
     "aoc_2022",
     "aoc_2023",
     "aoc_2024",
+    "aoc_2025",
 ]
 
 [dependencies]
@@ -20,6 +21,7 @@ aoc_2021 = { path = "aoc_2021" }
 aoc_2022 = { path = "aoc_2022" }
 aoc_2023 = { path = "aoc_2023" }
 aoc_2024 = { path = "aoc_2024" }
+aoc_2025 = { path = "aoc_2025" }
 
 clap = { version = "4.0.29", features = ["derive"] }
 chrono = "0.4.31"

Cargo.toml

@@ -3,6 +3,10 @@
 My Rusty solutions to [Advent Of Code](https://adventofcode.com)!
 Thank you to [Eric Wastl](http://was.tl) for running this incredible yearly event!
 
+## [2025](https://adventofcode.com/2025) [![aoc_2025](https://github.com/connorslade/advent-of-code/actions/workflows/aoc_2025.yml/badge.svg)](https://github.com/connorslade/advent-of-code/actions/workflows/aoc_2025.yml)
+
+<!-- MARKER -->
+
 ## [2024](https://adventofcode.com/2024) [![aoc_2024](https://github.com/connorslade/advent-of-code/actions/workflows/aoc_2024.yml/badge.svg)](https://github.com/connorslade/advent-of-code/actions/workflows/aoc_2024.yml)
 
 - [Day 01: Historian Hysteria](aoc_2024/src/day_01.rs)
@@ -30,7 +34,6 @@ Thank you to [Eric Wastl](http://was.tl) for running this incredible yearly even
 - [Day 23: LAN Party](aoc_2024/src/day_23.rs)
 - [Day 24: Crossed Wires](aoc_2024/src/day_24.rs)
 - [Day 25: Code Chronicle](aoc_2024/src/day_25.rs)
-<!-- MARKER -->
 
 ## [2023](https://adventofcode.com/2023) [![aoc_2023](https://github.com/connorslade/advent-of-code/actions/workflows/aoc_2023.yml/badge.svg)](https://github.com/connorslade/advent-of-code/actions/workflows/aoc_2023.yml)
 

README.md

@@ -6,12 +6,16 @@ use nd_vec::{vector, Vec2};
 
 solution!("RAM Run", 18);
 
+// Drop the first 1024 boxes, then find the length of the shortest path through
+// the board.
 fn part_a(input: &str) -> Answer {
     let mut map = Map::parse(input, vector!(71, 71));
     map.fill_to(1023);
     map.shortest_path().into()
 }
 
+// Binary search to find the first box that when dropped causes the maze to be
+// unsolvable.
 fn part_b(input: &str) -> Answer {
     let mut map = Map::parse(input, vector!(71, 71));
 

aoc_2024/src/day_18.rs

@@ -0,0 +1,13 @@
+[package]
+name = "aoc_2025"
+version = "0.1.0"
+edition = "2024"
+
+[dependencies]
+aoc_lib = { path = "../aoc_lib" }
+common = { path = "../common" }
+
+indoc = "2.0.4"
+itertools = "0.13.0"
+nd_vec = { git = "https://github.com/connorslade/nd-vec.git" }
+rayon = "1.10.0"

aoc_2025/Cargo.toml

@@ -0,0 +1,7 @@
+use common::Solution;
+
+// [import_marker]
+
+pub const SOLUTIONS: &[Solution] = &[
+    // [list_marker]
+];

aoc_2025/src/lib.rs

@@ -24,6 +24,7 @@ fn get_year(year: u16) -> &'static [Solution] {
         2022 => aoc_2022::SOLUTIONS,
         2023 => aoc_2023::SOLUTIONS,
         2024 => aoc_2024::SOLUTIONS,
+        2025 => aoc_2025::SOLUTIONS,
         _ => &[],
     }
 }