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
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
//! This is my solution for [Advent of Code - Day 10 - _Cathode-Ray Tube_](https://adventofcode.com/2022/day/10)
//!
//! Interpret a set of instructions into pixels on a display

use std::fs;
use itertools::Itertools;
use crate::day_10::Instruction::{ADDX, NOOP};

/// Represent the two possible instruction types that the puzzle input can contain
#[derive(Eq, PartialEq, Debug, Copy, Clone)]
enum Instruction {
    ADDX(isize),
    NOOP,
}

/// The entry point for running the solutions with the 'real' puzzle input.
///
/// - The puzzle input is expected to be at `<project_root>/res/day-10-input`
/// - It is expected this will be called by [`super::main()`] when the user elects to run day 10.
pub fn run() {
    let contents =
        fs::read_to_string("res/day-10-input").expect("Failed to read file");

    let instructions = parse_input(&contents);

    println!(
        "The sum of sampled signal strengths is: {}",
        sample_and_sum_signal_strength(&instructions)
    );

    println!(
        "The screen shows: \n{}",
        draw_pixels(&instructions)
    );
}

/// Parse the puzzle input string
fn parse_input(input: &String) -> Vec<Instruction> {
    input.lines().map(parse_instruction).collect()
}

/// Parse a line of the input to a signal
fn parse_instruction(line: &str) -> Instruction {
    if line.starts_with("addx") {
        let (_, value) = line.split_once(" ").unwrap();
        ADDX(value.parse::<isize>().unwrap())
    } else {
        NOOP
    }
}

/// Interpret the instruction list into the signals sent to the display
fn to_signals(instructions: &Vec<Instruction>) -> Vec<isize> {
    let mut register = 1;
    let mut signals = Vec::new();
    for &instruction in instructions {
        match instruction {
            ADDX(x) => {
                signals.push(register);
                signals.push(register);
                register = register + x;
            }
            NOOP => signals.push(register)
        }
    }

    signals
}

/// Take specific signals and sum them
fn sample_and_sum_signal_strength(instructions: &Vec<Instruction>) -> isize {
    to_signals(instructions)
        .iter()
        .enumerate()
        .dropping(19)
        .step_by(40)
        .take(6)
        .map(|(step, &signal)| isize::try_from(step + 1).unwrap() * signal)
        .sum()
}

/// Interpret the signals as controlling a "sprite" that will cause a pixel to be lit if the sprite overlaps whilst the
/// pixel is drawn.
fn draw_pixels(instructions: &Vec<Instruction>) -> String {
    let mut lines = String::new();

    for (i, &signal) in to_signals(instructions).iter().enumerate() {
        let pos = isize::try_from(i % 40).unwrap();

        lines.push(
            if pos.abs_diff(signal) <= 1 { '█' } else { '.' }
        );

        if pos == 39 {
            lines.push('\n')
        }
    }

    lines
}

#[cfg(test)]
mod tests {
    use crate::day_10::Instruction::{ADDX, NOOP};
    use crate::day_10::{draw_pixels, Instruction, parse_input, sample_and_sum_signal_strength,
                        to_signals};

    #[test]
    fn can_parse() {
        let input = "noop
addx 3
addx -5".to_string();

        assert_eq!(parse_input(&input), vec![NOOP, ADDX(3), ADDX(-5)])
    }

    #[test]
    fn can_generate_signals() {
        assert_eq!(
            to_signals(&vec![NOOP, ADDX(3), ADDX(-5), NOOP]),
            vec!(1, 1, 1, 4, 4, -1)
        )
    }

    #[test]
    fn can_sum_signal_samples() {
        assert_eq!(
            sample_and_sum_signal_strength(&sample_instructions()),
            13140
        )
    }

    #[test]
    fn can_draw_pixels() {
        let expected = "██..██..██..██..██..██..██..██..██..██..
███...███...███...███...███...███...███.
████....████....████....████....████....
█████.....█████.....█████.....█████.....
██████......██████......██████......████
███████.......███████.......███████.....\n".to_string();

        assert_eq!(draw_pixels(&sample_instructions()), expected);
    }

    fn sample_instructions() -> Vec<Instruction> {
        let input = "addx 15
addx -11
addx 6
addx -3
addx 5
addx -1
addx -8
addx 13
addx 4
noop
addx -1
addx 5
addx -1
addx 5
addx -1
addx 5
addx -1
addx 5
addx -1
addx -35
addx 1
addx 24
addx -19
addx 1
addx 16
addx -11
noop
noop
addx 21
addx -15
noop
noop
addx -3
addx 9
addx 1
addx -3
addx 8
addx 1
addx 5
noop
noop
noop
noop
noop
addx -36
noop
addx 1
addx 7
noop
noop
noop
addx 2
addx 6
noop
noop
noop
noop
noop
addx 1
noop
noop
addx 7
addx 1
noop
addx -13
addx 13
addx 7
noop
addx 1
addx -33
noop
noop
noop
addx 2
noop
noop
noop
addx 8
noop
addx -1
addx 2
addx 1
noop
addx 17
addx -9
addx 1
addx 1
addx -3
addx 11
noop
noop
addx 1
noop
addx 1
noop
noop
addx -13
addx -19
addx 1
addx 3
addx 26
addx -30
addx 12
addx -1
addx 3
addx 1
noop
noop
noop
addx -9
addx 18
addx 1
addx 2
noop
noop
addx 9
noop
noop
noop
addx -1
addx 2
addx -37
addx 1
addx 3
noop
addx 15
addx -21
addx 22
addx -6
addx 1
noop
addx 2
addx 1
noop
addx -10
noop
noop
addx 20
addx 1
addx 2
addx 2
addx -6
addx -11
noop
noop
noop".to_string();

        parse_input(&input)
    }
}