/
main.rs
193 lines (162 loc) · 7.1 KB
/
main.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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
//! # Advent of Code 2016 - Day 2
//!
//! My solution to part 1 of Day 2 of the Advent of Code
//! 2016 challenge, "Bathroom Security." Full details of the
//! challenge can be found on [the challenge page][page].
//!
//! [page]: http://adventofcode.com/2016/day/2
pub trait Numpad: Sized + Copy {
/// Returns the default starting position
fn new() -> Self;
/// Returns the numerical value of the button
fn to_int(&self) -> u8;
/// Consumes this button and returns the button that is
/// above it.
fn up(self) -> Self;
/// Consumes this button and returns the button that is
/// below it.
fn down(self) -> Self;
/// Consumes this button and returns the button that is
/// to the left of it.
fn left(self) -> Self;
/// Consumes this button and returns the button that is
/// to the right of it.
fn right(self) -> Self;
/// Interperates the first of the input str as a series of
/// numpad instructions and returns the corresponding final button.
fn find_button(self, instr_line: &str) -> Self {
instr_line.chars()
.fold(self,
|button, direction| {
match direction {
'L' => button.left(),
'R' => button.right(),
'U' => button.up(),
'D' => button.down(),
_ => button
}
})
}
}
macro_rules! numpad_impl {
(
name => $name:ident ; start => $default:ident ;
$(
$button:ident => ($val:expr, $up:ident, $down:ident, $left:ident, $right:ident)
),+
) => {
#[derive(Debug, Copy, Clone)]
pub enum $name {
$($button),+
}
impl Numpad for $name {
fn new() -> Self {
$name::$default
}
fn to_int(&self) -> u8 {
match *self {
$($name::$button => $val),+
}
}
fn up(self) -> Self {
match self {
$($name::$button => $name::$up),+
}
}
fn down(self) -> Self {
match self {
$($name::$button => $name::$down),+
}
}
fn left(self) -> Self {
match self {
$($name::$button => $name::$left),+
}
}
fn right(self) -> Self {
match self {
$($name::$button => $name::$right),+
}
}
}
}
}
// 1 2 3
// 4 5 6
// 7 8 9
numpad_impl! {
name => NumpadButton ; start => N5 ;
// => (val, U , D , L , R )
N1 => (0x1, N1, N4, N1, N2),
N2 => (0x2, N2, N5, N1, N3),
N3 => (0x3, N3, N6, N2, N3),
N4 => (0x4, N1, N7, N4, N5),
N5 => (0x5, N2, N8, N4, N6),
N6 => (0x6, N3, N9, N5, N6),
N7 => (0x7, N4, N7, N7, N8),
N8 => (0x8, N5, N8, N7, N9),
N9 => (0x9, N6, N9, N8, N9)
}
// 1
// 2 3 4
// 5 6 7 8 9
// A B C
// D
numpad_impl! {
name => ActualButton; start => N5;
// => (val, U , D , L , R )
N1 => (0x1, N1, N3, N1, N1),
N2 => (0x2, N2, N6, N2, N3),
N3 => (0x3, N1, N7, N2, N4),
N4 => (0x4, N4, N8, N3, N4),
N5 => (0x5, N5, N5, N5, N6),
N6 => (0x6, N2, Na, N5, N7),
N7 => (0x7, N3, Nb, N6, N8),
N8 => (0x8, N4, Nc, N7, N9),
N9 => (0x9, N9, N9, N8, N9),
Na => (0xa, N6, Na, Na, Nb),
Nb => (0xb, N7, Nd, Na, Nc),
Nc => (0xc, N8, Nc, Nb, Nc),
Nd => (0xd, Nb, Nd, Nd, Nd)
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn input_test() {
let instructions = "ULL
RRDDD
LURDL
UUUUD";
assert_eq!(find_door_code::<NumpadButton>(instructions),
vec![1, 9, 8, 5]);
}
}
pub fn find_door_code<T: Numpad>(instructions: &str) -> Vec<u8> {
let mut buttons = Vec::with_capacity(4);
for (i, instr_line) in instructions.lines().enumerate() {
let old_button = if i == 0 { T::new() } else { buttons[i-1] };
let new_button = old_button.find_button(instr_line);
buttons.push(new_button);
}
buttons.iter().map(T::to_int).collect()
}
fn main() {
let challenge_input = "DLRURUDLULRDRUDDRLUUUDLDLDLRLRRDRRRLLLLLDDRRRDRRDRRRLRRURLRDUULRLRRDDLULRLLDUDLULURRLRLDUDLURURLDRDDULDRDRDLDLLULULLDDLRRUDULLUULRRLLLURDRLDDLDDLDRLRRLLRURRUURRRRLUDLRDDDDRDULRLLDDUURDUDRLUDULLUDLUDURRDRDUUUUDDUDLLLRLUULRUURDLRLLRRLRLLDLLRLLRRRURLRRLURRLDLLLUUDURUDDLLUURRDRDRRDLLDDLLRDRDRRLURLDLDRDLURLDULDRURRRUDLLULDUDRURULDUDLULULRRRUDLUURRDURRURRLRRLLRDDUUUUUDUULDRLDLLRRUDRRDULLLDUDDUDUURLRDLULUUDLDRDUUUDDDUDLDURRULUULUUULDRUDDLLLDLULLRLRLUDULLDLLRLDLDDDUUDURDDDLURDRRDDLDRLLRLRR
RLDUDURDRLLLLDDRRRURLLLRUUDDLRDRDDDUDLLUDDLRDURLDRDLLDRULDDRLDDDRLDRDDDRLLULDURRRLULDRLRDRDURURRDUDRURLDRLURDRLUULLULLDLUDUDRDRDDLDDDDRDURDLUDRDRURUDDLLLRLDDRURLLUDULULDDLLLDLUDLDULUUDLRLURLDRLURURRDUUDLRDDDDDRLDULUDLDDURDLURLUURDLURLDRURRLDLLRRUDRUULLRLDUUDURRLDURRLRUULDDLDLDUUDDRLDLLRRRUURLLUURURRURRLLLUDLDRRDLUULULUDDULLUDRLDDRURDRDUDULUDRLRRRUULLDRDRLULLLDURURURLURDLRRLLLDRLDUDLLLLDUUURULDDLDLLRRUDDDURULRLLUDLRDLUUDDRDDLLLRLUURLDLRUURDURDDDLLLLLULRRRURRDLUDLUURRDRLRUDUUUURRURLRDRRLRDRDULLDRDRLDURDDUURLRUDDDDDLRLLRUDDDDDURURRLDRRUUUDLURUUDRRDLLULDRRLRRRLUUUD
RDRURLLUUDURURDUUULLRDRLRRLRUDDUDRURLLDLUUDLRLLDDURRURLUDUDDURLURLRRURLLURRUDRUDLDRLLURLRUUURRUDDDURRRLULLLLURDLRLLDDRLDRLLRRDLURDLRDLDUDRUULLDUUUDLURRLLRUDDDUUURLURUUDRLRULUURLLRLUDDLLDURULLLDURDLULDLDDUDULUDDULLRDRURDRRLLDLDDDDRUDLDRRLLLRLLLRRULDLRLRLRLLDLRDRDLLUDRDRULDUURRDDDRLLRLDLDRDUDRULUDRDLDLDDLLRULURLLURDLRRDUDLULLDLULLUDRRDDRLRURRLDUDLRRUUDLDRLRLDRLRRDURRDRRDDULURUUDDUUULRLDRLLDURRDLUULLUDRDDDLRUDLRULLDDDLURLURLRDRLLURRRUDLRRLURDUUDRLRUUDUULLRUUUDUUDDUURULDLDLURLRURLRUDLULLULRULDRDRLLLRRDLU
RRRRDRLUUULLLRLDDLULRUUURRDRDRURRUURUDUULRULULRDRLRRLURDRRRULUUULRRUUULULRDDLLUURRLLDUDRLRRLDDLDLLDURLLUDLDDRRURLDLULRDUULDRLRDLLDLRULLRULLUDUDUDDUULDLUUDDLUDDUULLLLLURRDRULURDUUUDULRUDLLRUUULLUULLLRUUDDRRLRDUDDRULRDLDLLLLRLDDRRRULULLLDLRLURRDULRDRDUDDRLRLDRRDLRRRLLDLLDULLUDDUDDRULLLUDDRLLRRRLDRRURUUURRDLDLURRDLURULULRDUURLLULDULDUDLLULDDUURRRLDURDLUDURLDDRDUDDLLUULDRRLDLLUDRDURLLDRLDDUDURDLUUUUURRUULULLURLDUUULLRURLLLUURDULLUULDRULLUULRDRUULLRUDLDDLRLURRUUDRLRRRULRUUULRULRRLDLUDRRLL
ULRLDLLURDRRUULRDUDDURDDDLRRRURLDRUDDLUDDDLLLRDLRLLRRUUDRRDRUULLLULULUUDRRRDRDRUUUUULRURUULULLULDULURRLURUDRDRUDRURURUDLDURUDUDDDRLRLLLLURULUDLRLDDLRUDDUUDURUULRLLLDDLLLLRRRDDLRLUDDUULRRLLRDUDLLDLRRUUULRLRDLRDUDLLLDLRULDRURDLLULLLRRRURDLLUURUDDURLDUUDLLDDRUUDULDRDRDRDDUDURLRRRRUDURLRRUDUDUURDRDULRLRLLRLUDLURUDRUDLULLULRLLULRUDDURUURDLRUULDURDRRRLLLLLUUUULUULDLDULLRURLUDLDRLRLRLRDLDRUDULDDRRDURDDULRULDRLRULDRLDLLUDLDRLRLRUDRDDR";
let door_code = find_door_code::<NumpadButton>(challenge_input);
let actual_door_code = find_door_code::<ActualButton>(challenge_input);
print!("Idealised Bathroom code = ");
for code in door_code {
print!("{:x}", code);
}
println!("");
print!("Actual bathroom code = ");
for code in actual_door_code {
print!("{:X}", code);
}
println!("");
}