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

Implement a very ugly part 2.

Browse Source
This commit is contained in:
Bert Peters
2018-12-13 11:24:03 +01:00
parent 973c9ed63b
commit e6c8c6b100
1 changed files with 46 additions and 43 deletions
Download Patch File Download Diff File Expand all files Collapse all files

39
2018/src/day13.rs
View File

@@ -51,8 +51,7 @@ impl Direction {
#[derive(Default, Debug)]
pub struct Day13 {
grid: Vec<Vec<char>>,
carts: Vec<(Coordinate, Direction, usize)>,
alive: Vec<bool>,
carts: Vec<(Coordinate, Direction, usize, bool)>,
}
impl Day13 {
@@ -61,7 +60,7 @@ impl Day13 {
}
fn alive(&self) -> usize {
self.alive.iter().filter(|&&x| x).count()
self.carts.iter().filter(|(_, _, _, x)| *x).count()
}
fn read_input(&mut self, input: &mut Read) {
@@ -74,24 +73,29 @@ impl Day13 {
'^' | 'v' => {
current.push('|');
let direction = Direction::from_char(c);
self.carts.push(((x, y), direction, 0));
self.carts.push(((x, y), direction, 0, true));
}
'>' | '<' => {
current.push('-');
let direction = Direction::from_char(c);
self.carts.push(((x, y), direction, 0));
self.carts.push(((x, y), direction, 0, true));
}
other => current.push(other),
}
}
self.grid.push(current);
}
self.alive.resize(self.carts.len(), true);
}
fn simulate(&mut self) -> Option<Coordinate> {
let mut collision = None;
for (coordinate, direction, turns) in self.carts.iter_mut() {
self.carts.sort_unstable_by_key(|&((x, y), _, _ , _)| (y, x));
for i in 0..self.carts.len() {
{
let (coordinate, direction, turns, alive) = self.carts.get_mut(i).unwrap();
if !*alive {
continue;
}
*coordinate = direction.run(*coordinate);
let &mut (x, y) = coordinate;
*direction = match self.grid[y][x] {
@@ -106,7 +110,6 @@ impl Day13 {
*turns = (*turns + 1) % 3;
new_dir
},
'/' => match *direction {
Direction::North | Direction::South => direction.clockwise(),
@@ -119,19 +122,20 @@ impl Day13 {
val => panic!("Invalid tile to be on: {}", val),
};
}
for i in 0..self.carts.len() {
for j in (i + 1)..self.carts.len() {
if !self.alive[i] {
for j in 0..self.carts.len() {
if i == j {
continue;
}
if !self.carts[i].3 {
break;
}
if !self.alive[j] {
if !self.carts[j].3 {
continue;
}
if self.carts[i].0 == self.carts[j].0 {
self.alive[i] = false;
self.alive[j] = false;
self.carts[i].3 = false;
self.carts[j].3 = false;
collision = Some(self.carts[i].0);
}
}
@@ -155,12 +159,11 @@ impl Solution for Day13 {
fn part2(&mut self, input: &mut Read) -> String {
self.read_input(input);
while self.alive() > 1 {
println!("{}", self.alive());
self.simulate();
}
for (i, ((x, y), _, _)) in self.carts.iter().enumerate() {
if self.alive[i] {
for &((x, y), _, _, alive) in &self.carts {
if alive {
return format!("{},{}", x, y)
}
}