burnus/advent_of_code
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Solutions for 2022, as well as 2015-2018 and 2019 up to day 11

Browse source
This commit is contained in:
Chris Alge 2023-03-12 15:20:02 +01:00
commit 1895197c49
722 changed files with 375457 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

8
2018/day04_repose_record/Cargo.toml Normal file
View file

@ -0,0 +1,8 @@
[package]
name = "day04_repose_record"
version = "0.1.0"
edition = "2021"
# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
[dependencies]

75
2018/day04_repose_record/challenge.txt Normal file
View file

@ -0,0 +1,75 @@
You've sneaked into another supply closet - this time, it's across from the prototype suit manufacturing lab. You need to sneak inside and fix the issues with the suit, but there's a guard stationed outside the lab, so this is as close as you can safely get.
As you search the closet for anything that might help, you discover that you're not the first person to want to sneak in. Covering the walls, someone has spent an hour starting every midnight for the past few months secretly observing this guard post! They've been writing down the ID of *the one guard on duty that night* - the Elves seem to have decided that one guard was enough for the overnight shift - as well as when they fall asleep or wake up while at their post (your puzzle input).
For example, consider the following records, which have already been organized into chronological order:
```
[1518-11-01 00:00] Guard #10 begins shift
[1518-11-01 00:05] falls asleep
[1518-11-01 00:25] wakes up
[1518-11-01 00:30] falls asleep
[1518-11-01 00:55] wakes up
[1518-11-01 23:58] Guard #99 begins shift
[1518-11-02 00:40] falls asleep
[1518-11-02 00:50] wakes up
[1518-11-03 00:05] Guard #10 begins shift
[1518-11-03 00:24] falls asleep
[1518-11-03 00:29] wakes up
[1518-11-04 00:02] Guard #99 begins shift
[1518-11-04 00:36] falls asleep
[1518-11-04 00:46] wakes up
[1518-11-05 00:03] Guard #99 begins shift
[1518-11-05 00:45] falls asleep
[1518-11-05 00:55] wakes up
```
Timestamps are written using `year-month-day hour:minute` format. The guard falling asleep or waking up is always the one whose shift most recently started. Because all asleep/awake times are during the midnight hour (`00:00` - `00:59`), only the minute portion (`00` - `59`) is relevant for those events.
Visually, these records show that the guards are asleep at these times:
```
Date ID Minute
000000000011111111112222222222333333333344444444445555555555
012345678901234567890123456789012345678901234567890123456789
11-01 #10 .....####################.....#########################.....
11-02 #99 ........................................##########..........
11-03 #10 ........................#####...............................
11-04 #99 ....................................##########..............
11-05 #99 .............................................##########.....
```
The columns are Date, which shows the month-day portion of the relevant day; ID, which shows the guard on duty that day; and Minute, which shows the minutes during which the guard was asleep within the midnight hour. (The Minute column's header shows the minute's ten's digit in the first row and the one's digit in the second row.) Awake is shown as `.`, and asleep is shown as `#`.
Note that guards count as asleep on the minute they fall asleep, and they count as awake on the minute they wake up. For example, because Guard #10 wakes up at 00:25 on 1518-11-01, minute 25 is marked as awake.
If you can figure out the guard most likely to be asleep at a specific time, you might be able to trick that guard into working tonight so you can have the best chance of sneaking in. You have two strategies for choosing the best guard/minute combination.
*Strategy 1:* Find the guard that has the most minutes asleep. What minute does that guard spend asleep the most?
In the example above, Guard #10 spent the most minutes asleep, a total of 50 minutes (20+25+5), while Guard #99 only slept for a total of 30 minutes (10+10+10). Guard #*10* was asleep most during minute *24* (on two days, whereas any other minute the guard was asleep was only seen on one day).
While this example listed the entries in chronological order, your entries are in the order you found them. You'll need to organize them before they can be analyzed.
*What is the ID of the guard you chose multiplied by the minute you chose?* (In the above example, the answer would be `10 * 24 = 240`.)
Your puzzle answer was `50558`.
\--- Part Two ---
----------
*Strategy 2:* Of all guards, which guard is most frequently asleep on the same minute?
In the example above, Guard #*99* spent minute *45* asleep more than any other guard or minute - three times in total. (In all other cases, any guard spent any minute asleep at most twice.)
*What is the ID of the guard you chose multiplied by the minute you chose?* (In the above example, the answer would be `99 * 45 = 4455`.)
Your puzzle answer was `28198`.
Both parts of this puzzle are complete! They provide two gold stars: \*\*
At this point, you should [return to your Advent calendar](/2018) and try another puzzle.
If you still want to see it, you can [get your puzzle input](4/input).

75
2018/day04_repose_record/src/lib.rs Normal file
View file

@ -0,0 +1,75 @@
use std::collections::HashMap;
pub fn run(input: &str) -> (usize, usize) {
let mut log: Vec<_> = input.lines().collect();
log.sort();
let guards = read_log(&log);
let most_asleep = guards.iter().max_by_key(|(_id, minutes)|minutes.iter().sum::<usize>()).map(|(id, _m)| id).unwrap();
let sleepiest_minute = guards.get(most_asleep)
.unwrap()
.iter()
.enumerate()
.max_by_key(|(_min, time)| *time)
.map(|(min, _time)| min)
.unwrap();
let first = most_asleep * sleepiest_minute;
let (guard, sleepiest_minute_total) = guards.iter()
.max_by_key(|(_id, minutes)| minutes.iter().max())
.map(|(id, minutes)| (id, minutes.iter()
.enumerate()
.max_by_key(|(_min, asleep)| *asleep)
.map(|(min, _asleep)| min)
.unwrap()))
.unwrap();
let second = guard * sleepiest_minute_total;
(first, second)
}
fn read_log(log: &[&str]) -> HashMap<usize, [usize; 61]> {
let mut guards = HashMap::new();
let mut id = 0;
let mut asleep_since = 0;
log.iter().for_each(|line| {
let components: Vec<_> = line.split_whitespace().collect();
match components[2] {
"Guard" => {
id = components[3][1..].parse().unwrap();
},
"falls" => {
asleep_since = components[1][3..=4].parse().unwrap();
},
"wakes" => {
let awake: usize = components[1][3..=4].parse().unwrap();
if awake < asleep_since { panic!("Woke up too early: {line}"); }
let current = guards.entry(id).or_insert([0; 61]);
current.iter_mut().skip(asleep_since).take(awake - asleep_since).for_each(|m| *m += 1);
},
_ => panic!("Log line not recognized: {line}"),
}
});
guards
}
#[cfg(test)]
mod tests {
use super::*;
use std::fs::read_to_string;
fn read_file(name: &str) -> String {
read_to_string(name).expect(&format!("Unable to read file: {name}")[..]).trim().to_string()
}
#[test]
fn test_sample() {
let sample_input = read_file("tests/sample_input");
assert_eq!(run(&sample_input), (240, 4455));
}
#[test]
fn test_challenge() {
let challenge_input = read_file("tests/challenge_input");
assert_eq!(run(&challenge_input), (50558, 28198));
}
}

1151
2018/day04_repose_record/tests/challenge_input Normal file
View file

File diff suppressed because it is too large Load diff

17
2018/day04_repose_record/tests/sample_input Normal file
View file

@ -0,0 +1,17 @@
[1518-11-01 00:00] Guard #10 begins shift
[1518-11-01 00:05] falls asleep
[1518-11-01 00:25] wakes up
[1518-11-01 00:30] falls asleep
[1518-11-01 00:55] wakes up
[1518-11-01 23:58] Guard #99 begins shift
[1518-11-02 00:40] falls asleep
[1518-11-02 00:50] wakes up
[1518-11-03 00:05] Guard #10 begins shift
[1518-11-03 00:24] falls asleep
[1518-11-03 00:29] wakes up
[1518-11-04 00:02] Guard #99 begins shift
[1518-11-04 00:36] falls asleep
[1518-11-04 00:46] wakes up
[1518-11-05 00:03] Guard #99 begins shift
[1518-11-05 00:45] falls asleep
[1518-11-05 00:55] wakes up