{"header":{"message":"Solution for 2021 Day 9 part 2","description":null,"timestamp":"2021-12-13T02:29:30.86872Z","authors":[{"email":"quick.dudley@gmail.com","full_name":"Jeremy List","name":"quickdudley"}]},"hash":"EQOTSRPD5TUOR2X3RHDWOCMGWK5KV2C65PNUYM3SF6TPGRSCOPSQC","authors":[],"deps":{"hashes":[["EQOTSRPD5TUOR2X3RHDWOCMGWK5KV2C65PNUYM3SF6TPGRSCOPSQC","Solution for 2021 Day 9 part 2"],["AA",null],["E5UDZGDTQH4K24S5DGGXSH3DVDOV745VWKNIEXE6JGSEUSDU36CAC","Solution for 2021 day 9 part 1"]],"deps":["E5UDZGDTQH4K24S5DGGXSH3DVDOV745VWKNIEXE6JGSEUSDU36CAC"],"known":[]},"hunks":[{"Replacement":{"inode":{"change":2,"pos":32},"path":"2021/day9.rs","line":17,"ins":{"up_context":[{"change":2,"pos":584}],"down_context":[{"change":2,"pos":673}],"flag":"BLOCK","start":0,"end":284,"inode":{"change":2,"pos":32}},"del":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":2,"pos":584},"to":{"change":2,"start":584,"end":673},"introduced_by":2}],"inode":{"change":2,"pos":32}},"ins_contents":[{"Add":" \"Risk level: {}\","},{"Add":" grid.minima().map(|p| grid[p] as usize + 1).sum::()"},{"Add":" );"},{"Add":" let basins = grid.basins().iter().map(|(_, s)| *s).top_n(3);"},{"Add":" println!("},{"Add":" \"Top 3 basin sizes: {:?}; product: {}\","},{"Add":" basins,"},{"Add":" basins.iter().product::()"}],"del_contents":[{"Del":" \"risk level: {}\",\n grid.minima().map(|p| grid[p] as u16 + 1).sum::()\n"}]}},{"Edit":{"inode":{"change":2,"pos":32},"path":"2021/day9.rs","line":59,"atom":{"NewVertex":{"up_context":[{"change":2,"pos":1307}],"down_context":[{"change":2,"pos":1307}],"flag":"BLOCK","start":285,"end":725,"inode":{"change":2,"pos":32}}},"contents":[{"Add":""},{"Add":" fn map_with_coords S>("},{"Add":" &self,"},{"Add":" mut f: F,"},{"Add":" ) -> Grid {"},{"Add":" let mut inner = Vec::with_capacity(self.inner.len());"},{"Add":" let outside = f((usize::MAX, usize::MAX), &self.outside);"},{"Add":" inner"},{"Add":" .extend(self.points().zip(self.inner.iter()).map(|(p, v)| f(p, v)));"},{"Add":" Grid {"},{"Add":" inner,"},{"Add":" outside,"},{"Add":" width: self.width,"},{"Add":" }"},{"Add":" }"}]}},{"Edit":{"inode":{"change":2,"pos":32},"path":"2021/day9.rs","line":98,"atom":{"NewVertex":{"up_context":[{"change":2,"pos":1962}],"down_context":[{"change":2,"pos":1962}],"flag":"BLOCK","start":726,"end":2573,"inode":{"change":2,"pos":32}}},"contents":[{"Add":"impl + PartialEq> Grid {"},{"Add":" fn basins(&self) -> Vec<((usize, usize), usize)> {"},{"Add":" let mut uf = self"},{"Add":" .map_with_coords(|p, n| (p, if n == &T::from(9) { 0 } else { 1 }));"},{"Add":" for (p, h) in uf"},{"Add":" .points()"},{"Add":" .zip(self.inner.iter())"},{"Add":" .filter(|(_, h)| *h < &T::from(9))"},{"Add":" {"},{"Add":" // I originally thought this would also find the minimum of each"},{"Add":" // basin but it doesn't always."},{"Add":" for (n, j) in uf"},{"Add":" .neighbours(p)"},{"Add":" .map(|n| (n, &self[n]))"},{"Add":" .filter(|(_, n)| *n < &T::from(9))"},{"Add":" {"},{"Add":" match h.cmp(j) {"},{"Add":" std::cmp::Ordering::Less => uf.flow(n, p),"},{"Add":" std::cmp::Ordering::Equal => (),"},{"Add":" std::cmp::Ordering::Greater => uf.flow(p, n),"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":" uf.points()"},{"Add":" .zip(uf.inner.iter().map(|(_, s)| s))"},{"Add":" .filter(|(_, s)| *s > &0)"},{"Add":" .map(|(p, s)| (p, *s))"},{"Add":" .collect()"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"impl Grid<((usize, usize), T)> {"},{"Add":" fn u_find(&mut self, p: (usize, usize)) -> (usize, usize) {"},{"Add":" let d = unsafe { &mut *(&mut self[p].0 as *mut (usize, usize)) };"},{"Add":" if d == &p {"},{"Add":" p"},{"Add":" } else {"},{"Add":" let q = self.u_find(*d);"},{"Add":" *d = q;"},{"Add":" q"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"impl + std::ops::Add>"},{"Add":" Grid<((usize, usize), T)>"},{"Add":"{"},{"Add":" fn flow(&mut self, mut s: (usize, usize), mut t: (usize, usize)) {"},{"Add":" s = self.u_find(s);"},{"Add":" t = self.u_find(t);"},{"Add":" if s != t {"},{"Add":" let y = unsafe { &mut *(&mut self[t].1 as *mut T) };"},{"Add":" let (d, x) = &mut self[s];"},{"Add":" let x = std::mem::replace(x, T::from(0));"},{"Add":" *y = *y + x;"},{"Add":" *d = t;"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""}]}},{"Edit":{"inode":{"change":2,"pos":32},"path":"2021/day9.rs","line":182,"atom":{"NewVertex":{"up_context":[{"change":2,"pos":2841}],"down_context":[{"change":2,"pos":2841}],"flag":"BLOCK","start":2574,"end":2998,"inode":{"change":2,"pos":32}}},"contents":[{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"trait IterExtra: Iterator {"},{"Add":" fn top_n(&mut self, size: usize) -> Vec"},{"Add":" where"},{"Add":" Self::Item: PartialOrd,"},{"Add":" {"},{"Add":" let mut result: Vec<_> = self.take(size).collect();"},{"Add":" for mut i in self {"},{"Add":" let i = &mut i;"},{"Add":" for j in result.iter_mut() {"},{"Add":" if i > j {"},{"Add":" std::mem::swap(i, j);"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":" result"}]}},{"Edit":{"inode":{"change":2,"pos":32},"path":"2021/day9.rs","line":202,"atom":{"NewVertex":{"up_context":[{"change":2,"pos":2849}],"down_context":[{"change":2,"pos":2849}],"flag":"BLOCK","start":2999,"end":3037,"inode":{"change":2,"pos":32}}},"contents":[{"Add":""},{"Add":"impl IterExtra for I {}"}]}},{"Replacement":{"inode":{"change":2,"pos":32},"path":"2021/day9.rs","line":291,"ins":{"up_context":[{"change":2,"pos":4763}],"down_context":[{"change":2,"pos":4824}],"flag":"BLOCK","start":3038,"end":3083,"inode":{"change":2,"pos":32}},"del":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":2,"pos":4763},"to":{"change":2,"start":4763,"end":4824},"introduced_by":2}],"inode":{"change":2,"pos":32}},"ins_contents":[{"Add":" Some((self.centre.0, y))"}],"del_contents":[{"Del":" Some((self.centre.0, self.centre.1 + 1))\n"}]}}],"owner":"quickdudley","repo":"adventofcode","token":"Wv1QAoVIs6KI89gV/lObzBV82AiJYQSGF9kNRLJXX4s=","login":null}

…

Dependencies

Change contents