Mikescher/www.mikescher.com
1
0
Fork 0
Code Actions

Added AOC 2020 day 15

Browse Source
This commit is contained in:
Mike Schwörer 2020-12-15 13:55:26 +01:00
parent 9cdd8dc391
commit 2b706c191e
Signed by: Mikescher
GPG Key ID: D3C7172E0A70F8CF
4 changed files with 183 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

56
www/statics/aoc/2020/15_challenge.txt Normal file
View File

@ -0,0 +1,56 @@
--- Day 15: Rambunctious Recitation ---
You catch the airport shuttle and try to book a new flight to your vacation island. Due to the storm, all direct flights have been cancelled, but a route is available to get around the storm. You take it.
While you wait for your flight, you decide to check in with the Elves back at the North Pole. They're playing a memory game and are ever so excited to explain the rules!
In this game, the players take turns saying numbers. They begin by taking turns reading from a list of starting numbers (your puzzle input). Then, each turn consists of considering the most recently spoken number:
If that was the first time the number has been spoken, the current player says 0.
Otherwise, the number had been spoken before; the current player announces how many turns apart the number is from when it was previously spoken.
So, after the starting numbers, each turn results in that player speaking aloud either 0 (if the last number is new) or an age (if the last number is a repeat).
For example, suppose the starting numbers are 0,3,6:
Turn 1: The 1st number spoken is a starting number, 0.
Turn 2: The 2nd number spoken is a starting number, 3.
Turn 3: The 3rd number spoken is a starting number, 6.
Turn 4: Now, consider the last number spoken, 6. Since that was the first time the number had been spoken, the 4th number spoken is 0.
Turn 5: Next, again consider the last number spoken, 0. Since it had been spoken before, the next number to speak is the difference between the turn number when it was last spoken (the previous turn, 4) and the turn number of the time it was most recently spoken before then (turn 1). Thus, the 5th number spoken is 4 - 1, 3.
Turn 6: The last number spoken, 3 had also been spoken before, most recently on turns 5 and 2. So, the 6th number spoken is 5 - 2, 3.
Turn 7: Since 3 was just spoken twice in a row, and the last two turns are 1 turn apart, the 7th number spoken is 1.
Turn 8: Since 1 is new, the 8th number spoken is 0.
Turn 9: 0 was last spoken on turns 8 and 4, so the 9th number spoken is the difference between them, 4.
Turn 10: 4 is new, so the 10th number spoken is 0.
(The game ends when the Elves get sick of playing or dinner is ready, whichever comes first.)
Their question for you is: what will be the 2020th number spoken? In the example above, the 2020th number spoken will be 436.
Here are a few more examples:
Given the starting numbers 1,3,2, the 2020th number spoken is 1.
Given the starting numbers 2,1,3, the 2020th number spoken is 10.
Given the starting numbers 1,2,3, the 2020th number spoken is 27.
Given the starting numbers 2,3,1, the 2020th number spoken is 78.
Given the starting numbers 3,2,1, the 2020th number spoken is 438.
Given the starting numbers 3,1,2, the 2020th number spoken is 1836.
Given your starting numbers, what will be the 2020th number spoken?
Your puzzle answer was 273.
--- Part Two ---
Impressed, the Elves issue you a challenge: determine the 30000000th number spoken. For example, given the same starting numbers as above:
Given 0,3,6, the 30000000th number spoken is 175594.
Given 1,3,2, the 30000000th number spoken is 2578.
Given 2,1,3, the 30000000th number spoken is 3544142.
Given 1,2,3, the 30000000th number spoken is 261214.
Given 2,3,1, the 30000000th number spoken is 6895259.
Given 3,2,1, the 30000000th number spoken is 18.
Given 3,1,2, the 30000000th number spoken is 362.
Given your starting numbers, what will be the 30000000th number spoken?

1
www/statics/aoc/2020/15_input.txt Normal file
View File

@ -0,0 +1 @@
1,12,0,20,8,16

115
www/statics/aoc/2020/15_solution.rs Normal file
View File

@ -0,0 +1,115 @@
use crate::common::AdventOfCodeDay;
use std::collections::HashMap;
#[derive(Debug)]
pub struct Day15 {
input: Vec<u32>,
}
impl Day15 {
pub fn new() -> Self {
let input_bytes = include_bytes!("../res/15_input.txt");
let input_str = String::from_utf8_lossy(input_bytes);
let data = input_str
.split(',')
.map(|p| p.parse::<u32>().unwrap())
.collect::<Vec<u32>>();
Self {
input: data
}
}
}
struct MemoryIterator {
starters: Vec<u32>,
position: usize,
history: HashMap<u32, (usize, usize)>,
last_number: u32,
}
impl MemoryIterator {
pub fn new(initial: Vec<u32>) -> Self {
MemoryIterator {
starters: initial,
position: 1,
history: HashMap::new(),
last_number: 0,
}
}
}
impl Iterator for MemoryIterator {
type Item = u32;
fn next(&mut self) -> Option<u32> {
verboseln!();
let curr_pos = self.position;
self.position += 1;
verboseln!("[::] Get @ index {} (last_number = {})", curr_pos, self.last_number);
if curr_pos <= self.starters.len() {
self.last_number = self.starters[curr_pos-1];
verboseln!(" > history.insert({}, [{}, {}])", self.last_number, 0, curr_pos);
self.history.insert(self.last_number, (0, curr_pos));
verboseln!("Starter : {}", self.last_number);
return Some(self.last_number);
}
let (prev_1, prev_2) = self.history.get(&self.last_number).unwrap().clone();
if prev_1 == 0 {
self.last_number = 0;
if let Some((nprev_1, nprev_2)) = self.history.get_mut(&self.last_number) {
verboseln!(" > history.insert({}, [{}, {}]) [in-mem]", self.last_number, nprev_2, curr_pos);
*nprev_1 = *nprev_2;
*nprev_2 = curr_pos;
} else {
verboseln!(" > history.insert({}, [{}, {}])", self.last_number, 0, curr_pos);
self.history.insert(self.last_number, (0, curr_pos));
}
verboseln!("FirstTime : {}", self.last_number);
return Some(self.last_number);
} else {
self.last_number = (prev_2 - prev_1) as u32;
if let Some((nprev_1, nprev_2)) = self.history.get_mut(&self.last_number) {
verboseln!(" > history.insert({}, [{}, {}]) [in-mem]", self.last_number, nprev_2, curr_pos);
*nprev_1 = *nprev_2;
*nprev_2 = curr_pos;
} else {
verboseln!(" > history.insert({}, [{}, {}])", self.last_number, 0, curr_pos);
self.history.insert(self.last_number, (0, curr_pos));
}
verboseln!("Repeating : {} - {} = {}", prev_2, prev_1, self.last_number);
return Some(self.last_number);
}
}
}
impl AdventOfCodeDay for Day15 {
fn task_1(&self) -> String {
verboseln!("{:?}", self);
verboseln!("{:?}", MemoryIterator::new(self.input.clone()).skip(2018).take(5).collect::<Vec<u32>>());
return MemoryIterator::new(self.input.clone()).skip(2019).next().unwrap().to_string();
}
fn task_2(&self) -> String {
return MemoryIterator::new(self.input.clone()).skip(30_000_000 - 1).next().unwrap().to_string();
}
}

22
www/statics/aoc/__all.php
View File

@ -87,16 +87,16 @@ return
['day' => 12, 'parts' => 2, 'title' => 'Rain Risk', 'language' => 'rust', 'solutions' => ['2270', '138669'] ], ['day' => 12, 'parts' => 2, 'title' => 'Rain Risk', 'language' => 'rust', 'solutions' => ['2270', '138669'] ],
['day' => 13, 'parts' => 2, 'title' => 'Shuttle Search', 'language' => 'rust', 'solutions' => ['1915', '294354277694107'] ], ['day' => 13, 'parts' => 2, 'title' => 'Shuttle Search', 'language' => 'rust', 'solutions' => ['1915', '294354277694107'] ],
['day' => 14, 'parts' => 2, 'title' => 'Docking Data', 'language' => 'rust', 'solutions' => ['12408060320841', '4466434626828'] ], ['day' => 14, 'parts' => 2, 'title' => 'Docking Data', 'language' => 'rust', 'solutions' => ['12408060320841', '4466434626828'] ],
//['day' => 15, 'parts' => 2, 'title' => '', 'language' => 'rust', 'solutions' => ['', ''] ], ['day' => 15, 'parts' => 2, 'title' => 'Rambunctious Recitation', 'language' => 'rust', 'solutions' => ['273', '47205'] ],
//['day' => 16, 'parts' => 2, 'title' => '', 'language' => 'rust', 'solutions' => ['', ''] ], //['day' => 16, 'parts' => 2, 'title' => '', 'language' => 'rust', 'solutions' => [] ],
//['day' => 17, 'parts' => 2, 'title' => '', 'language' => 'rust', 'solutions' => ['', ''] ], //['day' => 17, 'parts' => 2, 'title' => '', 'language' => 'rust', 'solutions' => [] ],
//['day' => 18, 'parts' => 2, 'title' => '', 'language' => 'rust', 'solutions' => ['', ''] ], //['day' => 18, 'parts' => 2, 'title' => '', 'language' => 'rust', 'solutions' => [] ],
//['day' => 19, 'parts' => 2, 'title' => '', 'language' => 'rust', 'solutions' => ['', ''] ], //['day' => 19, 'parts' => 2, 'title' => '', 'language' => 'rust', 'solutions' => [] ],
//['day' => 20, 'parts' => 2, 'title' => '', 'language' => 'rust', 'solutions' => ['', ''] ], //['day' => 20, 'parts' => 2, 'title' => '', 'language' => 'rust', 'solutions' => [] ],
//['day' => 21, 'parts' => 2, 'title' => '', 'language' => 'rust', 'solutions' => ['', ''] ], //['day' => 21, 'parts' => 2, 'title' => '', 'language' => 'rust', 'solutions' => [] ],
//['day' => 22, 'parts' => 2, 'title' => '', 'language' => 'rust', 'solutions' => ['', ''] ], //['day' => 22, 'parts' => 2, 'title' => '', 'language' => 'rust', 'solutions' => [] ],
//['day' => 23, 'parts' => 2, 'title' => '', 'language' => 'rust', 'solutions' => ['', ''] ], //['day' => 23, 'parts' => 2, 'title' => '', 'language' => 'rust', 'solutions' => [] ],
//['day' => 24, 'parts' => 2, 'title' => '', 'language' => 'rust', 'solutions' => ['', ''] ], //['day' => 24, 'parts' => 2, 'title' => '', 'language' => 'rust', 'solutions' => [] ],
//['day' => 25, 'parts' => 1, 'title' => '', 'language' => 'rust', 'solutions' => ['', ''] ], //['day' => 25, 'parts' => 1, 'title' => '', 'language' => 'rust', 'solutions' => [] ],
], ],
]; ];