ajet/advent-of-code
1
0
Fork 0
mirror of https://github.com/Ajetski/advent-of-code.git synced 2025-09-30 05:23:17 -09:00
Code Issues Packages Projects Releases Wiki Activity

finish day 22 part 1

Browse Source
This commit is contained in:
Adam Jeniski 2022-12-30 12:05:02 -05:00
parent 25544bc23e
commit fdd5179d31
1 changed files with 62 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

71
2022/src/day_22.rs
View File

@ -1,6 +1,7 @@
use Direction::*; use Direction::*;
use Instruction::*; use Instruction::*;
#[derive(Debug)]
struct State { struct State {
row: i32, row: i32,
col: i32, col: i32,
@ -9,10 +10,62 @@ struct State {
impl State { impl State {
fn do_instr( fn do_instr(
&mut self, &mut self,
_row_bounds: &Vec<CondensedFileOrRank>, row_bounds: &Vec<CondensedFileOrRank>,
_col_bounds: &Vec<CondensedFileOrRank>, col_bounds: &Vec<CondensedFileOrRank>,
instr: Instruction, instr: Instruction,
) { ) {
fn go(
loc: &mut i32,
bound_idx: i32,
bounds: &Vec<CondensedFileOrRank>,
dist: i32,
walk_positive: bool,
) {
let CondensedFileOrRank {
ref walls,
start_idx,
end_idx,
} = bounds[bound_idx as usize];
if walk_positive {
*loc = match walls.iter().skip_while(|wall| **wall <= *loc).next() {
Some(x) => std::cmp::min(*loc + dist, *x - 1),
None => {
if walls.is_empty() {
let len = end_idx - start_idx + 1;
start_idx + ((*loc - start_idx + dist).rem_euclid(len))
} else {
if *walls.first().unwrap() != start_idx && *loc + dist > end_idx {
std::cmp::min(
walls.first().unwrap() - 1,
start_idx + (*loc + dist - end_idx - 1),
)
} else {
std::cmp::min(*loc + dist, end_idx)
}
}
}
};
} else {
*loc = match walls.iter().rev().skip_while(|wall| **wall >= *loc).next() {
Some(x) => std::cmp::max(*loc - dist, *x + 1),
None => {
if walls.is_empty() {
let len = end_idx - start_idx + 1;
start_idx + (*loc - start_idx - dist).rem_euclid(len)
} else {
if *walls.last().unwrap() != end_idx && *loc - dist < start_idx {
std::cmp::max(
*walls.last().unwrap() + 1,
end_idx - (dist - (*loc - start_idx + 1)),
)
} else {
std::cmp::max(*loc - dist, start_idx)
}
}
}
};
}
}
match instr { match instr {
Clockwise => { Clockwise => {
self.dir = match self.dir { self.dir = match self.dir {
@ -30,18 +83,18 @@ impl State {
Down => Right, Down => Right,
} }
} }
Go(_n) => match self.dir { Go(n) => match self.dir {
Left => { Left => {
todo!() go(&mut self.col, self.row, &row_bounds, n, false);
} }
Right => { Right => {
todo!() go(&mut self.col, self.row, &row_bounds, n, true);
} }
Up => { Up => {
todo!() go(&mut self.row, self.col, &col_bounds, n, false);
} }
Down => { Down => {
todo!() go(&mut self.row, self.col, &col_bounds, n, true);
} }
}, },
} }
@ -164,7 +217,7 @@ fn part_one((row_bounds, col_bounds, instructions): Data) -> Output {
for instr in instructions { for instr in instructions {
state.do_instr(&row_bounds, &col_bounds, instr); state.do_instr(&row_bounds, &col_bounds, instr);
} }
state.row * 1000 + state.col + 4 + state.dir as i32 (state.row + 1) * 1000 + (state.col + 1) * 4 + state.dir as i32
} }
fn part_two(data: Data) -> Output { fn part_two(data: Data) -> Output {
todo!() todo!()
@ -176,5 +229,5 @@ advent_of_code_macro::generate_tests!(
part_one, part_one,
part_two, part_two,
sample tests [6_032, 0], sample tests [6_032, 0],
star tests [0, 0] star tests [149_138, 0]
); );