-
Notifications
You must be signed in to change notification settings - Fork 0
/
day13.rs
128 lines (107 loc) · 3.65 KB
/
day13.rs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
use std::cell::RefCell;
use std::collections::HashMap;
use std::convert::TryFrom;
use crate::intcode_computer::Computer;
use crate::parse_custom_separated;
#[derive(Debug, Copy, Clone, Eq, PartialEq)]
enum Tile {
Empty = 0,
Wall,
Block,
HPaddle,
Ball,
}
impl TryFrom<isize> for Tile {
type Error = String;
fn try_from(value: isize) -> Result<Self, Self::Error> {
match value {
0 => Ok(Tile::Empty),
1 => Ok(Tile::Wall),
2 => Ok(Tile::Block),
3 => Ok(Tile::HPaddle),
4 => Ok(Tile::Ball),
_ => Err(format!("Invalid Tile {}", value)),
}
}
}
type Location = (isize, isize);
pub fn star_one(input: &str) -> usize {
let program: Vec<isize> = parse_custom_separated(input, ",").collect();
let mut computer = Computer::new(program);
computer.set_input(|| Some(0));
let mut tiles: HashMap<Location, Tile> = HashMap::new();
while !computer.is_halted() {
computer.run_until_halt_or_paused(true);
// X
let x = computer.last_output().unwrap();
computer.run_until_halt_or_paused(true);
// Y
let y = computer.last_output().unwrap();
computer.run_until_halt_or_paused(true);
// Tile
let tile = Tile::try_from(computer.last_output().unwrap()).unwrap();
tiles
.entry((x, y))
.and_modify(|e| *e = tile)
.or_insert(tile);
}
tiles.values().filter(|&tile| tile == &Tile::Block).count()
}
pub fn star_two(input: &str) -> isize {
let mut program: Vec<isize> = parse_custom_separated(input, ",").collect();
program[0] = 2; // Add quarters
let mut computer = Computer::new(program);
let next_input: RefCell<isize> = RefCell::new(0);
computer.set_input(|| Some(*next_input.borrow()));
let mut tiles: HashMap<Location, Tile> = HashMap::new();
let mut score = None;
let mut paddle_target_location: Option<isize> = None;
let mut paddle_location: Option<isize> = None;
loop {
computer.run_until_halt_or_paused(true);
// X
let x = computer.last_output().unwrap();
if x == -1 || computer.is_halted() {
computer.run_until_halt_or_paused(true);
computer.run_until_halt_or_paused(true);
score = computer.last_output();
} else {
computer.run_until_halt_or_paused(true);
// Y
let y = computer.last_output().unwrap();
computer.run_until_halt_or_paused(true);
// Tile
let tile = Tile::try_from(computer.last_output().unwrap()).unwrap();
match tile {
Tile::Ball => {
paddle_target_location = Some(x);
}
Tile::HPaddle => {
paddle_location = Some(x);
}
_ => (),
}
*next_input.borrow_mut() = paddle_target_location
.and_then(|target_location| {
paddle_location.map(|paddle_location| {
if target_location < paddle_location {
-1
} else if target_location > paddle_location {
1
} else {
0
}
})
})
.unwrap_or(0);
tiles
.entry((x, y))
.and_modify(|e| *e = tile)
.or_insert(tile);
}
if !tiles.values().any(|&v| v == Tile::Block) && computer.is_halted() {
break;
}
}
score.unwrap()
}