connor/advent-of-code-2023
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Found the inefficiency. Could probably write this better, but happy with the performance now

Browse Source
This commit is contained in:
Connor Johnstone
2023-12-11 01:04:30 -07:00
parent 2c041b10af
commit 0be182c7f0
4 changed files with 493 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

491
day_10/flamegraph.svg Normal file
View File

File diff suppressed because one or more lines are too long
Side by Side

After

Width:  |  Height:  |  Size: 1.3 MiB

BIN
day_10/perf.data Normal file
View File

Binary file not shown.

BIN
day_10/perf.data.old Normal file
View File

Binary file not shown.

6
day_10/src/lib.rs
View File

@@ -147,7 +147,7 @@ pub fn part2(input: &str) -> String {
// L's cancel F's, J's cancel 7's // L's cancel F's, J's cancel 7's
if count_map[[new_y,x]] != 0 { if count_map[[new_y,x]] != 0 {
// We can add either a half or full count // We can add either a half or full count
let next_character = input.lines().nth(new_y).unwrap().chars().nth(x).unwrap(); let next_character = std::str::from_utf8(&[input.as_bytes()[new_y*columns + x]]).unwrap().chars().next().unwrap();
if ['7', 'S'].contains(&next_character) { if ['7', 'S'].contains(&next_character) {
count_7 += 1; count_7 += 1;
} else if next_character == 'J' { } else if next_character == 'J' {
@@ -161,9 +161,7 @@ pub fn part2(input: &str) -> String {
} }
} }
} }
count_f = count_f.abs(); sum += (count_f.abs() + count_7.abs()) as f32 / 2.0;
count_7 = count_7.abs();
sum += (count_f + count_7) as f32 / 2.0;
if sum % 2.0 != 0.0 { if sum % 2.0 != 0.0 {
inside_points += 1; inside_points += 1;
} }