, text
, megaparsec
+executable advent13
+ hs-source-dirs: src/advent13
+ main-is: advent13.hs
+ default-language: Haskell2010
+ build-depends: base >= 4.7 && < 5
+ , text
+ , megaparsec
+
--- /dev/null
+0: 4
+1: 2
+2: 3
+4: 5
+6: 8
+8: 4
+10: 6
+12: 6
+14: 6
+16: 10
+18: 6
+20: 12
+22: 8
+24: 9
+26: 8
+28: 8
+30: 8
+32: 12
+34: 12
+36: 12
+38: 8
+40: 10
+42: 14
+44: 12
+46: 14
+48: 12
+50: 12
+52: 12
+54: 14
+56: 14
+58: 14
+60: 12
+62: 14
+64: 14
+68: 12
+70: 14
+74: 14
+76: 14
+78: 14
+80: 17
+82: 28
+84: 18
+86: 14
\ No newline at end of file
--- /dev/null
+<!DOCTYPE html>
+<html lang="en-us">
+<head>
+<meta charset="utf-8"/>
+<title>Day 13 - Advent of Code 2017</title>
+<!--[if lt IE 9]><script src="/static/html5.js"></script><![endif]-->
+<link href='//fonts.googleapis.com/css?family=Source+Code+Pro:300&subset=latin,latin-ext' rel='stylesheet' type='text/css'>
+<link rel="stylesheet" type="text/css" href="/static/style.css?12"/>
+<link rel="stylesheet alternate" type="text/css" href="/static/highcontrast.css?0" title="High Contrast"/>
+<link rel="shortcut icon" href="/favicon.ico?2"/>
+</head><!--
+
+
+
+
+Oh, hello! Funny seeing you here.
+
+I appreciate your enthusiasm, but you aren't going to find much down here.
+There certainly aren't clues to any of the puzzles. The best surprises don't
+even appear in the source until you unlock them for real.
+
+Please be careful with automated requests; I'm not Google, and I can only take
+so much traffic. Please be considerate so that everyone gets to play.
+
+If you're curious about how Advent of Code works, it's running on some custom
+Perl code. Other than a few integrations (auth, analytics, ads, social media),
+I built the whole thing myself, including the design, animations, prose, and
+all of the puzzles.
+
+The puzzles probably took the longest; the easiest ones took an hour or two
+each, but the harder ones took 4-5 hours, and a few even longer than that. A
+lot of effort went into building this thing - I hope you're enjoying playing it
+as much as I enjoyed making it for you!
+
+If you'd like to hang out, I'm @ericwastl on Twitter.
+
+- Eric Wastl
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+-->
+<body>
+<header><div><h1 class="title-global"><a href="/">Advent of Code</a></h1><nav><ul><li><a href="/2017/about">[About]</a></li><li><a href="/2017/support">[AoC++]</a></li><li><a href="/2017/events">[Events]</a></li><li><a href="/2017/settings">[Settings]</a></li><li><a href="/2017/auth/logout">[Log Out]</a></li></ul></nav><div class="user">Neil Smith <span class="supporter">(AoC++)</span> <span class="star-count">26*</span></div></div><div><h1 class="title-event"> <span class="title-event-wrap">λy.</span><a href="/2017">2017</a><span class="title-event-wrap"></span></h1><nav><ul><li><a href="/2017">[Calendar]</a></li><li><a href="/2017/leaderboard">[Leaderboard]</a></li><li><a href="/2017/stats">[Stats]</a></li><li><a href="/2017/sponsors">[Sponsors]</a></li></ul></nav></div></header>
+
+<div id="sidebar">
+<div id="sponsor"><div class="quiet">Our <a href="/2017/sponsors">sponsors</a> help make Advent of Code possible:</div><p><a href="https://formlabs.com/" target="_blank" onclick="if(ga)ga('send','event','sponsor','click',this.href);" rel="noopener">Formlabs</a> - We make powerful, affordable 3D printers for professionals.</p></div>
+<div id="ad">
+<script async src="//pagead2.googlesyndication.com/pagead/js/adsbygoogle.js"></script>
+<!-- Advent of Code Wide Skyscraper -->
+<ins class="adsbygoogle"
+ style="display:inline-block;width:160px;height:600px"
+ data-ad-client="ca-pub-9420604735624631"
+ data-ad-slot="8014013294"></ins>
+<script>
+(adsbygoogle = window.adsbygoogle || []).push({});
+</script>
+</div><!--/ad-->
+</div><!--/sidebar-->
+
+<main>
+<article class="day-desc"><h2>--- Day 13: Packet Scanners ---</h2><p>You need to cross a vast <em>firewall</em>. The firewall consists of several layers, each with a <em>security scanner</em> that moves back and forth across the layer. To succeed, you must not be detected by a scanner.</p>
+<p>By studying the firewall briefly, you are able to record (in your puzzle input) the <em>depth</em> of each layer and the <em>range</em> of the scanning area for the scanner within it, written as <code>depth: range</code>. Each layer has a thickness of exactly <code>1</code>. A layer at depth <code>0</code> begins immediately inside the firewall; a layer at depth <code>1</code> would start immediately after that.</p>
+<p>For example, suppose you've recorded the following:</p>
+<pre><code>0: 3
+1: 2
+4: 4
+6: 4
+</code></pre>
+<p>This means that there is a layer immediately inside the firewall (with range <code>3</code>), a second layer immediately after that (with range <code>2</code>), a third layer which begins at depth <code>4</code> (with range <code>4</code>), and a fourth layer which begins at depth 6 (also with range <code>4</code>). Visually, it might look like this:</p>
+<pre><code> 0 1 2 3 4 5 6
+[ ] [ ] ... ... [ ] ... [ ]
+[ ] [ ] [ ] [ ]
+[ ] [ ] [ ]
+ [ ] [ ]
+</code></pre>
+<p>Within each layer, a security scanner moves back and forth within its range. Each security scanner starts at the top and moves down until it reaches the bottom, then moves up until it reaches the top, and repeats. A security scanner takes <em>one picosecond</em> to move one step. Drawing scanners as <code>S</code>, the first few picoseconds look like this:</p>
+<pre><code>
+Picosecond 0:
+ 0 1 2 3 4 5 6
+[S] [S] ... ... [S] ... [S]
+[ ] [ ] [ ] [ ]
+[ ] [ ] [ ]
+ [ ] [ ]
+
+Picosecond 1:
+ 0 1 2 3 4 5 6
+[ ] [ ] ... ... [ ] ... [ ]
+[S] [S] [S] [S]
+[ ] [ ] [ ]
+ [ ] [ ]
+
+Picosecond 2:
+ 0 1 2 3 4 5 6
+[ ] [S] ... ... [ ] ... [ ]
+[ ] [ ] [ ] [ ]
+[S] [S] [S]
+ [ ] [ ]
+
+Picosecond 3:
+ 0 1 2 3 4 5 6
+[ ] [ ] ... ... [ ] ... [ ]
+[S] [S] [ ] [ ]
+[ ] [ ] [ ]
+ [S] [S]
+</code></pre>
+<p>Your plan is to hitch a ride on a packet about to move through the firewall. The packet will travel along the top of each layer, and it moves at <em>one layer per picosecond</em>. Each picosecond, the packet moves one layer forward (its first move takes it into layer 0), and then the scanners move one step. If there is a scanner at the top of the layer <em>as your packet enters it</em>, you are <em>caught</em>. (If a scanner moves into the top of its layer while you are there, you are <em>not</em> caught: it doesn't have time to notice you before you leave.) If you were to do this in the configuration above, marking your current position with parentheses, your passage through the firewall would look like this:</p>
+<pre><code>Initial state:
+ 0 1 2 3 4 5 6
+[S] [S] ... ... [S] ... [S]
+[ ] [ ] [ ] [ ]
+[ ] [ ] [ ]
+ [ ] [ ]
+
+Picosecond 0:
+ 0 1 2 3 4 5 6
+(S) [S] ... ... [S] ... [S]
+[ ] [ ] [ ] [ ]
+[ ] [ ] [ ]
+ [ ] [ ]
+
+ 0 1 2 3 4 5 6
+( ) [ ] ... ... [ ] ... [ ]
+[S] [S] [S] [S]
+[ ] [ ] [ ]
+ [ ] [ ]
+
+
+Picosecond 1:
+ 0 1 2 3 4 5 6
+[ ] ( ) ... ... [ ] ... [ ]
+[S] [S] [S] [S]
+[ ] [ ] [ ]
+ [ ] [ ]
+
+ 0 1 2 3 4 5 6
+[ ] (S) ... ... [ ] ... [ ]
+[ ] [ ] [ ] [ ]
+[S] [S] [S]
+ [ ] [ ]
+
+
+Picosecond 2:
+ 0 1 2 3 4 5 6
+[ ] [S] (.) ... [ ] ... [ ]
+[ ] [ ] [ ] [ ]
+[S] [S] [S]
+ [ ] [ ]
+
+ 0 1 2 3 4 5 6
+[ ] [ ] (.) ... [ ] ... [ ]
+[S] [S] [ ] [ ]
+[ ] [ ] [ ]
+ [S] [S]
+
+
+Picosecond 3:
+ 0 1 2 3 4 5 6
+[ ] [ ] ... (.) [ ] ... [ ]
+[S] [S] [ ] [ ]
+[ ] [ ] [ ]
+ [S] [S]
+
+ 0 1 2 3 4 5 6
+[S] [S] ... (.) [ ] ... [ ]
+[ ] [ ] [ ] [ ]
+[ ] [S] [S]
+ [ ] [ ]
+
+
+Picosecond 4:
+ 0 1 2 3 4 5 6
+[S] [S] ... ... ( ) ... [ ]
+[ ] [ ] [ ] [ ]
+[ ] [S] [S]
+ [ ] [ ]
+
+ 0 1 2 3 4 5 6
+[ ] [ ] ... ... ( ) ... [ ]
+[S] [S] [S] [S]
+[ ] [ ] [ ]
+ [ ] [ ]
+
+
+Picosecond 5:
+ 0 1 2 3 4 5 6
+[ ] [ ] ... ... [ ] (.) [ ]
+[S] [S] [S] [S]
+[ ] [ ] [ ]
+ [ ] [ ]
+
+ 0 1 2 3 4 5 6
+[ ] [S] ... ... [S] (.) [S]
+[ ] [ ] [ ] [ ]
+[S] [ ] [ ]
+ [ ] [ ]
+
+
+Picosecond 6:
+ 0 1 2 3 4 5 6
+[ ] [S] ... ... [S] ... (S)
+[ ] [ ] [ ] [ ]
+[S] [ ] [ ]
+ [ ] [ ]
+
+ 0 1 2 3 4 5 6
+[ ] [ ] ... ... [ ] ... ( )
+[S] [S] [S] [S]
+[ ] [ ] [ ]
+ [ ] [ ]
+</code></pre>
+<p>In this situation, you are <em>caught</em> in layers <code>0</code> and <code>6</code>, because your packet entered the layer when its scanner was at the top when you entered it. You are <em>not</em> caught in layer <code>1</code>, since the scanner moved into the top of the layer once you were already there.</p>
+<p>The <em>severity</em> of getting caught on a layer is equal to its <em>depth</em> multiplied by its <em>range</em>. (Ignore layers in which you do not get caught.) The severity of the whole trip is the sum of these values. In the example above, the trip severity is <code>0*3 + 6*4 = <em>24</em></code>.</p>
+<p>Given the details of the firewall you've recorded, if you leave immediately, <em>what is the severity of your whole trip</em>?</p>
+</article>
+<p>Your puzzle answer was <code>1904</code>.</p><article class="day-desc"><h2>--- Part Two ---</h2><p>Now, you need to pass through the firewall without being caught - easier said than done.</p>
+<p>You can't control the <span title="Seriously, what network stack doesn't let you adjust the speed of light?">speed of the packet</span>, but you can <em>delay</em> it any number of picoseconds. For each picosecond you delay the packet before beginning your trip, all security scanners move one step. You're not in the firewall during this time; you don't enter layer <code>0</code> until you stop delaying the packet.</p>
+<p>In the example above, if you delay <code>10</code> picoseconds (picoseconds <code>0</code> - <code>9</code>), you won't get caught:</p>
+<pre><code>State after delaying:
+ 0 1 2 3 4 5 6
+[ ] [S] ... ... [ ] ... [ ]
+[ ] [ ] [ ] [ ]
+[S] [S] [S]
+ [ ] [ ]
+
+Picosecond 10:
+ 0 1 2 3 4 5 6
+( ) [S] ... ... [ ] ... [ ]
+[ ] [ ] [ ] [ ]
+[S] [S] [S]
+ [ ] [ ]
+
+ 0 1 2 3 4 5 6
+( ) [ ] ... ... [ ] ... [ ]
+[S] [S] [S] [S]
+[ ] [ ] [ ]
+ [ ] [ ]
+
+
+Picosecond 11:
+ 0 1 2 3 4 5 6
+[ ] ( ) ... ... [ ] ... [ ]
+[S] [S] [S] [S]
+[ ] [ ] [ ]
+ [ ] [ ]
+
+ 0 1 2 3 4 5 6
+[S] (S) ... ... [S] ... [S]
+[ ] [ ] [ ] [ ]
+[ ] [ ] [ ]
+ [ ] [ ]
+
+
+Picosecond 12:
+ 0 1 2 3 4 5 6
+[S] [S] (.) ... [S] ... [S]
+[ ] [ ] [ ] [ ]
+[ ] [ ] [ ]
+ [ ] [ ]
+
+ 0 1 2 3 4 5 6
+[ ] [ ] (.) ... [ ] ... [ ]
+[S] [S] [S] [S]
+[ ] [ ] [ ]
+ [ ] [ ]
+
+
+Picosecond 13:
+ 0 1 2 3 4 5 6
+[ ] [ ] ... (.) [ ] ... [ ]
+[S] [S] [S] [S]
+[ ] [ ] [ ]
+ [ ] [ ]
+
+ 0 1 2 3 4 5 6
+[ ] [S] ... (.) [ ] ... [ ]
+[ ] [ ] [ ] [ ]
+[S] [S] [S]
+ [ ] [ ]
+
+
+Picosecond 14:
+ 0 1 2 3 4 5 6
+[ ] [S] ... ... ( ) ... [ ]
+[ ] [ ] [ ] [ ]
+[S] [S] [S]
+ [ ] [ ]
+
+ 0 1 2 3 4 5 6
+[ ] [ ] ... ... ( ) ... [ ]
+[S] [S] [ ] [ ]
+[ ] [ ] [ ]
+ [S] [S]
+
+
+Picosecond 15:
+ 0 1 2 3 4 5 6
+[ ] [ ] ... ... [ ] (.) [ ]
+[S] [S] [ ] [ ]
+[ ] [ ] [ ]
+ [S] [S]
+
+ 0 1 2 3 4 5 6
+[S] [S] ... ... [ ] (.) [ ]
+[ ] [ ] [ ] [ ]
+[ ] [S] [S]
+ [ ] [ ]
+
+
+Picosecond 16:
+ 0 1 2 3 4 5 6
+[S] [S] ... ... [ ] ... ( )
+[ ] [ ] [ ] [ ]
+[ ] [S] [S]
+ [ ] [ ]
+
+ 0 1 2 3 4 5 6
+[ ] [ ] ... ... [ ] ... ( )
+[S] [S] [S] [S]
+[ ] [ ] [ ]
+ [ ] [ ]
+</code></pre>
+<p>Because all smaller delays would get you caught, the fewest number of picoseconds you would need to delay to get through safely is <code>10</code>.</p>
+<p><em>What is the fewest number of picoseconds</em> that you need to delay the packet to pass through the firewall without being caught?</p>
+</article>
+<p>Your puzzle answer was <code>3833504</code>.</p><p class="day-success">Both parts of this puzzle are complete! They provide two gold stars: **</p>
+<p>At this point, you should <a href="/2017">return to your advent calendar</a> and try another puzzle.</p>
+<p>If you still want to see it, you can <a href="13/input" target="_blank">get your puzzle input</a>.</p>
+<p>You can also <span class="share">[Share<span class="share-content">on
+ <a href="https://twitter.com/intent/tweet?text=I%27ve+completed+%22Packet+Scanners%22+%2D+Day+13+%2D+Advent+of+Code+2017&url=http%3A%2F%2Fadventofcode%2Ecom%2F2017%2Fday%2F13&related=ericwastl&hashtags=AdventOfCode" target="_blank">Twitter</a>
+ <a href="https://plus.google.com/share?url=http%3A%2F%2Fadventofcode%2Ecom%2F2017%2Fday%2F13" target="_blank">Google+</a>
+ <a href="http://www.reddit.com/submit?url=http%3A%2F%2Fadventofcode%2Ecom%2F2017%2Fday%2F13&title=I%27ve+completed+%22Packet+Scanners%22+%2D+Day+13+%2D+Advent+of+Code+2017" target="_blank">Reddit</a
+></span>]</span> this puzzle.</p>
+</main>
+
+<!-- ga -->
+<script>
+(function(i,s,o,g,r,a,m){i['GoogleAnalyticsObject']=r;i[r]=i[r]||function(){
+(i[r].q=i[r].q||[]).push(arguments)},i[r].l=1*new Date();a=s.createElement(o),
+m=s.getElementsByTagName(o)[0];a.async=1;a.src=g;m.parentNode.insertBefore(a,m)
+})(window,document,'script','//www.google-analytics.com/analytics.js','ga');
+ga('create', 'UA-69522494-1', 'auto');
+ga('send', 'pageview');
+</script>
+<!-- /ga -->
+</body>
+</html>
\ No newline at end of file
--- /dev/null
+{-# LANGUAGE NegativeLiterals #-}
+{-# LANGUAGE FlexibleContexts #-}
+{-# LANGUAGE OverloadedStrings #-}
+
+import Data.Text (Text)
+import qualified Data.Text as T
+import qualified Data.Text.IO as TIO
+
+import Text.Megaparsec
+import qualified Text.Megaparsec.Lexer as L
+import Text.Megaparsec.Text (Parser)
+
+import qualified Control.Applicative as CA
+
+type ScannerDef = (Integer, Integer)
+type Scanner = Integer -> Integer
+
+
+main :: IO ()
+main = do
+ text <- TIO.readFile "data/advent13.txt"
+ let scannerDefs = successfulParse text
+ print $ part1 scannerDefs
+ print $ part2 scannerDefs
+
+
+part1 :: [ScannerDef] -> Integer
+part1 = sum . map (uncurry (*)) . filter (\(d, r) -> scanner d r 0 == 0)
+
+
+part2 :: [ScannerDef] -> Integer
+part2 scannerDefs = head $ filter (canPass scanners) [0..]
+ where scanners = scanify scannerDefs
+
+
+scanify :: [ScannerDef] -> [Scanner]
+scanify = map (uncurry scanner)
+
+canPass :: [Scanner] -> Integer -> Bool
+canPass scannersF t = all (\s -> s t /= 0) scannersF
+
+
+scanner :: Integer -> Integer -> Integer -> Integer
+scanner depth range t =
+ let t' = (t + depth) `mod` ((range - 1) * 2)
+ in if t' < range
+ then t'
+ else range - t' - 1 -- t' + (t' - range + 1) * -2
+
+
+sc :: Parser ()
+sc = L.space (skipSome spaceChar) CA.empty CA.empty
+
+lexeme = L.lexeme sc
+integer = lexeme L.integer
+symb = L.symbol sc
+
+scannersP = many scannerP
+
+scannerP = (,) <$> integer <*> (symb ":" *> integer)
+
+successfulParse :: Text -> [ScannerDef]
+successfulParse input =
+ case parse scannersP "input" input of
+ Left err -> [] -- TIO.putStr $ T.pack $ parseErrorPretty err
+ Right scanners -> scanners
\ No newline at end of file
--- /dev/null
+{
+ "cells": [
+ {
+ "cell_type": "code",
+ "execution_count": 1,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "{-# LANGUAGE NegativeLiterals #-}\n",
+ "{-# LANGUAGE FlexibleContexts #-}\n",
+ "{-# LANGUAGE OverloadedStrings #-}"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 4,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "import Data.Text (Text)\n",
+ "import qualified Data.Text as T\n",
+ "import qualified Data.Text.IO as TIO\n",
+ "\n",
+ "import Text.Megaparsec\n",
+ "import qualified Text.Megaparsec.Lexer as L\n",
+ "import Text.Megaparsec.Text (Parser)\n",
+ "\n",
+ "import qualified Data.Map.Strict as M\n",
+ "import Data.Map.Strict ((!))\n",
+ "\n",
+ "import qualified Data.Set as S\n",
+ "import qualified Control.Applicative as CA"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 49,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "scanner :: Integer -> Integer -> Integer -> Integer\n",
+ "scanner depth range t = \n",
+ " let t' = (t + depth) `mod` ((range - 1) * 2)\n",
+ " in if t' < range\n",
+ " then t' \n",
+ " else t' + (t' - range + 1) * -2"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 48,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "sc :: Parser ()\n",
+ "sc = L.space (skipSome spaceChar) CA.empty CA.empty\n",
+ "\n",
+ "lexeme = L.lexeme sc\n",
+ "integer = lexeme L.integer\n",
+ "symb = L.symbol sc\n",
+ "\n",
+ "scannersP = many scannerP\n",
+ "\n",
+ "scannerP = (,) <$> integer <*> (symb \":\" *> integer)\n",
+ "\n",
+ "successfulParse :: Text -> [(Integer, Integer)]\n",
+ "successfulParse input = \n",
+ " case parse scannersP \"input\" input of\n",
+ " Left err -> [] -- TIO.putStr $ T.pack $ parseErrorPretty err\n",
+ " Right scanners -> scanners"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "[0,1,2,3,4, 3, 2, 1,0,1,2,3] res = t' + x\n",
+ "[0,1,2,3,4, 5, 6, 7,0,1,2,3] t'\n",
+ "[ 0, 1, 2 t' - len\n",
+ " -2,-4,-6 x\n",
+ "\n",
+ "cycle is 5 + (5-2) = 8\n",
+ "\n",
+ "if t' <= 5 then t' else 5 - t' + 1\n",
+ "\n",
+ "\n",
+ "0 1 2 3 4 5 6 7 8 \n",
+ "S . . . . . . .\n",
+ ". S . . . . . .\n",
+ ". . S . . . . .\n",
+ ". . . S . . . .\n",
+ ". . . . S . . .\n",
+ ". . . . . S . .\n",
+ ". . . . . . S .\n",
+ ". . . . . . . S\n",
+ "\n"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 50,
+ "metadata": {},
+ "outputs": [
+ {
+ "data": {
+ "text/plain": [
+ "[0,1,2,3,4,3,2,1,0,1,2,3,4,3,2,1,0,1,2,3,4]"
+ ]
+ },
+ "metadata": {},
+ "output_type": "display_data"
+ }
+ ],
+ "source": [
+ "s50 = scanner 0 5\n",
+ "map s50 [0..20]"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 51,
+ "metadata": {},
+ "outputs": [
+ {
+ "data": {
+ "text/plain": [
+ "[0,1,2,1,0,1,2,1,0,1,2,1,0,1,2,1,0,1,2,1,0]"
+ ]
+ },
+ "metadata": {},
+ "output_type": "display_data"
+ }
+ ],
+ "source": [
+ "s30 = scanner 0 3\n",
+ "map s30 [0..20]"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 52,
+ "metadata": {},
+ "outputs": [
+ {
+ "data": {
+ "text/plain": [
+ "[3,2,1,0,1,2,3,2,1,0,1,2,3,2,1,0,1,2,3,2,1]"
+ ]
+ },
+ "metadata": {},
+ "output_type": "display_data"
+ }
+ ],
+ "source": [
+ "map (scanner 3 4) [0..20]"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 53,
+ "metadata": {},
+ "outputs": [
+ {
+ "data": {
+ "text/plain": [
+ "[0,1,2,0]"
+ ]
+ },
+ "metadata": {},
+ "output_type": "display_data"
+ }
+ ],
+ "source": [
+ "[scanner 0 3 0, scanner 1 2 0, scanner 4 4 0, scanner 6 4 0]"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 55,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "sample = [(0, 3), (1, 2), (4, 4), (6, 4)]"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 58,
+ "metadata": {},
+ "outputs": [
+ {
+ "data": {
+ "text/plain": [
+ "24"
+ ]
+ },
+ "metadata": {},
+ "output_type": "display_data"
+ }
+ ],
+ "source": [
+ "sum $ map (uncurry (*)) $ filter (\\(d, r) -> scanner d r 0 == 0) sample "
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 61,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "part1 :: [(Integer, Integer)] -> Integer\n",
+ "part1 = sum . map (uncurry (*)) . filter (\\(d, r) -> scanner d r 0 == 0)"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 65,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "main :: IO ()\n",
+ "main = do \n",
+ " text <- TIO.readFile \"../../data/advent13.txt\"\n",
+ " let instrs = successfulParse text\n",
+ " print $ part1 instrs"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 66,
+ "metadata": {},
+ "outputs": [
+ {
+ "data": {
+ "text/plain": [
+ "1904"
+ ]
+ },
+ "metadata": {},
+ "output_type": "display_data"
+ }
+ ],
+ "source": [
+ "main"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 68,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "scanify = map (uncurry scanner)"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 76,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "canPass scannersF t = all (\\s -> s t /= 0) scannersF"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 77,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "scs = scanify sample"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 82,
+ "metadata": {},
+ "outputs": [
+ {
+ "data": {
+ "text/plain": [
+ "10"
+ ]
+ },
+ "metadata": {},
+ "output_type": "display_data"
+ }
+ ],
+ "source": [
+ "head $ filter (canPass scs) [0..]"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 81,
+ "metadata": {},
+ "outputs": [
+ {
+ "data": {
+ "text/plain": [
+ "[2,1,2,2]"
+ ]
+ },
+ "metadata": {},
+ "output_type": "display_data"
+ }
+ ],
+ "source": [
+ "map (\\s -> s 10) scs"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 83,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "part2 scannerDefs = head $ filter (canPass scanners) [0..]\n",
+ " where scanners = scanify scannerDefs"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 84,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "main :: IO ()\n",
+ "main = do \n",
+ " text <- TIO.readFile \"../../data/advent13.txt\"\n",
+ " let instrs = successfulParse text\n",
+ " print $ part1 instrs\n",
+ " print $ part2 instrs"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 85,
+ "metadata": {},
+ "outputs": [
+ {
+ "data": {
+ "text/plain": [
+ "1904\n",
+ "3833504"
+ ]
+ },
+ "metadata": {},
+ "output_type": "display_data"
+ }
+ ],
+ "source": [
+ "main"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": []
+ }
+ ],
+ "metadata": {
+ "kernelspec": {
+ "display_name": "Haskell",
+ "language": "haskell",
+ "name": "haskell"
+ },
+ "language_info": {
+ "codemirror_mode": "ihaskell",
+ "file_extension": ".hs",
+ "name": "haskell",
+ "version": "8.0.2"
+ }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}
projects / advent-of-code-17.git / commitdiff