[Rust/2023/05] Add solution

README.md

@@ -1,11 +1,11 @@
 # AdventOfCode
 [Advent of Code](https://adventofcode.com/) solutions in [<img height=12 src=".assets/rs.svg"> Rust](Rust), [<img height=12 src=".assets/hs.svg"> Haskell](Haskell), [<img height=12 src=".assets/py.svg"> Python](Python), [<img height=12 src=".assets/apl.svg"> APL](APL) and [<img height=12 src=".assets/ua.png"> Uiua](Uiua)
 
-## [2023](https://adventofcode.com/2023) ([<img height=18 src=".assets/rs.svg"> Rust](Rust/2023): 4/25 | [<img height=18 src=".assets/ua.png"> Uiua](Uiua/2023): 4/25)
+## [2023](https://adventofcode.com/2023) ([<img height=18 src=".assets/rs.svg"> Rust](Rust/2023): 5/25 | [<img height=18 src=".assets/ua.png"> Uiua](Uiua/2023): 4/25)
 |Mo|Tu|We|Th|Fr|Sa|Su|
 |-|-|-|-|-|-|-|
 |||||[**1**](https://adventofcode.com/2023/day/1) [<img height=12 src=".assets/rs.svg">](Rust/2023/01.rs "Rust solution for 2023/01") [<img height=12 src=".assets/ua.png">](https://uiua.org/pad?src=JmZ3YSAiLi4vbGliLnVhIiAiTG9hZCDihpAgJnNjIgomaSAiLi4vbGliLnVhIiAiTG9hZCIKCk51bXMg4oaQIHsib25lIiAidHdvIiAidGhyZWUiICJmb3VyIiAiZml2ZSIKICAgICAgICAic2l4IiAic2V2ZW4iICJlaWdodCIgIm5pbmUifQpEaWdpdHMg4oaQICtAMeKHoTkKRmluZCDihpAgLysgw5crMeKHoTkg4omh4oqQ4oyVCkV4dHJhY3Qg4oaQICvDlzEwIOKIqeKKouKKg-KImOKHjCDilr3iiaAwLgoK4o2Y4oqfLysg4oqcKOKKnyDiiKlFeHRyYWN0IOKKg-KGpeKImCDiiKlGaW5kIERpZ2l0cyxOdW1zwqQp4omgQFxuLgo= "Uiua solution for 2023/01")|[**2**](https://adventofcode.com/2023/day/2) [<img height=12 src=".assets/rs.svg">](Rust/2023/02.rs "Rust solution for 2023/02") [<img height=12 src=".assets/ua.png">](https://uiua.org/pad?src=JmZ3YSAiLi4vbGliLnVhIiAiTG9hZCDihpAgJnNjIgomaSAiLi4vbGliLnVhIiAiTG9hZCIKCkNvbG9ycyDihpAgeyJyZWQiICJncmVlbiIgImJsdWUifQpQYXJzZUNvdW50IOKGkCDiipfiiplDb2xvcnMg4oqZ4oqQcGFyc2Ug4o2Y4oqf4oeMIOKKnOKWoeKJoEAgLgpQYXJzZVJvdW5kIOKGkCAvK-KKnCjDl-KsmjDihq_CpDPijZjiippQYXJzZUNvdW50KeKJoEAsLgpQYXJzZUdhbWUg4oaQIOKKnFBhcnNlUm91bmTiiaBAOy4g4oaYKzLiipdAOi4KCuKKnCgv4oalUGFyc2VHYW1lKeKJoEBcbi4K4oipLysg4oqDL8OXKMOXKzHih6Hip7suL8OX4omkMTJfMTNfMTQp4o2JCg== "Uiua solution for 2023/02")|[**3**](https://adventofcode.com/2023/day/3) [<img height=12 src=".assets/rs.svg">](Rust/2023/03.rs "Rust solution for 2023/03") [<img height=12 src=".assets/ua.png">](https://uiua.org/pad?src=JmZ3YSAiLi4vbGliLnVhIiAiTG9hZCDihpAgJnNjIgomaSAiLi4vbGliLnVhIiAiTG9hZCIKCk51bXMg4oaQICgKICDiiIo6K0Aw4oehMTAKICDDl8Ks4qyaMOKGuzBfwq8xLi4KICDDl-KNnOKZrVwrCikKU3ltYm9scyDihpAgw5fiioMo4omgQC4pKD0wTnVtcykKR2VhcnMg4oaQID1AKgpOZWlnaGJvcnMg4oaQIOKJoSjDl-KsmjDihrsp4piHMS0x4oehM18z4oipwqQKQSDihpAgKAogIE5laWdoYm9ycyDiioNTeW1ib2xzIE51bXMKICDiio_iip3ima0v4oalCikKQiDihpAgKAogIE5laWdoYm9ycyDiioNOdW1zIEdlYXJzCiAg4piHMeKNiQogIOKsmjDiiaEo4pa9PTLip7su4pa94omgMC7iip0pCiAg4omhL8OX4omh4oqP4oqZwqQKKQoK4oqDKOKKnOKImOKJoEBcbi4pKOKKgjDiiaFwYXJzZeKZrSByZWdleCAiXFxkKyIpCuKIqS8rIOKKg0IgQQo= "Uiua solution for 2023/03")|
-|[**4**](https://adventofcode.com/2023/day/4) [<img height=12 src=".assets/rs.svg">](Rust/2023/04.rs "Rust solution for 2023/04") [<img height=12 src=".assets/ua.png">](https://uiua.org/pad?src=JmZ3YSAiLi4vbGliLnVhIiAiTG9hZCDihpAgJnNjIgomaSAiLi4vbGliLnVhIiAiTG9hZCIKClBhcnNlQ2FyZCDihpAg4oip4oqU4o2Y4oqfIOKKnCjilqHiipxwYXJzZeKJoEAgLiniiaBAfC4g4oaYKzLiipdAOi4KTWF0Y2hlcyDihpAg4qe74pa94oiKLApQb2ludHMg4oaQIOKMiuKBv-KKmTItMQpXaW5NYXRyaXgg4oaQIOKsmjDiiaEo4oqCMeKKguKIqeKGr-KKmSgw4oqZMSkpIOKHoeKnuy7iioIwCkEg4oaQIC8r4omhUG9pbnRzCkIg4oaQIOKKojsg4o2l4oqD4oiYKC8rw5cp4qe7LiDiioPiiJgowqziiqIpIFdpbk1hdHJpeAoK4oqDQiBBIOKKnChNYXRjaGVzIFBhcnNlQ2FyZCniiaBAXG4uCg== "Uiua solution for 2023/04")|[**5**](https://adventofcode.com/2023/day/5)|[**6**](https://adventofcode.com/2023/day/6)|[**7**](https://adventofcode.com/2023/day/7)|[**8**](https://adventofcode.com/2023/day/8)|[**9**](https://adventofcode.com/2023/day/9)|[**10**](https://adventofcode.com/2023/day/10)|
+|[**4**](https://adventofcode.com/2023/day/4) [<img height=12 src=".assets/rs.svg">](Rust/2023/04.rs "Rust solution for 2023/04") [<img height=12 src=".assets/ua.png">](https://uiua.org/pad?src=JmZ3YSAiLi4vbGliLnVhIiAiTG9hZCDihpAgJnNjIgomaSAiLi4vbGliLnVhIiAiTG9hZCIKClBhcnNlQ2FyZCDihpAg4oip4oqU4o2Y4oqfIOKKnCjilqHiipxwYXJzZeKJoEAgLiniiaBAfC4g4oaYKzLiipdAOi4KTWF0Y2hlcyDihpAg4qe74pa94oiKLApQb2ludHMg4oaQIOKMiuKBv-KKmTItMQpXaW5NYXRyaXgg4oaQIOKsmjDiiaEo4oqCMeKKguKIqeKGr-KKmSgw4oqZMSkpIOKHoeKnuy7iioIwCkEg4oaQIC8r4omhUG9pbnRzCkIg4oaQIOKKojsg4o2l4oqD4oiYKC8rw5cp4qe7LiDiioPiiJgowqziiqIpIFdpbk1hdHJpeAoK4oqDQiBBIOKKnChNYXRjaGVzIFBhcnNlQ2FyZCniiaBAXG4uCg== "Uiua solution for 2023/04")|[**5**](https://adventofcode.com/2023/day/5) [<img height=12 src=".assets/rs.svg">](Rust/2023/05.rs "Rust solution for 2023/05")|[**6**](https://adventofcode.com/2023/day/6)|[**7**](https://adventofcode.com/2023/day/7)|[**8**](https://adventofcode.com/2023/day/8)|[**9**](https://adventofcode.com/2023/day/9)|[**10**](https://adventofcode.com/2023/day/10)|
 |[**11**](https://adventofcode.com/2023/day/11)|[**12**](https://adventofcode.com/2023/day/12)|[**13**](https://adventofcode.com/2023/day/13)|[**14**](https://adventofcode.com/2023/day/14)|[**15**](https://adventofcode.com/2023/day/15)|[**16**](https://adventofcode.com/2023/day/16)|[**17**](https://adventofcode.com/2023/day/17)|
 |[**18**](https://adventofcode.com/2023/day/18)|[**19**](https://adventofcode.com/2023/day/19)|[**20**](https://adventofcode.com/2023/day/20)|[**21**](https://adventofcode.com/2023/day/21)|[**22**](https://adventofcode.com/2023/day/22)|[**23**](https://adventofcode.com/2023/day/23)|[**24**](https://adventofcode.com/2023/day/24)|
 |[**25**](https://adventofcode.com/2023/day/25)|26|27|28|29|30|31|

Rust/2023/05.rs

@@ -0,0 +1,117 @@
+#![feature(test)]
+
+use std::ops::Range;
+
+use aoc::range::{RangeExt, RangeRel};
+use itertools::Itertools;
+
+type Map = Vec<RangeMap>;
+
+#[derive(Debug)]
+struct Input {
+    seeds: Vec<i64>,
+    maps: Vec<Map>,
+}
+
+#[derive(Debug)]
+struct RangeMap {
+    source: Range<i64>,
+    offset: i64,
+}
+
+fn setup(input: &str) -> Input {
+    let mut blocks = input.split("\n\n");
+    let seeds = blocks
+        .next()
+        .unwrap()
+        .split_whitespace()
+        .skip(1)
+        .map(|x| x.parse().unwrap())
+        .collect();
+    let maps = blocks
+        .map(|block| {
+            block
+                .lines()
+                .skip(1)
+                .map(|line| {
+                    let mut nums = line.split_whitespace().map(|n| n.parse().unwrap());
+                    let dest_start = nums.next().unwrap();
+                    let source_start = nums.next().unwrap();
+                    let len = nums.next().unwrap();
+                    RangeMap {
+                        source: source_start..source_start + len,
+                        offset: dest_start - source_start,
+                    }
+                })
+                .collect()
+        })
+        .collect();
+
+    Input { seeds, maps }
+}
+
+fn seed_to_location(seed: i64, maps: &[Map]) -> i64 {
+    maps.iter().fold(seed, |seed, map| {
+        map.iter()
+            .find(|range_map| range_map.source.contains(&seed))
+            .map(|range_map| range_map.offset)
+            .unwrap_or(0)
+            + seed
+    })
+}
+
+fn seed_range_to_location_range(
+    seeds: Range<i64>,
+    maps: &[Map],
+) -> impl IntoIterator<Item = Range<i64>> {
+    maps.iter().fold(vec![seeds], |mut seeds, map| {
+        let mut mapped = Vec::new();
+        for range_map in map {
+            let mut new_seeds = Vec::new();
+            for seed_range in seeds.iter().cloned() {
+                match seed_range.rel(&range_map.source) {
+                    RangeRel::LeftOf | RangeRel::RightOf => new_seeds.push(seed_range),
+                    RangeRel::ContainedIn => mapped.push(seed_range.add(range_map.offset)),
+                    RangeRel::Contains => {
+                        new_seeds.push(seed_range.start..range_map.source.start);
+                        mapped.push(range_map.source.add(range_map.offset));
+                        new_seeds.push(range_map.source.end..seed_range.end);
+                    }
+                    RangeRel::ContainsStartOf => {
+                        new_seeds.push(seed_range.start..range_map.source.start);
+                        mapped.push((range_map.source.start..seed_range.end).add(range_map.offset));
+                    }
+                    RangeRel::ContainsEndOf => {
+                        mapped.push((seed_range.start..range_map.source.end).add(range_map.offset));
+                        new_seeds.push(range_map.source.end..seed_range.end);
+                    }
+                }
+            }
+            seeds = new_seeds;
+        }
+        mapped.extend(seeds);
+        mapped
+    })
+}
+
+fn part1(input: &Input) -> i64 {
+    input
+        .seeds
+        .iter()
+        .map(|&seed| seed_to_location(seed, &input.maps))
+        .min()
+        .unwrap()
+}
+
+fn part2(input: &Input) -> i64 {
+    input
+        .seeds
+        .iter()
+        .tuples()
+        .flat_map(|(&start, &len)| seed_range_to_location_range(start..start + len, &input.maps))
+        .map(|range| range.start)
+        .min()
+        .unwrap()
+}
+
+aoc::main!(2023, 5, ex: 1);

Rust/Cargo.toml

@@ -234,3 +234,6 @@ path = "2023/03.rs"
 [[bin]]
 name = "2023_04"
 path = "2023/04.rs"
+[[bin]]
+name = "2023_05"
+path = "2023/05.rs"

Rust/lib/lib.rs

@@ -7,6 +7,7 @@ pub mod grid;
 pub mod iter_ext;
 pub mod math;
 pub mod parsing;
+pub mod range;
 
 extern crate test;
 

Rust/lib/range.rs

@@ -0,0 +1,51 @@
+use std::ops::{Add, Range};
+
+pub enum RangeRel {
+    LeftOf,
+    RightOf,
+    ContainedIn,
+    Contains,
+    ContainsStartOf,
+    ContainsEndOf,
+}
+
+pub trait RangeExt<T> {
+    fn rel(&self, other: &Range<T>) -> RangeRel
+    where
+        T: PartialOrd;
+
+    fn add<N>(&self, n: N) -> Range<<T as Add<N>>::Output>
+    where
+        T: Copy + Add<N>,
+        N: Copy;
+}
+
+impl<T> RangeExt<T> for Range<T> {
+    fn rel(&self, other: &Range<T>) -> RangeRel
+    where
+        T: PartialOrd,
+    {
+        debug_assert!(self.start <= self.end);
+        debug_assert!(other.start <= other.end);
+        match () {
+            _ if self.end <= other.start => RangeRel::LeftOf,
+            _ if self.start >= other.end => RangeRel::RightOf,
+            _ if self.start >= other.start && self.end <= other.end => RangeRel::ContainedIn,
+            _ if self.start <= other.start && self.end >= other.end => RangeRel::Contains,
+            _ if self.contains(&other.start) => RangeRel::ContainsStartOf,
+            _ if self.contains(&other.end) => RangeRel::ContainsEndOf,
+            _ => unreachable!(),
+        }
+    }
+
+    fn add<N>(&self, n: N) -> Range<<T as Add<N>>::Output>
+    where
+        T: Copy + Add<N>,
+        N: Copy,
+    {
+        Range {
+            start: self.start + n,
+            end: self.end + n,
+        }
+    }
+}

examples/2023/5/1

@@ -0,0 +1,33 @@
+seeds: 79 14 55 13
+
+seed-to-soil map:
+50 98 2
+52 50 48
+
+soil-to-fertilizer map:
+0 15 37
+37 52 2
+39 0 15
+
+fertilizer-to-water map:
+49 53 8
+0 11 42
+42 0 7
+57 7 4
+
+water-to-light map:
+88 18 7
+18 25 70
+
+light-to-temperature map:
+45 77 23
+81 45 19
+68 64 13
+
+temperature-to-humidity map:
+0 69 1
+1 0 69
+
+humidity-to-location map:
+60 56 37
+56 93 4

examples/2023/5/1.1

@@ -0,0 +1 @@
+35

examples/2023/5/1.2

@@ -0,0 +1 @@
+46