From: Neil Smith Date: Tue, 11 Dec 2018 18:14:21 +0000 (+0000) Subject: Day 11 X-Git-Url: https://git.njae.me.uk/?p=advent-of-code-18.git;a=commitdiff_plain;h=83d84c049176a0a18772dee13c1eb099b242daed Day 11 --- diff --git a/advent-of-code.cabal b/advent-of-code.cabal index 83c71a9..2910874 100644 --- a/advent-of-code.cabal +++ b/advent-of-code.cabal @@ -120,3 +120,42 @@ executable advent09pl , megaparsec , containers , pointedlist + +executable advent10 + hs-source-dirs: src/advent10 + main-is: advent10.hs + default-language: Haskell2010 + build-depends: base >= 4.7 && < 5 + , text + , megaparsec + , containers + +executable advent10iz + hs-source-dirs: src/advent10 + main-is: advent10-iterate-zip.hs + default-language: Haskell2010 + build-depends: base >= 4.7 && < 5 + , text + , megaparsec + , containers + +executable advent11 + hs-source-dirs: src/advent11 + main-is: advent11.hs + default-language: Haskell2010 + build-depends: base >= 4.7 && < 5 + , containers + +executable advent11m + hs-source-dirs: src/advent11 + main-is: advent11-map.hs + default-language: Haskell2010 + build-depends: base >= 4.7 && < 5 + , containers + +executable advent11naive + hs-source-dirs: src/advent11 + main-is: advent11-naive.hs + default-language: Haskell2010 + build-depends: base >= 4.7 && < 5 + , containers diff --git a/problems/day11.html b/problems/day11.html new file mode 100644 index 0000000..89e94a0 --- /dev/null +++ b/problems/day11.html @@ -0,0 +1,173 @@ + + + + +Day 11 - Advent of Code 2018 + + + + + + + +

Advent of Code

Neil Smith (AoC++) 22*

  {year=>2018}

+ + + +
+

--- Day 11: Chronal Charge ---

You watch the Elves and their sleigh fade into the distance as they head toward the North Pole.

+

Actually, you're the one fading. The falling sensation returns.

+

The low fuel warning light is illuminated on your wrist-mounted device. Tapping it once causes it to project a hologram of the situation: a 300x300 grid of fuel cells and their current power levels, some negative. You're not sure what negative power means in the context of time travel, but it can't be good.

+

Each fuel cell has a coordinate ranging from 1 to 300 in both the X (horizontal) and Y (vertical) direction. In X,Y notation, the top-left cell is 1,1, and the top-right cell is 300,1.

+

The interface lets you select any 3x3 square of fuel cells. To increase your chances of getting to your destination, you decide to choose the 3x3 square with the largest total power.

+

The power level in a given fuel cell can be found through the following process:

+
    +
  • Find the fuel cell's rack ID, which is its X coordinate plus 10.
    • +
  • Begin with a power level of the rack ID times the Y coordinate.
    • +
  • Increase the power level by the value of the grid serial number (your puzzle input).
    • +
  • Set the power level to itself multiplied by the rack ID.
    • +
  • Keep only the hundreds digit of the power level (so 12345 becomes 3; numbers with no hundreds digit become 0).
    • +
  • Subtract 5 from the power level.
    • +
+

For example, to find the power level of the fuel cell at 3,5 in a grid with serial number 8:

+
    +
  • The rack ID is 3 + 10 = 13.
    • +
  • The power level starts at 13 * 5 = 65.
    • +
  • Adding the serial number produces 65 + 8 = 73.
    • +
  • Multiplying by the rack ID produces 73 * 13 = 949.
    • +
  • The hundreds digit of 949 is 9.
    • +
  • Subtracting 5 produces 9 - 5 = 4.
    • +
+

So, the power level of this fuel cell is 4.

+

Here are some more example power levels:

+
    +
  • Fuel cell at  122,79, grid serial number 57: power level -5.
    • +
  • Fuel cell at 217,196, grid serial number 39: power level  0.
    • +
  • Fuel cell at 101,153, grid serial number 71: power level  4.
    • +
+

Your goal is to find the 3x3 square which has the largest total power. The square must be entirely within the 300x300 grid. Identify this square using the X,Y coordinate of its top-left fuel cell. For example:

+

For grid serial number 18, the largest total 3x3 square has a top-left corner of 33,45 (with a total power of 29); these fuel cells appear in the middle of this 5x5 region:

+
-2  -4   4   4   4
+-4   4   4   4  -5
+ 4   3   3   4  -4
+ 1   1   2   4  -3
+-1   0   2  -5  -2
+
+

For grid serial number 42, the largest 3x3 square's top-left is 21,61 (with a total power of 30); they are in the middle of this region:

+
-3   4   2   2   2
+-4   4   3   3   4
+-5   3   3   4  -4
+ 4   3   3   4  -3
+ 3   3   3  -5  -1
+
+

What is the X,Y coordinate of the top-left fuel cell of the 3x3 square with the largest total power?

+
+

Your puzzle answer was 21,34.

--- Part Two ---

You discover a dial on the side of the device; it seems to let you select a square of any size, not just 3x3. Sizes from 1x1 to 300x300 are supported.

+

Realizing this, you now must find the square of any size with the largest total power. Identify this square by including its size as a third parameter after the top-left coordinate: a 9x9 square with a top-left corner of 3,5 is identified as 3,5,9.

+

For example:

+
    +
  • For grid serial number 18, the largest total square (with a total power of 113) is 16x16 and has a top-left corner of 90,269, so its identifier is 90,269,16.
    • +
  • For grid serial number 42, the largest total square (with a total power of 119) is 12x12 and has a top-left corner of 232,251, so its identifier is 232,251,12.
    • +
+

What is the X,Y,size identifier of the square with the largest total power?

+
+

Your puzzle answer was 90,244,16.

Both parts of this puzzle are complete! They provide two gold stars: **

+

At this point, you should return to your advent calendar and try another puzzle.

+

Your puzzle input was 5719.

+

You can also this puzzle.

+
+ + + + + + \ No newline at end of file diff --git a/src/advent11/advent11-map.hs b/src/advent11/advent11-map.hs new file mode 100644 index 0000000..9549660 --- /dev/null +++ b/src/advent11/advent11-map.hs @@ -0,0 +1,58 @@ +{-# LANGUAGE OverloadedStrings #-} + +import Data.List +import qualified Data.Map.Strict as M +-- import Data.Map.Strict ((!)) +-- import qualified Data.Set as S +-- import Data.Function (on) +import Data.Ord (comparing) + +type Coord = (Integer, Integer) -- x, y +type Grid = M.Map Coord Integer + +key = 5719 +-- key = 42 + +main :: IO () +main = do + let g = makeGrid key + print $ part1 g + print $ part2 g + + +part1 grid = keyOfMaxValue sg + where sg = allSubCellPower 3 grid + + +part2 grid = maximumBy (comparing snd) $ [bestInGrid size grid | size <- [3..300]] + +-- bestSubCell size grid = + +makeGrid :: Integer -> Grid +makeGrid key = M.fromList [((x, y), powerLevel x y key) | x <- [1..300], y <- [1..300] ] + +powerLevel :: Integer -> Integer -> Integer -> Integer +powerLevel x y key = ((interim `div` 100) `mod` 10) - 5 + where rackID = x + 10 + interim = ((rackID) * y + key) * rackID + +subCellPower :: Integer -> Integer -> Integer -> Grid -> Integer +subCellPower size x y grid = M.foldr (+) 0 subGrid + where subGrid = M.filterWithKey inBounds grid + inBounds (kx, ky) _ = (kx >= x) && (kx < x+size) && (ky >= y) && (ky < y+size) + +allSubCellPower :: Integer -> Grid -> Grid +allSubCellPower size grid = M.fromList [((x, y), subCellPower size x y grid)| x <- [1..(301-size)], y <- [1..(301-size)]] + + +keyAndMaxValue :: Ord b => M.Map a b -> (a, b) +keyAndMaxValue m = M.foldrWithKey mergeKV (M.findMin m) m + where mergeKV k v (bestK, bestV) = + if v > bestV then (k, v) else (bestK, bestV) + +keyOfMaxValue :: Ord b => M.Map a b -> a +keyOfMaxValue m = fst $ keyAndMaxValue m + +bestInGrid :: Integer -> Grid -> ((Integer, Integer, Integer), Integer) +bestInGrid size grid = ((x, y, size), p) + where ((x, y), p) = keyAndMaxValue $ allSubCellPower size grid diff --git a/src/advent11/advent11-naive.hs b/src/advent11/advent11-naive.hs new file mode 100644 index 0000000..d79ebb4 --- /dev/null +++ b/src/advent11/advent11-naive.hs @@ -0,0 +1,56 @@ +{-# LANGUAGE OverloadedStrings #-} + +import Data.List +import qualified Data.Map.Strict as M +import Data.Map.Strict ((!)) +-- import qualified Data.Set as S +-- import Data.Function (on) +import Data.Ord (comparing) + +type Coord = (Integer, Integer) -- x, y +type Grid = M.Map Coord Integer + +key = 5719 +-- key = 42 + +main :: IO () +main = do + let g = makeGrid key + print $ part1 g + print $ part2 g + + +part1 grid = keyOfMaxValue sg + where sg = allSubCellPower 3 grid + + +part2 grid = maximumBy (comparing snd) $ [bestInGrid size grid | size <- [3..300]] + +-- bestSubCell size grid = + +makeGrid :: Integer -> Grid +makeGrid key = M.fromList [((x, y), powerLevel x y key) | x <- [1..300], y <- [1..300] ] + +powerLevel :: Integer -> Integer -> Integer -> Integer +powerLevel x y key = ((interim `div` 100) `mod` 10) - 5 + where rackID = x + 10 + interim = ((rackID) * y + key) * rackID + +subCellPower :: Integer -> Integer -> Integer -> Grid -> Integer +subCellPower size x y grid = sum [grid!(sx, sy) | sx <- [x..(x+size-1)], sy <- [y..(y+size-1)]] + +allSubCellPower :: Integer -> Grid -> Grid +allSubCellPower size grid = M.fromList [((x, y), subCellPower size x y grid)| x <- [1..(301-size)], y <- [1..(301-size)]] + + +keyAndMaxValue :: Ord b => M.Map a b -> (a, b) +keyAndMaxValue m = M.foldrWithKey mergeKV (M.findMin m) m + where mergeKV k v (bestK, bestV) = + if v > bestV then (k, v) else (bestK, bestV) + +keyOfMaxValue :: Ord b => M.Map a b -> a +keyOfMaxValue m = fst $ keyAndMaxValue m + +bestInGrid :: Integer -> Grid -> ((Integer, Integer, Integer), Integer) +bestInGrid size grid = ((x, y, size), p) + where ((x, y), p) = keyAndMaxValue $ allSubCellPower size grid diff --git a/src/advent11/advent11.hs b/src/advent11/advent11.hs new file mode 100644 index 0000000..1472f31 --- /dev/null +++ b/src/advent11/advent11.hs @@ -0,0 +1,73 @@ +{-# LANGUAGE OverloadedStrings #-} + +-- Using a summed-area table, e.g. see https://en.wikipedia.org/wiki/Summed-area_table + +import Data.List +import qualified Data.Map.Strict as M +import Data.Map.Strict ((!)) +-- import qualified Data.Set as S +-- import Data.Function (on) +import Data.Ord (comparing) + +type Coord = (Integer, Integer) -- x, y +type Grid = M.Map Coord Integer + +key = 5719 +-- key = 42 + +main :: IO () +main = do + let g = makeGrid key + print $ part1 g + print $ part2 g + + +part1 grid = keyOfMaxValue sg + where sg = allSubCellPower 3 grid + + +part2 grid = maximumBy (comparing snd) $ [bestInGrid size grid | size <- [3..300]] + +-- bestSubCell size grid = + +makeGrid :: Integer -> Grid +-- makeGrid key = M.fromList [((x, y), powerLevel x y key) | x <- [1..300], y <- [1..300] ] +makeGrid key = foldl' addSummedArea M.empty [((x, y), powerLevel x y key) | x <- [0..300], y <- [0..300] ] + +addSummedArea :: Grid -> ((Integer, Integer), Integer) -> Grid +addSummedArea grid ((x, y), power) = M.insert (x, y) (power + upper + left - upperLeft) grid + where upper = M.findWithDefault 0 (x-1, y) grid + left = M.findWithDefault 0 (x, y-1) grid + upperLeft = M.findWithDefault 0 (x-1, y-1) grid + + +powerLevel :: Integer -> Integer -> Integer -> Integer +powerLevel 0 y _ = 0 +powerLevel x 0 _ = 0 +powerLevel x y key = ((interim `div` 100) `mod` 10) - 5 + where rackID = x + 10 + interim = ((rackID) * y + key) * rackID + +subCellPower :: Integer -> Integer -> Integer -> Grid -> Integer +-- subCellPower size x y grid = sum [grid!(sx, sy) | sx <- [x..(x+size-1)], sy <- [y..(y+size-1)]] +subCellPower size x0 y0 grid = grid!(x,y) + grid!(x',y') - grid!(x,y') - grid!(x',y) + where x = x0 - 1 + x' = x + size + y = y0 - 1 + y' = y + size + +allSubCellPower :: Integer -> Grid -> Grid +allSubCellPower size grid = M.fromList [((x, y), subCellPower size x y grid)| x <- [1..(301-size)], y <- [1..(301-size)]] + + +keyAndMaxValue :: Ord b => M.Map a b -> (a, b) +keyAndMaxValue m = M.foldrWithKey mergeKV (M.findMin m) m + where mergeKV k v (bestK, bestV) = + if v > bestV then (k, v) else (bestK, bestV) + +keyOfMaxValue :: Ord b => M.Map a b -> a +keyOfMaxValue m = fst $ keyAndMaxValue m + +bestInGrid :: Integer -> Grid -> ((Integer, Integer, Integer), Integer) +bestInGrid size grid = ((x, y, size), p) + where ((x, y), p) = keyAndMaxValue $ allSubCellPower size grid