Add 2019, 2020

Author: Demindiro

2019/1/input

@@ -0,0 +1,100 @@
+114739
+132732
+123925
+146385
+72590
+51932
+64164
+72919
+97336
+101791
+101477
+95677
+89907
+76998
+60782
+109021
+138070
+113374
+68672
+133830
+134079
+89079
+72321
+142643
+102734
+103743
+77864
+111363
+72140
+64483
+139567
+141318
+132736
+87824
+81937
+123404
+56730
+54447
+63602
+84561
+145159
+93598
+137770
+52943
+146307
+91674
+143183
+52543
+143052
+107171
+80699
+130825
+141406
+75771
+123497
+87982
+144545
+125153
+147925
+106898
+60193
+111251
+102454
+135886
+141408
+84556
+94143
+97958
+86474
+96848
+126314
+51037
+140379
+142065
+73629
+102432
+123801
+68146
+107720
+51512
+123873
+104308
+59601
+149175
+80400
+76822
+116115
+87990
+90592
+68688
+133868
+78357
+91425
+149328
+123010
+93278
+101150
+120352
+107642
+136050

2019/1/main.hs

@@ -0,0 +1,14 @@
+input :: String -> [Int]
+input l = [read l :: Int | l <- lines l]
+
+calc x = max (x `div` 3 - 2) 0
+
+calc_rec x
+	| x <= 0    = 0
+	| otherwise = calc x + calc_rec (calc x)
+
+main = do
+	n <- readFile "input"
+	let l = input n
+	print (sum [calc x | x <- l])
+	print (sum [calc_rec x | x <- l])

2019/2/main

@@ -0,0 +1,65 @@
+import Data.Array.IO
+
+--init_mem = [1, 0, 0, 0, 99]
+--init_mem = [2, 3, 0, 3, 99]
+--init_mem = [1,1,1,4,99,5,6,0,99]
+init_mem = [1, 0, 0, 3,1,1,2,3,1,3,4,3,1,5,0,3,2,1,9,19,1,10,19,23,2,9,23,27,1,6,27,31,2,31,9,35,1,5,35,39,1,10,39,43,1,10,43,47,2,13,47,51,1,10,51,55,2,55,10,59,1,9,59,63,2,6,63,67,1,5,67,71,1,71,5,75,1,5,75,79,2,79,13,83,1,83,5,87,2,6,87,91,1,5,91,95,1,95,9,99,1,99,6,103,1,103,13,107,1,107,5,111,2,111,13,115,1,115,6,119,1,6,119,123,2,123,13,127,1,10,127,131,1,131,2,135,1,135,5,0,99,2,14,0,0]
+
+-- Perform a single operation
+op' :: (Int -> Int -> Int) -> IOArray Int Int -> Int -> IO ()
+op' op mem i = do
+  x <- readArray mem (i + 1)
+  y <- readArray mem (i + 2)
+  z <- readArray mem (i + 3)
+  x <- readArray mem x
+  y <- readArray mem y
+  writeArray mem z (op x y)
+
+-- Parse a sequence of operations
+parse :: IOArray Int Int -> Int -> IO ()
+parse mem i = do
+  op <- readArray mem i
+  case op :: Int of
+    1 -> do
+      op' (+) mem i
+      parse mem (i + 4)
+    2 -> do
+      op' (*) mem i
+      parse mem (i + 4)
+    99 -> return ()
+    _ -> error "invalid op"
+
+-- Create a mutable array from init_array
+load' :: IO (IOArray Int Int)
+load' = do
+  mem <- newArray (0, (length init_mem) - 1) 0 :: IO (IOArray Int Int)
+  sequence_ $ do
+    (i, x) <- zip [0..] init_mem
+    return $ writeArray mem i x
+  return mem
+
+main = do
+
+  -- Part 1
+  mem <- load'
+  writeArray mem 1 12
+  writeArray mem 2 2
+  parse mem 0
+
+  -- Dump result
+  readArray mem 0 >>= print
+
+  -- Bruteforce attempt to find 'search'
+  let search = 19690720
+  sequence_ $ do
+    x <- [0..100]
+    y <- [0..100]
+    return $ do
+      mem <- load'
+      writeArray mem 1 x
+      writeArray mem 2 y
+      parse mem 0
+      z <- readArray mem 0
+      if z == search
+        then print (x, y, z, 100 * x + y)
+        else return ()

2019/2/main.hi

@@ -0,0 +1,111 @@
+-- Split a string of directions
+splitComma s = case dropWhile (== ',') s of
+  "" -> []
+  s' -> w : splitComma s''
+    where
+      (w, s'') = break (== ',') s'
+
+-- Convert a direction token to a vector
+parseToken :: String -> (Int, Int)
+parseToken (d:n) = case d of
+  'R' -> (read n, 0)
+  'D' -> (0, -read n)
+  'L' -> (-read n, 0)
+  'U' -> (0, read n)
+
+-- Add a vector to a point
+add (x, y) (dx, dy) = (x + dx, y + dy)
+
+-- Generate a list of points from consecutive vectors
+createPath p [] = [p]
+createPath p (d:ds) = p : createPath (add p d) ds
+
+between a m b = min a b <= m && m <= max a b
+
+-- Check if 2 wires intersect, i.e.
+--        x
+--
+--        y1
+--        |
+-- y   x1-+---x2
+--        |
+--        y2
+intersect (x, y1, y2) (y, x1, x2) =
+  between x1 x x2 && between y1 y y2
+
+-- Get all intersections with one straight wire
+intersection :: (Char, Int, Int, Int) -> [(Int, Int)] -> [(Int, Int)]
+intersection _ [_] = []
+intersection p@(d,c,a,b) ((ax,ay):q@(bx,by):wires) =
+  case d of
+    'x' ->
+      if ay - by == 0
+        then intersection p (q:wires)
+        else if intersect (c, a, b) (ax, ay, by)
+          then (ax, c) : intersection p (q:wires)
+          else intersection p (q:wires)
+    'y' ->
+      if ax - bx == 0
+        then intersection p (q:wires)
+        else if intersect (c, a, b) (ay, ax, bx)
+          then (c, ay) : intersection p (q:wires)
+          else intersection p (q:wires)
+
+-- Get all intersections between two wires
+intersections [_] _ = []
+intersections ((ax, ay):q@(bx, by):wires1) wires2
+  | ax == bx = intersection ('y', ax, ay, by) wires2 ++ intersections (q:wires1) wires2
+  | ay == by = intersection ('x', ay, ax, bx) wires2 ++ intersections (q:wires1) wires2
+
+-- Get the distance of a point from the origin
+distance (x, y) = abs x + abs y
+
+-- Get the point closest to the origin
+closestPoint (a:[]) = a
+closestPoint (a:b:ps)
+  | distance a < distance b = closestPoint (a:ps)
+  | otherwise               = closestPoint (b:ps)
+
+-- Get the amount of steps to take along a path to reach the given point
+stepsToPoint [_] _ = -1
+stepsToPoint ((ax, ay):b@(bx, by):path) p@(x, y)
+  | ax == x && bx == x = 
+    if between ay y by
+      then abs (ay - y)
+      else ly + stepsToPoint (b:path) p
+  | ay == y && by == y =
+    if between ax x bx
+      then abs (ax - x)
+      else lx + stepsToPoint (b:path) p
+  | ax == bx = ly + stepsToPoint (b:path) p
+  | ay == by = lx + stepsToPoint (b:path) p
+  where
+    lx = abs (ax - bx)
+    ly = abs (ay - by)
+
+-- Find the best intersection between two wires such that signal latency is
+-- minimal
+leastSteps w1 w2 (p:[]) = stepsToPoint w1 p + stepsToPoint w2 p
+leastSteps w1 w2 (p:ps) = min (leastSteps w1 w2 [p]) (leastSteps w1 w2 ps)
+
+main = do
+  let f l = createPath (0, 0) $ [parseToken x | x <- splitComma l]
+  let g a b = intersections a b
+
+  let a = f "R8,U5,L5,D3"
+      b = f "U7,R6,D4,L4"
+
+  let a = f "R75,D30,R83,U83,L12,D49,R71,U7,L72"
+      b = f "U62,R66,U55,R34,D71,R55,D58,R83"
+
+  let a = f "R990,U408,L583,U275,R483,U684,R437,U828,R108,U709,R378,U97,R252,D248,R413,U750,R428,D545,R570,D795,L204,D975,L557,U160,L861,U106,R436,U934,R81,D237,R660,U704,L451,U135,R282,D391,R39,D109,R125,U918,R214,U481,R853,U825,L91,D763,R335,U868,R42,U218,R152,D429,R414,D607,R28,U436,R7,U770,L215,D373,R209,U440,L536,U120,R900,D46,R635,D75,R58,U267,L581,U474,L858,U172,R725,U54,R291,D274,L583,D743,L130,U563,R137,U524,R659,D997,R131,D364,R883,D222,R628,U579,R801,D890,L519,D749,L620,U60,L759,D759,R376,U769,L910,D570,L814,U954,L153,D42,L784,D66,L844,U29,L794,D342,L924,U825,R447,U828,R404,D52,L330,D876,R125,U203,R245,U936,R866,D804,L186,U693,L620,D722,L32,D735,L191,D217,R68,U209,L736,U365,R280,U608,L450,D240,L282,U434,R589,U94,R470,D5,R49,U407,R552,D651,L69,U518,L358,D130,L710,D929,L315,U345,L511,D229,L557,U44,L890,D702,L181,D61,L208,U553,R878,U354,R787,U624,L961,D92,L891,U70,R203,U255,R532,U154,R299,U934,L609,D985,R115,U757,L13,D368,R936,D742,L412,U346,R56,D67,R371,D175,R868,U107,R806,D530,L40,U153,R374,D223,R517,D481,L194,U545,L356,U906,L999,D885,R967,U407,L141,U927,L489,U959,L992,U638,R332,U51,R256,U901,L891,U803,L885,U804,L242,U180,R277,U693,R935,D253,L68,D153,L614,D596,L999,D633,R995,D803,R17,U303,L569,U231,R737,D970,L45,D860,L225,D65,R41,D313,R698,D340,R599,D531,R55,D568,L911,D547,R196,D228,R868,D227,R262,U525,R104,D625,R570,U968,L276,D586,R690,D73,L336,U287,R294,U148,R781,D395,R478,D804,L429,U872,L351,D910,L597,U726,L320,D964,R928,U2,R540,D325,L222"
+      b = f "L998,U662,R342,U104,R140,U92,R67,D102,L225,U265,R641,U592,L295,D77,R415,U908,L640,D381,R312,U44,R424,D847,R892,D625,L337,D344,L917,D914,R127,D273,L627,U812,L200,D262,R226,U273,R911,U597,L888,U28,R921,U464,R254,U771,R818,D808,L239,D225,L280,U785,R322,D831,L622,U506,R139,U12,L491,D572,L172,U685,R54,U747,L812,D717,R874,U428,L867,U174,R360,D36,R217,D539,R210,D791,L82,D665,L190,D313,R649,U849,R63,U385,R105,U806,L207,U697,L823,D272,R830,D952,L386,U987,R775,U517,R139,D756,R545,D973,L743,D286,R261,U448,R946,U884,L903,D142,R28,D374,R259,U403,R689,D245,L302,D134,R710,U762,L67,D561,R801,D140,L887,U346,L227,U682,L350,D218,L711,U755,R226,D277,R114,D61,R992,U602,L191,U640,R733,D329,R862,U242,R754,D161,L52,D974,L251,D444,L552,U977,R174,U483,R869,D955,R925,U693,R610,D353,L843,U148,L866,D167,R412,D31,L847,D979,L282,D797,L837,U473,L402,U193,L332,D603,R48,D589,L760,D673,L843,U428,R779,D592,L688,D141,R851,D642,R559,U939,R999,D64,L297,U817,R670,U322,L768,D936,L39,U95,L342,U849,L692,U714,L732,D734,L373,U66,L577,D453,R336,U760,L217,U542,R920,U24,R529,D594,L34,D79,R877,D965,R932,U460,R879,U26,R803,U876,L780,U956,L235,D270,L315,D577,R835,U750,R414,D584,L828,U335,L563,U238,L815,U780,L550,U18,R743,D54,L816,U344,L806,D197,L518,D682,L835,U255,L666,U442,L286,D543,R102,D52,L570,D787,L763,D223,R279,D892,L828,D111,L554,D452,R575,D299,R932,D187,L439,U616,L278,D701,L360,D524,L891,U953,L896,U788,R776,U782,L71,D741,L652,U121,R669,D809,L662,U319,R392,D313,R870,U794,R937,D469,R571,D761,R947"
+
+  print a
+  print b
+  let c = filter (/= (0,0)) $ g a b
+      d = closestPoint c
+  print $ c
+  print $ d
+  print $ distance d
+  print $ leastSteps a b c

2019/2/main.hs

@@ -0,0 +1,105 @@
+-- I know this is utter crap and doesn't work, I just wanted to understand
+-- mutability in Haskell :(
+
+import Control.Monad
+import Data.Array.IO
+
+newField :: IO (IOArray (Int, Int) Int)
+newField = newArray ((-20000, -20000), (20000, 20000)) 0
+
+splitComma s = case dropWhile (== ',') s of
+  "" -> []
+  s' -> w : splitComma s'' where (w, s'') = break (== ',') s'
+
+parseToken :: String -> (Int, Int)
+parseToken (d:n) = case d of
+  'R' -> (read n, 0)
+  'D' -> (0, -read n)
+  'L' -> (-read n, 0)
+  'U' -> (0, read n)
+
+addDelta (x, y) (dx, dy) = (x + dx, y + dy)
+
+iter a b = [min a b..max a b]
+
+iter2 (ax, ay) (bx, by) = [(a, b) | a <- iter ax bx, b <- iter ay by]
+
+visit field p = do
+  v <- readArray field p
+  writeArray field p (v + 1)
+
+visitList :: (IOArray (Int, Int) Int) -> [(Int, Int)] -> IO ()
+visitList field [] = do
+  return ()
+visitList field (p:ps) = do
+  visit field p
+  visitList field ps
+  return ()
+
+step :: (IOArray (Int, Int) Int) -> (Int, Int) -> [(Int, Int)] -> IO ()
+step field start [] = do
+  return ()
+step field start (p:ps) = do
+  let s = addDelta start p
+  visitList field $ filter (/= start) $ iter2 start s
+  step field s ps
+
+crosses :: (Ix i) => (IOArray i Int) -> i -> IO Bool
+crosses field p = do
+  v <- readArray field p 
+  return $ v >= 2
+
+run field start walk = do
+  step field start wlk
+  where
+    wlk = [parseToken x | x <- splitComma walk]
+    noop x = x
+
+printField :: (IOArray (Int, Int) Int) -> (Int, Int) -> (Int, Int) -> IO ()
+printField field (dimBX, dimBY) (dimAX, dimAY) = do
+  sequence_ $ do
+    y <- iter dimAY dimBY
+    return $ do
+      sequence $ do
+        x <- iter dimAX dimBX
+        return $ do
+          v <- readArray field (x, y)
+          putStr (show v)
+      putStrLn ""
+  return ()
+
+
+solve field (ox, oy) a b = do
+  sequence_ $ do
+    (x, y) <- iter2 a b
+    return $ do
+      b <- crosses field (x, y)
+      if b
+        then print (x - ox, y - oy, x - ox + y - oy)
+        else return ()
+
+
+main = do
+  let a = "R8,U5,L5,D3"
+      b = "U7,R6,D4,L4"
+      ldim = (0, 0)
+      udim = (10, 10)
+  let a = "R75,D30,R83,U83,L12,D49,R71,U7,L72"
+      b = "U62,R66,U55,R34,D71,R55,D58,R83"
+      ldim = (-20, -70)
+      udim = (295, 225)
+  let a = "R990,U408,L583,U275,R483,U684,R437,U828,R108,U709,R378,U97,R252,D248,R413,U750,R428,D545,R570,D795,L204,D975,L557,U160,L861,U106,R436,U934,R81,D237,R660,U704,L451,U135,R282,D391,R39,D109,R125,U918,R214,U481,R853,U825,L91,D763,R335,U868,R42,U218,R152,D429,R414,D607,R28,U436,R7,U770,L215,D373,R209,U440,L536,U120,R900,D46,R635,D75,R58,U267,L581,U474,L858,U172,R725,U54,R291,D274,L583,D743,L130,U563,R137,U524,R659,D997,R131,D364,R883,D222,R628,U579,R801,D890,L519,D749,L620,U60,L759,D759,R376,U769,L910,D570,L814,U954,L153,D42,L784,D66,L844,U29,L794,D342,L924,U825,R447,U828,R404,D52,L330,D876,R125,U203,R245,U936,R866,D804,L186,U693,L620,D722,L32,D735,L191,D217,R68,U209,L736,U365,R280,U608,L450,D240,L282,U434,R589,U94,R470,D5,R49,U407,R552,D651,L69,U518,L358,D130,L710,D929,L315,U345,L511,D229,L557,U44,L890,D702,L181,D61,L208,U553,R878,U354,R787,U624,L961,D92,L891,U70,R203,U255,R532,U154,R299,U934,L609,D985,R115,U757,L13,D368,R936,D742,L412,U346,R56,D67,R371,D175,R868,U107,R806,D530,L40,U153,R374,D223,R517,D481,L194,U545,L356,U906,L999,D885,R967,U407,L141,U927,L489,U959,L992,U638,R332,U51,R256,U901,L891,U803,L885,U804,L242,U180,R277,U693,R935,D253,L68,D153,L614,D596,L999,D633,R995,D803,R17,U303,L569,U231,R737,D970,L45,D860,L225,D65,R41,D313,R698,D340,R599,D531,R55,D568,L911,D547,R196,D228,R868,D227,R262,U525,R104,D625,R570,U968,L276,D586,R690,D73,L336,U287,R294,U148,R781,D395,R478,D804,L429,U872,L351,D910,L597,U726,L320,D964,R928,U2,R540,D325,L222"
+      b = "L998,U662,R342,U104,R140,U92,R67,D102,L225,U265,R641,U592,L295,D77,R415,U908,L640,D381,R312,U44,R424,D847,R892,D625,L337,D344,L917,D914,R127,D273,L627,U812,L200,D262,R226,U273,R911,U597,L888,U28,R921,U464,R254,U771,R818,D808,L239,D225,L280,U785,R322,D831,L622,U506,R139,U12,L491,D572,L172,U685,R54,U747,L812,D717,R874,U428,L867,U174,R360,D36,R217,D539,R210,D791,L82,D665,L190,D313,R649,U849,R63,U385,R105,U806,L207,U697,L823,D272,R830,D952,L386,U987,R775,U517,R139,D756,R545,D973,L743,D286,R261,U448,R946,U884,L903,D142,R28,D374,R259,U403,R689,D245,L302,D134,R710,U762,L67,D561,R801,D140,L887,U346,L227,U682,L350,D218,L711,U755,R226,D277,R114,D61,R992,U602,L191,U640,R733,D329,R862,U242,R754,D161,L52,D974,L251,D444,L552,U977,R174,U483,R869,D955,R925,U693,R610,D353,L843,U148,L866,D167,R412,D31,L847,D979,L282,D797,L837,U473,L402,U193,L332,D603,R48,D589,L760,D673,L843,U428,R779,D592,L688,D141,R851,D642,R559,U939,R999,D64,L297,U817,R670,U322,L768,D936,L39,U95,L342,U849,L692,U714,L732,D734,L373,U66,L577,D453,R336,U760,L217,U542,R920,U24,R529,D594,L34,D79,R877,D965,R932,U460,R879,U26,R803,U876,L780,U956,L235,D270,L315,D577,R835,U750,R414,D584,L828,U335,L563,U238,L815,U780,L550,U18,R743,D54,L816,U344,L806,D197,L518,D682,L835,U255,L666,U442,L286,D543,R102,D52,L570,D787,L763,D223,R279,D892,L828,D111,L554,D452,R575,D299,R932,D187,L439,U616,L278,D701,L360,D524,L891,U953,L896,U788,R776,U782,L71,D741,L652,U121,R669,D809,L662,U319,R392,D313,R870,U794,R937,D469,R571,D761,R947"
+      ldim = (-20000, -20000)
+      udim = (20000, 20000)
+  
+  field <- newField
+  let port = (1, 1)
+  print ""
+  run field port a
+  --printField field ldim udim 
+  print ""
+  run field port b
+  --printField field ldim udim
+  print ""
+  solve field port ldim udim