summaryrefslogtreecommitdiff
path: root/2019/src/bin/day_6.rs
blob: 2af272c3816a0896ba959791bebf51c80cccbe5a (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
use rpds::vector::Vector;
use std::fmt;
use std::io;
use std::io::prelude::*;
use std::iter::FromIterator;
use std::process;
use std::str::FromStr;
use structopt::StructOpt;

#[derive(Debug, StructOpt)]
#[structopt(name = "Day 6: Universal Orbit Map")]
/// Finds the minumum number of orbital transfers between two points.
///
/// Input is read from stdin, one direct orbit per line, in the format
/// `A)B` (B is orbiting A).
///
/// See https://adventofcode.com/2019/day/6 for details.
struct Opt {
    /// Debug checksum: Counts the total orbits
    #[structopt(short = "d", long = "debug")]
    debug: bool,
}

fn main() {
    let stdin = io::stdin();
    let opt = Opt::from_args();

    let orbits: OrbitalMap = stdin
        .lock()
        .lines()
        .map(|x| exit_on_failed_assertion(x, "Error reading input"))
        .map(|x| exit_on_failed_assertion(x.parse::<Orbit>(), "Input was not a valid orbit"))
        .collect();

    // eprintln!("{:#?}", orbits);

    if opt.debug {
        println!("{}", orbits.total_orbits());
    } else {
        println!("{}", orbits.orbital_transfers("YOU", "SAN"));
    }
}

fn exit_on_failed_assertion<A, E: std::error::Error>(data: Result<A, E>, message: &str) -> A {
    match data {
        Ok(data) => data,
        Err(e) => {
            eprintln!("{}: {}", message, e);
            process::exit(1);
        }
    }
}

#[derive(Debug)]
struct StrError {
    str: String,
}

impl fmt::Display for StrError {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(f, "{}", self.str)
    }
}
impl std::error::Error for StrError {}

#[derive(Debug, Clone)]
struct Orbit {
    a: String,
    b: String,
}

impl FromStr for Orbit {
    type Err = StrError;

    fn from_str(s: &str) -> Result<Self, StrError> {
        match s.split(')').collect::<Vec<_>>()[..] {
            [a, b] => Ok(Orbit {
                a: a.to_string(),
                b: b.to_string(),
            }),
            _ => Err(StrError {
                str: format!("{} is not a valid orbit description", s),
            }),
        }
    }
}

#[derive(Clone, Debug)]
struct OrbitalMap {
    id: String,
    depth: usize,
    orbiters: Vector<OrbitalMap>,
}

struct OrbitalMapBuilder {
    orbiters: Vector<OrbitalMap>,
    inserted_orbits: Vector<String>,
    pending_orbits: Vector<Orbit>,
}

impl FromIterator<Orbit> for OrbitalMap {
    fn from_iter<T: IntoIterator<Item = Orbit>>(iter: T) -> Self {
        iter.into_iter().collect::<OrbitalMapBuilder>().build()
    }
}

impl FromIterator<Orbit> for OrbitalMapBuilder {
    fn from_iter<T: IntoIterator<Item = Orbit>>(iter: T) -> Self {
        OrbitalMapBuilder {
            orbiters: Vector::new(),
            inserted_orbits: Vector::new(),
            pending_orbits: iter.into_iter().collect(),
        }
    }
}

impl OrbitalMapBuilder {
    fn build(self) -> OrbitalMap {
        if self.pending_orbits.is_empty() {
            OrbitalMap {
                id: ROOT.into(),
                depth: 0,
                orbiters: self.orbiters,
            }
        } else {
            self.pending_orbits
                .into_iter()
                .fold(
                    OrbitalMapBuilder {
                        pending_orbits: Vector::new(),
                        ..self
                    },
                    |acc, next| acc.insert(&next),
                )
                .build()
        }
    }

    fn insert(self, orbit: &Orbit) -> OrbitalMapBuilder {
        if orbit.a == ROOT {
            OrbitalMapBuilder {
                orbiters: self.orbiters.push_back(OrbitalMap::new(orbit.b.clone(), 1)),
                inserted_orbits: self.inserted_orbits.push_back(orbit.b.clone()),
                ..self
            }
        } else if self.inserted_orbits.iter().any(|o| *o == orbit.a) {
            OrbitalMapBuilder {
                orbiters: self
                    .orbiters
                    .into_iter()
                    .map(|map| OrbitalMap::insert(map.clone(), orbit))
                    .collect(),
                inserted_orbits: self.inserted_orbits.push_back(orbit.b.clone()),
                ..self
            }
        } else {
            OrbitalMapBuilder {
                pending_orbits: self.pending_orbits.push_back(orbit.clone()),
                ..self
            }
        }
    }
}

const ROOT: &str = "COM";

impl OrbitalMap {
    fn new(id: String, depth: usize) -> OrbitalMap {
        OrbitalMap {
            id,
            depth,
            orbiters: Vector::new(),
        }
    }

    fn insert(self, orbit: &Orbit) -> OrbitalMap {
        if orbit.a == self.id {
            if self.orbiters.iter().any(|o| o.id == orbit.b) {
                self
            } else {
                OrbitalMap {
                    orbiters: self
                        .orbiters
                        .push_back(OrbitalMap::new(orbit.b.clone(), self.depth + 1)),
                    ..self
                }
            }
        } else {
            OrbitalMap {
                orbiters: self
                    .orbiters
                    .into_iter()
                    .map(|map| OrbitalMap::insert(map.clone(), orbit))
                    .collect(),
                ..self
            }
        }
    }

    fn count_orbits(&self) -> usize {
        self.orbiters.len()
            + self
                .orbiters
                .iter()
                .map(|o| o.count_orbits())
                .sum::<usize>()
    }

    fn total_orbits(&self) -> usize {
        self.count_orbits()
            + self
                .orbiters
                .iter()
                .map(|o| o.total_orbits())
                .sum::<usize>()
    }

    fn find_depth(&self, id: &str) -> usize {
        if self.id == id {
            self.depth
        } else {
            // only the actual one will return non-zero from this
            self.orbiters.iter().map(|o| o.find_depth(id)).sum()
        }
    }

    fn contains(&self, id: &str) -> bool {
        self.id == id || self.orbiters.iter().any(|o| o.contains(id))
    }

    fn find_common_ancestor(&self, a: &str, b: &str) -> Option<OrbitalMap> {
        if !self.contains(a) || !self.contains(b) {
            None
        } else {
            self.orbiters
                .iter()
                .flat_map(|o| o.find_common_ancestor(a, b))
                .next()
                .or(Some(self.clone()))
        }
    }

    fn orbital_transfers(&self, from: &str, to: &str) -> usize {
        self.find_depth(from) + self.find_depth(to)
            - 2 * self
                .find_common_ancestor(from, to)
                .map(|o| o.depth)
                .unwrap_or(0)
            - 2
    }
}