bert/adventofcode
1
0
Fork 0
mirror of https://github.com/bertptrs/adventofcode.git synced 2025-12-26 21:30:31 +01:00
Code Issues Projects Releases Wiki Activity

Correct formatting.

Browse Source
This commit is contained in:
Bert Peters
2019-02-18 15:13:48 +01:00
parent 171d9fa2e9
commit c16ef40d73
28 changed files with 316 additions and 195 deletions
Download Patch File Download Diff File Expand all files Collapse all files

49
2018/src/day22.rs
View File

@@ -93,8 +93,7 @@ impl Solution for Day22 {
let mut table = compute_table(target, depth);
table[target.1][target.0] = 0;
let result: usize = table.iter().flat_map(|x| x.iter())
.sum();
let result: usize = table.iter().flat_map(|x| x.iter()).sum();
result.to_string()
}
@@ -105,9 +104,21 @@ impl Solution for Day22 {
let mut todo = BinaryHeap::new();
let mut visited: HashSet<State> = HashSet::new();
let target_state = State { pos: target, climbing: false, torch: true };
let target_state = State {
pos: target,
climbing: false,
torch: true,
};
todo.push((Reverse((0, 0).manhattan(target)), Reverse(0), State { pos: (0, 0), climbing: false, torch: true }));
todo.push((
Reverse((0, 0).manhattan(target)),
Reverse(0),
State {
pos: (0, 0),
climbing: false,
torch: true,
},
));
while let Some((Reverse(approx), Reverse(dist), state)) = todo.pop() {
if visited.contains(&state) {
@@ -122,9 +133,21 @@ impl Solution for Day22 {
// Handle equipment changes
let changes = [
State { pos: state.pos, climbing: state.climbing, torch: !state.torch },
State { pos: state.pos, climbing: !state.climbing, torch: state.torch },
State { pos: state.pos, climbing: !state.climbing, torch: !state.torch },
State {
pos: state.pos,
climbing: state.climbing,
torch: !state.torch,
},
State {
pos: state.pos,
climbing: !state.climbing,
torch: state.torch,
},
State {
pos: state.pos,
climbing: !state.climbing,
torch: !state.torch,
},
];
for state in changes.iter().cloned() {
@@ -146,8 +169,15 @@ impl Solution for Day22 {
climbing: state.climbing,
};
if !visited.contains(&new_state) && new_state.is_valid(table[yn][xn]) && (x == xn || y == yn) {
todo.push((Reverse(dist + 1 + target.manhattan(new_state.pos)), Reverse(dist + 1), new_state));
if !visited.contains(&new_state)
&& new_state.is_valid(table[yn][xn])
&& (x == xn || y == yn)
{
todo.push((
Reverse(dist + 1 + target.manhattan(new_state.pos)),
Reverse(dist + 1),
new_state,
));
}
}
}
@@ -164,7 +194,6 @@ mod tests {
const SAMPLE_INPUT: &[u8] = include_bytes!("samples/22.txt");
#[test]
fn sample_part1() {
let mut instance = Day22::new();