aboutsummaryrefslogtreecommitdiffstats
path: root/src/day6.rs
blob: da48d3e0992e667d72d5d36d8d5ff287e8ca9bb2 (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
//! The device on your wrist beeps several times, and once again you feel like you're falling.

use std::cmp;
use std::collections::BTreeMap;
use std::i64;

/// "Situation critical," the device announces. "Destination indeterminate. Chronal interference detected. Please specify new target coordinates."
///
/// The device then produces a list of coordinates (your puzzle input). Are they places it thinks are safe or dangerous? It recommends you check manual page 729. The Elves did not give you a manual.
///
/// If they're dangerous, maybe you can minimize the danger by finding the coordinate that gives the largest distance from the other points.
///
/// Using only the Manhattan distance, determine the area around each coordinate by counting the number of integer X,Y locations that are closest to that coordinate (and aren't tied in distance to any other coordinate).
///
/// Your goal is to find the size of the largest area that isn't infinite. For example, consider the following list of coordinates:
///
/// 1, 1
/// 1, 6
/// 8, 3
/// 3, 4
/// 5, 5
/// 8, 9
///
/// If we name these coordinates A through F, we can draw them on a grid, putting 0,0 at the top left:
///
/// ..........
/// .A........
/// ..........
/// ........C.
/// ...D......
/// .....E....
/// .B........
/// ..........
/// ..........
/// ........F.
///
/// This view is partial - the actual grid extends infinitely in all directions. Using the Manhattan distance, each location's closest coordinate can be determined, shown here in lowercase:
///
/// aaaaa.cccc
/// aAaaa.cccc
/// aaaddecccc
/// aadddeccCc
/// ..dDdeeccc
/// bb.deEeecc
/// bBb.eeee..
/// bbb.eeefff
/// bbb.eeffff
/// bbb.ffffFf
///
/// Locations shown as . are equally far from two or more coordinates, and so they don't count as being closest to any.
///
/// In this example, the areas of coordinates A, B, C, and F are infinite - while not shown here, their areas extend forever outside the visible grid. However, the areas of coordinates D and E are finite: D is closest to 9 locations, and E is closest to 17 (both including the coordinate's location itself). Therefore, in this example, the size of the largest area is 17.
///
/// What is the size of the largest area that isn't infinite?
pub fn part1() {
    let input = ::common::read_stdin_to_string();

    let coords = input_to_coords(input);
    let bounds = get_bounds(&coords);
    let areas = calculate_areas(&coords, bounds);

    let largest_area = areas.values().fold(0, |acc, v| cmp::max(acc, *v));

    println!(
        "the size of the largest area that isn't infinite: {}",
        largest_area
    );
}

/// On the other hand, if the coordinates are safe, maybe the best you can do is try to find a region near as many coordinates as possible.
///
/// For example, suppose you want the sum of the Manhattan distance to all of the coordinates to be less than 32. For each location, add up the distances to all of the given coordinates; if the total of those distances is less than 32, that location is within the desired region. Using the same coordinates as above, the resulting region looks like this:
///
/// ..........
/// .A........
/// ..........
/// ...###..C.
/// ..#D###...
/// ..###E#...
/// .B.###....
/// ..........
/// ..........
/// ........F.
///
/// In particular, consider the highlighted location 4,3 located at the top middle of the region. Its calculation is as follows, where abs() is the absolute value function:
///
///     Distance to coordinate A: abs(4-1) + abs(3-1) =  5
///     Distance to coordinate B: abs(4-1) + abs(3-6) =  6
///     Distance to coordinate C: abs(4-8) + abs(3-3) =  4
///     Distance to coordinate D: abs(4-3) + abs(3-4) =  2
///     Distance to coordinate E: abs(4-5) + abs(3-5) =  3
///     Distance to coordinate F: abs(4-8) + abs(3-9) = 10
///     Total distance: 5 + 6 + 4 + 2 + 3 + 10 = 30
///
/// Because the total distance to all coordinates (30) is less than 32, the location is within the region.
///
/// This region, which also includes coordinates D and E, has a total size of 16.
///
/// Your actual region will need to be much larger than this example, though, instead including all locations with a total distance of less than 10000.
///
/// What is the size of the region containing all locations which have a total distance to all given coordinates of less than 10000?
pub fn part2() {
    let input = ::common::read_stdin_to_string();

    let coords = input_to_coords(input);
    let bounds = get_bounds(&coords);
    let region_size = calculate_region_size(&coords, bounds);

    println!(
        "the size of the region containing all locations which have a total distance to all given coordinates of less than 10000: {}",
        region_size
    );
}

fn input_to_coords(input: String) -> Vec<(i64, i64)> {
    input
        .lines()
        .map(|line| {
            let split: Vec<_> = line.split(',').collect();
            (
                split[0].trim().parse().unwrap(),
                split[1].trim().parse().unwrap(),
            )
        }).collect()
}

fn get_bounds(coords: &[(i64, i64)]) -> ((i64, i64), (i64, i64)) {
    coords.iter().fold(
        ((i64::MAX, i64::MAX), (0, 0)),
        |(min_coord, max_coord), (x, y)| {
            (
                (cmp::min(min_coord.0, *x), cmp::min(min_coord.1, *y)),
                (cmp::max(max_coord.0, *x), cmp::max(max_coord.1, *y)),
            )
        },
    )
}

fn calculate_areas(
    coords: &[(i64, i64)],
    (min_coord, max_coord): ((i64, i64), (i64, i64)),
) -> BTreeMap<(i64, i64), i64> {
    let mut areas = BTreeMap::new();

    for x in min_coord.0..=max_coord.0 {
        for y in min_coord.1..=max_coord.1 {
            let (_, coord) =
                coords
                    .iter()
                    .fold((i64::MAX, None), |(closest, closest_coord), coord| {
                        let distance = taxicab_distance((x, y), *coord);
                        match distance {
                            d if d < closest => (d, Some(*coord)),
                            d if d == closest => (d, None),
                            _ => (closest, closest_coord),
                        }
                    });

            if let Some(coord) = coord {
                if x == min_coord.0 || x == max_coord.0 {
                    *areas.entry(coord).or_insert(0) = -1;
                    continue;
                }
                if y == min_coord.1 || y == max_coord.1 {
                    *areas.entry(coord).or_insert(0) = -1;
                    continue;
                }
                let entry = areas.entry(coord).or_insert(0);
                if *entry == -1 {
                    continue;
                }
                *entry += 1
            }
        }
    }

    areas
}

fn calculate_region_size(
    coords: &[(i64, i64)],
    (min_coord, max_coord): ((i64, i64), (i64, i64)),
) -> i64 {
    let mut region_size = 0;

    for x in min_coord.0..=max_coord.0 {
        for y in min_coord.1..=max_coord.1 {
            let distance_sum = coords
                .iter()
                .fold(0, |accum, coord| accum + taxicab_distance((x, y), *coord));

            if distance_sum < 10000 {
                region_size += 1;
            }
        }
    }

    region_size
}

fn taxicab_distance(a: (i64, i64), b: (i64, i64)) -> i64 {
    (cmp::max(a.0, b.0) - cmp::min(a.0, b.0)) + (cmp::max(a.1, b.1) - cmp::min(a.1, b.1))
}