Parallel version of day 14

[advent-of-code-17.git] / src / advent14 / advent14.hs

diff --git a/src/advent14/advent14.hs b/src/advent14/advent14.hs
index 940fe7b4d9c6ed811589001b66ff34b075eb1821..d091ee1dde5287eb0d4b5bf822084577c5a9c764 100644 (file)
--- a/src/advent14/advent14.hs
+++ b/src/advent14/advent14.hs
@@ -2,22 +2,58 @@ import Data.List.Split (chunksOf)
 import Data.Char (ord)
 import Text.Printf (printf)
 import Data.Bits (xor)
+import qualified Data.Map.Strict as M
+import qualified Data.Graph as G
+import Control.Parallel.Strategies (parMap, rpar)
+type CellMap = M.Map (Int, Int) Bool
 
 puzzleKey = "xlqgujun"
 
+main :: IO ()
+main = do
+  print $ part1 puzzleKey
+  print $ part2 puzzleKey
+
 
 part1 :: String -> Int
 part1 key = sum rowCounts
-    where hashes = map knotHash $ rowSpecs key
-          rowCounts = map (countSetBits . binify) hashes
+    where rowCounts = parMap rpar countSetBits $ binHashes key
+
+
+part2 :: String -> Int
+part2 key = length $ cellEdges cells
+    where cells = presentCells $ binHashes key
+
+binHashes :: String -> [String]
+binHashes key = parMap rpar binHash $ rowSpecs key
+
+
+binHash :: String -> String
+binHash = binify . knotHash
+
+numKey :: (Int, Int) -> Int
+numKey (r, c) = 128 * r + c
+
+
+presentCells :: [String] -> CellMap
+presentCells bhs = M.fromList [((r, c), True) | r <- [0..127], c <- [0..127], (bhs!!r)!!c == '1']
+
+adjacentCells :: CellMap -> (Int, Int) -> [(Int, Int)]
+adjacentCells cells (r, c) = filter (\k -> M.member k cells) possibles
+  where possibles = [(r, c - 1), (r, c + 1), (r - 1, c), (r + 1, c)]
+
+
+cellEdges :: CellMap -> [G.SCC (Int, Int)]
+cellEdges cells = G.stronglyConnComp [(k, numKey k, map numKey $ adjacentCells cells k) | k <- M.keys cells]
 
 rowSpecs :: String -> [String]
-rowSpecs key = map (((key ++ "-") ++) . show) [0..127]
+rowSpecs key = map (((key ++ "-") ++) . show) ([0..127] :: [Integer])
 
 countSetBits :: String -> Int
 countSetBits = length . filter (== '1')
 
 
+
 knotHash :: String -> [Int]
 knotHash input = densify tied
     where (tied, _, _) = foldl step ([0..255], 0, 0) hashTerms
@@ -47,8 +83,8 @@ mkHashTerms :: String -> [Int]
 mkHashTerms text = take (length chunk * 64) $ cycle chunk
     where chunk = map ord text ++ [17, 31, 73, 47, 23]
 
-hexify :: [Int] -> String
-hexify = concatMap (printf "%02x")
+-- hexify :: [Int] -> String
+-- hexify = concatMap (printf "%02x")
 
 binify :: [Int] -> String
 binify = concatMap (printf "%08b")
@@ -57,4 +93,4 @@ densify :: [Int] -> [Int]
 densify ns = codes
     where chunks = chunksOf 16 ns
           compress = foldl1 xor
-          codes = map compress chunks
\ No newline at end of file
+          codes = map compress chunks