added solution for y2023/ex07

y2023/ex07/Cargo.toml

@@ -6,6 +6,7 @@ edition = "2021"
 # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
 
 [dependencies]
+nom = "7.1.3"
 
 [[bench]]
 name = "bench_y2023ex07"

y2023/ex07/README.md

@@ -1,15 +1,90 @@
-# Day 7: TODO: ADD TITLE HERE
+# Day 7: Camel Cards
 
 [Check it out on adventofcode.com](https://adventofcode.com/2023/day/7)
 
 ## Part One
 
-TODO: ADD DESCRIPTION HERE
+Your all-expenses-paid trip turns out to be a one-way, five-minute ride in an [airship](https://en.wikipedia.org/wiki/Airship). (At least it's a _cool_ airship!) It drops you off at the edge of a vast desert and descends back to Island Island.
+
+"Did you bring the parts?"
+
+You turn around to see an Elf completely covered in white clothing, wearing goggles, and riding a large [camel](https://en.wikipedia.org/wiki/Dromedary).
+
+"Did you bring the parts?" she asks again, louder this time. You aren't sure what parts she's looking for; you're here to figure out why the sand stopped.
+
+"The parts! For the sand, yes! Come with me; I will show you." She beckons you onto the camel.
+
+After riding a bit across the sands of Desert Island, you can see what look like very large rocks covering half of the horizon. The Elf explains that the rocks are all along the part of Desert Island that is directly above Island Island, making it hard to even get there. Normally, they use big machines to move the rocks and filter the sand, but the machines have broken down because Desert Island recently stopped receiving the _parts_ they need to fix the machines.
+
+You've already assumed it'll be your job to figure out why the parts stopped when she asks if you can help. You agree automatically.
+
+Because the journey will take a few days, she offers to teach you the game of _Camel Cards_. Camel Cards is sort of similar to [poker](https://en.wikipedia.org/wiki/List_of_poker_hands) except it's designed to be easier to play while riding a camel.
+
+In Camel Cards, you get a list of _hands_, and your goal is to order them based on the _strength_ of each hand. A hand consists of _five cards_ labeled one of `A`, `K`, `Q`, `J`, `T`, `9`, `8`, `7`, `6`, `5`, `4`, `3`, or `2`. The relative strength of each card follows this order, where `A` is the highest and `2` is the lowest.
+
+Every hand is exactly one _type_. From strongest to weakest, they are:
+
+*   _Five of a kind_, where all five cards have the same label: `AAAAA`
+*   _Four of a kind_, where four cards have the same label and one card has a different label: `AA8AA`
+*   _Full house_, where three cards have the same label, and the remaining two cards share a different label: `23332`
+*   _Three of a kind_, where three cards have the same label, and the remaining two cards are each different from any other card in the hand: `TTT98`
+*   _Two pair_, where two cards share one label, two other cards share a second label, and the remaining card has a third label: `23432`
+*   _One pair_, where two cards share one label, and the other three cards have a different label from the pair and each other: `A23A4`
+*   _High card_, where all cards' labels are distinct: `23456`
+
+Hands are primarily ordered based on type; for example, every _full house_ is stronger than any _three of a kind_.
+
+If two hands have the same type, a second ordering rule takes effect. Start by comparing the _first card in each hand_. If these cards are different, the hand with the stronger first card is considered stronger. If the first card in each hand have the _same label_, however, then move on to considering the _second card in each hand_. If they differ, the hand with the higher second card wins; otherwise, continue with the third card in each hand, then the fourth, then the fifth.
+
+So, `33332` and `2AAAA` are both _four of a kind_ hands, but `33332` is stronger because its first card is stronger. Similarly, `77888` and `77788` are both a _full house_, but `77888` is stronger because its third card is stronger (and both hands have the same first and second card).
+
+To play Camel Cards, you are given a list of hands and their corresponding _bid_ (your puzzle input). For example:
+
+    32T3K 765
+    T55J5 684
+    KK677 28
+    KTJJT 220
+    QQQJA 483
+
+
+This example shows five hands; each hand is followed by its _bid_ amount. Each hand wins an amount equal to its bid multiplied by its _rank_, where the weakest hand gets rank 1, the second-weakest hand gets rank 2, and so on up to the strongest hand. Because there are five hands in this example, the strongest hand will have rank 5 and its bid will be multiplied by 5.
+
+So, the first step is to put the hands in order of strength:
+
+*   `32T3K` is the only _one pair_ and the other hands are all a stronger type, so it gets rank _1_.
+*   `KK677` and `KTJJT` are both _two pair_. Their first cards both have the same label, but the second card of `KK677` is stronger (`K` vs `T`), so `KTJJT` gets rank _2_ and `KK677` gets rank _3_.
+*   `T55J5` and `QQQJA` are both _three of a kind_. `QQQJA` has a stronger first card, so it gets rank _5_ and `T55J5` gets rank _4_.
+
+Now, you can determine the total winnings of this set of hands by adding up the result of multiplying each hand's bid with its rank (`765` \* 1 + `220` \* 2 + `28` \* 3 + `684` \* 4 + `483` \* 5). So the _total winnings_ in this example are `_6440_`.
+
+Find the rank of every hand in your set. _What are the total winnings?_
+
+Your puzzle answer was `248217452`.
 
-Your puzzle answer was `?`. (TODO: )
 
 ## Part Two
 
-TODO: ADD DESCRIPTION HERE
+To make things a little more interesting, the Elf introduces one additional rule. Now, `J` cards are [jokers](https://en.wikipedia.org/wiki/Joker_(playing_card)) - wildcards that can act like whatever card would make the hand the strongest type possible.
+
+To balance this, _`J` cards are now the weakest_ individual cards, weaker even than `2`. The other cards stay in the same order: `A`, `K`, `Q`, `T`, `9`, `8`, `7`, `6`, `5`, `4`, `3`, `2`, `J`.
+
+`J` cards can pretend to be whatever card is best for the purpose of determining hand type; for example, `QJJQ2` is now considered _four of a kind_. However, for the purpose of breaking ties between two hands of the same type, `J` is always treated as `J`, not the card it's pretending to be: `JKKK2` is weaker than `QQQQ2` because `J` is weaker than `Q`.
+
+Now, the above example goes very differently:
+
+    32T3K 765
+    T55J5 684
+    KK677 28
+    KTJJT 220
+    QQQJA 483
+
+
+*   `32T3K` is still the only _one pair_; it doesn't contain any jokers, so its strength doesn't increase.
+*   `KK677` is now the only _two pair_, making it the second-weakest hand.
+*   `T55J5`, `KTJJT`, and `QQQJA` are now all _four of a kind_! `T55J5` gets rank 3, `QQQJA` gets rank 4, and `KTJJT` gets rank 5.
+
+With the new joker rule, the total winnings in this example are `_5905_`.
+
+Using the new joker rule, find the rank of every hand in your set. _What are the new total winnings?_
 
-Your puzzle answer was `?`. (TODO: )
+Your puzzle answer was `245576185`.

y2023/ex07/src/lib.rs

@@ -1,23 +1,66 @@
-pub fn part1(input: &str) -> usize {
-    0
+use std::collections::BinaryHeap;
+
+use models_p2::HandWithBetP2;
+mod models;
+mod models_p2;
+
+pub fn part1(input: &str) -> u64 {
+    let mut hands_heap = BinaryHeap::new();
+    for line in input.lines() {
+        let (_, hand_with_bet) = models::parse_hand_with_bet(line).unwrap();
+        hands_heap.push(hand_with_bet); // reverse makes it a min heap
+    }
+
+    hands_heap
+        .into_sorted_vec()
+        .iter()
+        .enumerate()
+        .map(|(i, hand_with_bet)| (i + 1) as u64 * hand_with_bet.bet)
+        .sum()
 }
 
-pub fn part2(input: &str) -> usize {
-    0
+pub fn part2(input: &str) -> u64 {
+    let mut hands_heap: BinaryHeap<HandWithBetP2> = BinaryHeap::new();
+    for line in input.lines() {
+        let (_, hand_with_bet) = models::parse_hand_with_bet(line).unwrap();
+        hands_heap.push(hand_with_bet.into()); // reverse makes it a min heap
+    }
+
+    hands_heap
+        .into_sorted_vec()
+        .iter()
+        .enumerate()
+        .map(|(i, hand_with_bet)| (i + 1) as u64 * hand_with_bet.bet)
+        .sum()
 }
 
 #[cfg(test)]
 mod tests {
     use super::*;
     const INPUT: &str = include_str!("../input.txt");
+    const EXAMPLE_INPUT: &str = "32T3K 765
+T55J5 684
+KK677 28
+KTJJT 220
+QQQJA 483";
+
+    #[test]
+    fn test_part1_example() {
+        assert_eq!(part1(EXAMPLE_INPUT), 6440);
+    }
 
     #[test]
     fn test_part1() {
-        assert_eq!(part1(INPUT), 0);
+        assert_eq!(part1(INPUT), 248217452);
+    }
+
+    #[test]
+    fn test_part2_example() {
+        assert_eq!(part2(EXAMPLE_INPUT), 5905);
     }
 
     #[test]
     fn test_part2() {
-        assert_eq!(part2(INPUT), 0);
+        assert_eq!(part2(INPUT), 245576185);
     }
 }