JonOfUs/advent-of-code-2023
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Compare commits

base: JonOfUs:5000ae73445f4f101a1e718d55e7d9c6f83cb0d9
Branches Tags
JonOfUs:main
..
compare: JonOfUs:3027ffbdd7e002929a860b67110e085162a0f521
Branches Tags
JonOfUs:main

No commits in common. "5000ae73445f4f101a1e718d55e7d9c6f83cb0d9" and "3027ffbdd7e002929a860b67110e085162a0f521" have entirely different histories.
5000ae7344 ... 3027ffbdd7

6 changed files with 33 additions and 164 deletions
Show stats Expand all files Collapse all files

1
res/15/example
View file

@ -1 +0,0 @@
rn=1,cm-,qp=3,cm=2,qp-,pc=4,ot=9,ab=5,pc-,pc=6,ot=7

1
res/15/input
View file

File diff suppressed because one or more lines are too long

1
src/days/d13.rs
View file

@ -19,6 +19,7 @@ pub fn solve() {
let result: usize = patterns
.iter()
.map(|block| {
// check columns
let mut ks: Vec<usize> = vec![];
for k in 1..block[0].len() {

46
src/days/d14.rs
View file

@ -1,4 +1,4 @@
use std::{collections::HashMap, fs};
use std::{fs, collections::HashMap};
pub fn solve() {
let path = "res/14/input";
@ -6,8 +6,7 @@ pub fn solve() {
let contents = fs::read_to_string(path).expect("I/O error, wrong path?");
//let contents = BufReader::new(fs::File::open(path).expect("I/O error, wrong path?"));
let rocks_init: Vec<Vec<char>> = contents
.lines()
let rocks_init: Vec<Vec<char>> = contents.lines()
.map(|line| line.chars().collect::<Vec<_>>())
.collect();
@ -33,6 +32,7 @@ pub fn solve() {
println!("Result 1: {result}");
let mut counter = 1;
let mut cache: HashMap<Vec<Vec<char>>, usize> = HashMap::new();
let mut cache_used = false;
@ -42,8 +42,7 @@ pub fn solve() {
for y in 0..rocks[0].len() {
if rocks[x][y] == 'O' {
match counter % 4 {
0 => {
// north
0 => { // north
let mut new_x = x;
while new_x > 0 {
new_x -= 1;
@ -54,9 +53,8 @@ pub fn solve() {
}
rocks[x][y] = '.';
rocks[new_x][y] = 'O';
}
_ => {
// west
},
_ => { // west
let mut new_y = y;
while new_y > 0 {
new_y -= 1;
@ -69,6 +67,7 @@ pub fn solve() {
rocks[x][new_y] = 'O';
}
}
}
}
}
@ -77,10 +76,9 @@ pub fn solve() {
for y in (0..rocks[0].len()).rev() {
if rocks[x][y] == 'O' {
match counter % 4 {
3 => {
// east
3 => { // east
let mut new_y = y;
while new_y < rocks[0].len() - 1 {
while new_y < rocks[0].len()-1 {
new_y += 1;
if rocks[x][new_y] == '#' || rocks[x][new_y] == 'O' {
new_y -= 1;
@ -89,11 +87,10 @@ pub fn solve() {
}
rocks[x][y] = '.';
rocks[x][new_y] = 'O';
}
_ => {
// south
},
_ => { // south
let mut new_x = x;
while new_x < rocks.len() - 1 {
while new_x < rocks.len()-1 {
new_x += 1;
if rocks[new_x][y] == '#' || rocks[new_x][y] == 'O' {
new_x -= 1;
@ -104,32 +101,33 @@ pub fn solve() {
rocks[new_x][y] = 'O';
}
}
}
}
}
}
counter += 1;
if counter % 4 == 0 && !cache_used {
if counter % 4 == 0 && !cache_used{
let cycle_start = cache.get(&rocks);
match cycle_start {
None => {
cache.insert(rocks.clone(), counter);
}
None => { cache.insert(rocks.clone(), counter); },
Some(x) => {
let cycle = counter - x;
counter += (((4000000000 - counter) / cycle) as usize) * cycle;
counter += (((4000000000-counter)/cycle) as usize) * cycle;
cache_used = true;
}
}
}
}
result = rocks
.iter()
.enumerate()
.map(|(i_row, row)| row.iter().filter(|c| **c == 'O').count() * (rocks.len() - i_row))
result = rocks.iter().enumerate()
.map(|(i_row, row)| {
row.iter().filter(|c| **c == 'O').count() * (rocks.len() - i_row)
})
.sum();
println!("Result 2: {result}");

59
src/days/d15.rs
View file

@ -1,59 +0,0 @@
use std::{collections::HashMap, fs};
pub fn solve() {
let path = "res/15/input";
let mut contents = fs::read_to_string(path).expect("I/O error, wrong path?");
//let contents = BufReader::new(fs::File::open(path).expect("I/O error, wrong path?"));
contents.retain(|c| !c.is_whitespace());
let result: usize = contents
.split(',')
.map(|p| p.chars().fold(0, |x, y| ((x + y as usize) * 17) % 256))
.sum();
println!("Result 1: {result}");
let mut boxes: HashMap<usize, Vec<(&str, usize)>> = HashMap::new();
for p in contents.split(',') {
let (t, n) = match p.contains('=') {
true => {
let (t, n) = p.split_once('=').unwrap();
(t, n.parse::<usize>().unwrap())
}
false => {
let (t, _) = p.split_once('-').unwrap();
(t, 0usize)
}
};
let i = t.chars().fold(0, |x, y| ((x + y as usize) * 17) % 256);
let v = boxes.entry(i).or_insert(vec![]);
if n == 0 {
if v.iter().any(|(p, _)| *p == t) {
v.remove(v.iter().position(|(p, _)| *p == t).unwrap());
}
} else {
if v.iter().any(|(p, _)| *p == t) {
let pos = v.iter().position(|(p, _)| *p == t).unwrap();
v[pos] = (t, n);
} else {
v.push((t, n))
}
}
}
dbg!(&boxes);
let result: usize = boxes
.iter()
.map(|(k, v)| {
v.iter()
.enumerate()
.map(|(i, (_, n))| (k + 1) * (i + 1) * n)
.sum::<usize>()
})
.sum();
println!("Result 2: {result}");
}

75
src/main.rs
View file

@ -1,81 +1,12 @@
pub mod days;
#[macro_use]
extern crate scan_fmt;
use std::time::Instant;
#[macro_use] extern crate scan_fmt;
fn main() {
days::d15::solve()
days::d14::solve()
//_all_days()
}
fn _all_days() {
let start = Instant::now();
println!("\nDay 1");
println!("Day 1");
days::d01::solve();
print_elapsed(&start);
println!("\nDay 2");
days::d02::solve();
print_elapsed(&start);
println!("\nDay 3");
days::d03::solve();
print_elapsed(&start);
println!("\nDay 4");
days::d04::solve();
print_elapsed(&start);
println!("\nDay 5");
days::d05::solve();
print_elapsed(&start);
println!("\nDay 6");
days::d06::solve();
print_elapsed(&start);
println!("\nDay 7");
days::d07::solve();
print_elapsed(&start);
println!("\nDay 8");
days::d08::solve();
print_elapsed(&start);
println!("\nDay 9");
days::d09::solve();
print_elapsed(&start);
println!("\nDay 10");
days::d10::solve();
print_elapsed(&start);
println!("\nDay 11");
days::d11::solve();
print_elapsed(&start);
println!("\nDay 12");
days::d12::solve();
print_elapsed(&start);
println!("\nDay 13");
days::d13::solve();
print_elapsed(&start);
println!("\nDay 14");
days::d14::solve();
print_elapsed(&start);
println!("\nDay 15");
days::d15::solve();
print_elapsed(&start);
}
fn print_elapsed(start: &Instant) {
println!(
" Elapsed: {}.{}ms",
start.elapsed().as_millis(),
start.elapsed().as_micros() % 1000
)
}