X-Git-Url: https://git.njae.me.uk/?a=blobdiff_plain;f=src%2Fadvent14%2Fadvent14.hs;h=45c9dd2c45a67ea85f7714e93b2cb27899b37006;hb=a8bef43eb05fec6556efe2addf917d59600b4d65;hp=940fe7b4d9c6ed811589001b66ff34b075eb1821;hpb=0c672ee4c5d50a7e51b0408ae1b87f68c44534a7;p=advent-of-code-17.git

diff --git a/src/advent14/advent14.hs b/src/advent14/advent14.hs
index 940fe7b..45c9dd2 100644
--- a/src/advent14/advent14.hs
+++ b/src/advent14/advent14.hs
@@ -2,14 +2,53 @@ 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 Data.Map.Strict ((!))
+import qualified Data.Graph as G
+
+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
 
 part1 :: String -> Int
 part1 key = sum rowCounts
-    where hashes = map knotHash $ rowSpecs key
-          rowCounts = map (countSetBits . binify) hashes
+    where binHashes = map binHash $ rowSpecs key
+          rowCounts = map countSetBits binHashes
+
+
+-- part2 :: String -> Int
+part2 key = length $ cellEdges cells
+    where binHashes = map binHash $ rowSpecs key
+          cells = presentCells binHashes
+
+binHash :: String -> String
+binHash = binify . knotHash
+
+numKey :: (Int, Int) -> Int
+numKey (r, c) = 128 * r + c
+
+
+presentCells :: [String] -> CellMap
+presentCells binHashes = M.fromList [((r, c), True) | r <- [0..127], c <- [0..127], (binHashes!!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)]
+        -- isPresent rc = length $ rc `member` cells
+
+
+-- cellEdges :: CellMap -> 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]
@@ -18,6 +57,7 @@ countSetBits :: String -> Int
 countSetBits = length . filter (== '1')
 
 
+
 knotHash :: String -> [Int]
 knotHash input = densify tied
     where (tied, _, _) = foldl step ([0..255], 0, 0) hashTerms
@@ -57,4 +97,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