aboutsummaryrefslogtreecommitdiffstats
path: root/src/year_2019/day10.rs
blob: ae6a56ff67db34cf1ea0e6aa4d0855e471831ada (plain)
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
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
//! --- Day 10: Monitoring Station ---

/// You fly into the asteroid belt and reach the Ceres monitoring station. The Elves here have an emergency: they're having trouble tracking all of the asteroids and can't be sure they're safe.
///
/// The Elves would like to build a new monitoring station in a nearby area of space; they hand you a map of all of the asteroids in that region (your puzzle input).
///
/// The map indicates whether each position is empty (.) or contains an asteroid (#). The asteroids are much smaller than they appear on the map, and every asteroid is exactly in the center of its marked position. The asteroids can be described with X,Y coordinates where X is the distance from the left edge and Y is the distance from the top edge (so the top-left corner is 0,0 and the position immediately to its right is 1,0).
///
/// Your job is to figure out which asteroid would be the best place to build a new monitoring station. A monitoring station can detect any asteroid to which it has direct line of sight - that is, there cannot be another asteroid exactly between them. This line of sight can be at any angle, not just lines aligned to the grid or diagonally. The best location is the asteroid that can detect the largest number of other asteroids.
///
/// For example, consider the following map:
///
/// .#..#
/// .....
/// #####
/// ....#
/// ...##
///
/// The best location for a new monitoring station on this map is the highlighted asteroid at 3,4 because it can detect 8 asteroids, more than any other location. (The only asteroid it cannot detect is the one at 1,0; its view of this asteroid is blocked by the asteroid at 2,2.) All other asteroids are worse locations; they can detect 7 or fewer other asteroids. Here is the number of other asteroids a monitoring station on each asteroid could detect:
///
/// .7..7
/// .....
/// 67775
/// ....7
/// ...87
///
/// Here is an asteroid (#) and some examples of the ways its line of sight might be blocked. If there were another asteroid at the location of a capital letter, the locations marked with the corresponding lowercase letter would be blocked and could not be detected:
///
/// #.........
/// ...A......
/// ...B..a...
/// .EDCG....a
/// ..F.c.b...
/// .....c....
/// ..efd.c.gb
/// .......c..
/// ....f...c.
/// ...e..d..c
///
/// Here are some larger examples:
///
///     Best is 5,8 with 33 other asteroids detected:
///
///     ......#.#.
///     #..#.#....
///     ..#######.
///     .#.#.###..
///     .#..#.....
///     ..#....#.#
///     #..#....#.
///     .##.#..###
///     ##...#..#.
///     .#....####
///
///     Best is 1,2 with 35 other asteroids detected:
///
///     #.#...#.#.
///     .###....#.
///     .#....#...
///     ##.#.#.#.#
///     ....#.#.#.
///     .##..###.#
///     ..#...##..
///     ..##....##
///     ......#...
///     .####.###.
///
///     Best is 6,3 with 41 other asteroids detected:
///
///     .#..#..###
///     ####.###.#
///     ....###.#.
///     ..###.##.#
///     ##.##.#.#.
///     ....###..#
///     ..#.#..#.#
///     #..#.#.###
///     .##...##.#
///     .....#.#..
///
///     Best is 11,13 with 210 other asteroids detected:
///
///     .#..##.###...#######
///     ##.############..##.
///     .#.######.########.#
///     .###.#######.####.#.
///     #####.##.#.##.###.##
///     ..#####..#.#########
///     ####################
///     #.####....###.#.#.##
///     ##.#################
///     #####.##.###..####..
///     ..######..##.#######
///     ####.##.####...##..#
///     .#####..#.######.###
///     ##...#.##########...
///     #.##########.#######
///     .####.#.###.###.#.##
///     ....##.##.###..#####
///     .#.#.###########.###
///     #.#.#.#####.####.###
///     ###.##.####.##.#..##
///
/// Find the best location for a new monitoring station. How many other asteroids can be detected from that location?

pub fn part1() {
    let input = crate::common::read_stdin_to_string();

    let map = AsteroidMap::from(input.as_str());
    let (number_of_asteroids, _) = map.calculate_best_monitoring_station();

    println!(
        "The number of other asteroids that can be detected from the best location for a new monitoring station: {}",
        number_of_asteroids
    );
}

#[derive(Debug)]
struct AsteroidMap(Vec<Point>);

impl AsteroidMap {
    fn calculate_best_monitoring_station(&self) -> (usize, Point) {
        self.0
            .iter()
            .copied()
            .map(|asteroid| (self.number_of_visible_asteroids(asteroid), asteroid))
            .max_by(|(visible_asteroids_one, _), (visible_asteroids_two, _)| {
                visible_asteroids_one.cmp(visible_asteroids_two)
            })
            .expect("Failed to find best monitoring station")
    }

    fn number_of_visible_asteroids(&self, from: Point) -> usize {
        let mut vectors: Vec<_> = self
            .0
            .iter()
            .copied()
            .filter(|asteroid| *asteroid != from)
            .map(|asteroid| Vector::from_points(from, asteroid))
            .map(|vector| vector.angle())
            .collect();

        vectors.sort_unstable_by(|a, b| a.partial_cmp(b).unwrap());
        vectors.dedup();
        vectors.len()
    }
}

impl From<&str> for AsteroidMap {
    fn from(string: &str) -> Self {
        Self(
            string
                .trim()
                .split('\n')
                .enumerate()
                .flat_map(|(y, line)| {
                    line.chars()
                        .enumerate()
                        .filter(|(_, character)| *character == '#')
                        .map(move |(x, _)| Point {
                            x: x as i64,
                            y: y as i64,
                        })
                })
                .collect::<Vec<_>>(),
        )
    }
}

#[derive(Debug, Eq, PartialEq, Copy, Clone, Ord, PartialOrd)]
struct Point {
    x: i64,
    y: i64,
}

#[derive(Debug, Eq, PartialEq, Copy, Clone, Ord, PartialOrd)]
struct Vector {
    x: i64,
    y: i64,
}

impl Vector {
    fn from_points(one: Point, two: Point) -> Self {
        Self {
            x: two.x - one.x,
            y: two.y - one.y,
        }
    }

    fn angle(&self) -> Angle {
        Angle {
            theta: (self.y as f64 / self.x as f64).atan(),
            side: if self.x >= 0 { Side::Right } else { Side::Left },
        }
    }
}

#[derive(Debug, PartialEq, Copy, Clone, PartialOrd)]
struct Angle {
    theta: f64,

    // -0.0_f64 == 0.0_f64, but in this context we want to distinguish between them
    side: Side,
}

#[derive(Debug, Eq, PartialEq, Copy, Clone, Ord, PartialOrd)]
enum Side {
    Left,
    Right,
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_part1_examples() {
        let examples = [
            (
                "
.#..#
.....
#####
....#
...##
",
                Point { x: 3, y: 4 },
                8,
            ),
            (
                "
......#.#.
#..#.#....
..#######.
.#.#.###..
.#..#.....
..#....#.#
#..#....#.
.##.#..###
##...#..#.
.#....####
            ",
                Point { x: 5, y: 8 },
                33,
            ),
            (
                "
#.#...#.#.
.###....#.
.#....#...
##.#.#.#.#
....#.#.#.
.##..###.#
..#...##..
..##....##
......#...
.####.###.
            ",
                Point { x: 1, y: 2 },
                35,
            ),
            (
                "
.#..#..###
####.###.#
....###.#.
..###.##.#
##.##.#.#.
....###..#
..#.#..#.#
#..#.#.###
.##...##.#
.....#.#..
            ",
                Point { x: 6, y: 3 },
                41,
            ),
            (
                "
.#..##.###...#######
##.############..##.
.#.######.########.#
.###.#######.####.#.
#####.##.#.##.###.##
..#####..#.#########
####################
#.####....###.#.#.##
##.#################
#####.##.###..####..
..######..##.#######
####.##.####...##..#
.#####..#.######.###
##...#.##########...
#.##########.#######
.####.#.###.###.#.##
....##.##.###..#####
.#.#.###########.###
#.#.#.#####.####.###
###.##.####.##.#..##
            ",
                Point { x: 11, y: 13 },
                210,
            ),
        ];

        for example in &examples {
            let best_station = AsteroidMap::from(example.0).calculate_best_monitoring_station();
            assert_eq!(best_station.1, example.1);
            assert_eq!(best_station.0, example.2);
        }
    }
}