-
Notifications
You must be signed in to change notification settings - Fork 8
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
21 changed files
with
376 additions
and
107 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,129 @@ | ||
| <!DOCTYPE html> | ||
| <html lang="en-us"> | ||
| <head> | ||
| <meta charset="utf-8" /> | ||
| <title>Day 14 - Advent of Code 2023</title> | ||
| <link href='https://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" /> | ||
| <link rel="stylesheet alternate" type="text/css" href="../static/highcontrast.css" title="High Contrast" /> | ||
| <link rel="shortcut icon" href="../static/favicon.png" /> | ||
| </head> | ||
| <body> | ||
| <header> | ||
| <div> | ||
| <h1 class="title-global"><a href="index.html">Advent of Code</a></h1> | ||
| <nav> | ||
| <ul> | ||
| <li><a href="events.html">[Events]</a></li> | ||
| <li><a href="leaderboard.html">[Leaderboard]</a></li> | ||
| <li><a href="solver.html">[Solver]</a></li> | ||
| </ul> | ||
| </nav> | ||
| <div class="user">Shahar Talmi <a class="supporter-badge" title="Advent of Code Supporter">(AoC++)</a> <a | ||
| href="https://www.wix.engineering/" target="_blank" class="sponsor-badge" | ||
| title="Member of sponsor: Wix Engineering">(Sponsor)</a> <span class="star-count">28*</span></div> | ||
| </div> | ||
| <div> | ||
| <h1 class="title-event"> <span class="title-event-wrap">$year=</span><a | ||
| href="index.html">2023</a><span class="title-event-wrap">;</span></h1> | ||
| </div> | ||
| </header> | ||
| <main> | ||
| <article class="day-desc"><h2>--- Day 14: Parabolic Reflector Dish ---</h2><p>You reach the place where all of the mirrors were pointing: a massive <a href="https://en.wikipedia.org/wiki/Parabolic_reflector" target="_blank">parabolic reflector dish</a> <span title="Why, where do you attach YOUR massive parabolic reflector dishes?">attached</span> to the side of another large mountain.</p> | ||
| <p>The dish is made up of many small mirrors, but while the mirrors themselves are roughly in the shape of a parabolic reflector dish, each individual mirror seems to be pointing in slightly the wrong direction. If the dish is meant to focus light, all it's doing right now is sending it in a vague direction.</p> | ||
| <p>This system must be what provides the energy for the lava! If you focus the reflector dish, maybe you can go where it's pointing and use the light to fix the lava production.</p> | ||
| <p>Upon closer inspection, the individual mirrors each appear to be connected via an elaborate system of ropes and pulleys to a large metal platform below the dish. The platform is covered in large rocks of various shapes. Depending on their position, the weight of the rocks deforms the platform, and the shape of the platform controls which ropes move and ultimately the focus of the dish.</p> | ||
| <p>In short: if you move the rocks, you can focus the dish. The platform even has a control panel on the side that lets you <em>tilt</em> it in one of four directions! The rounded rocks (<code>O</code>) will roll when the platform is tilted, while the cube-shaped rocks (<code>#</code>) will stay in place. You note the positions of all of the empty spaces (<code>.</code>) and rocks (your puzzle input). For example:</p> | ||
| <pre><code>O....#.... | ||
| O.OO#....# | ||
| .....##... | ||
| OO.#O....O | ||
| .O.....O#. | ||
| O.#..O.#.# | ||
| ..O..#O..O | ||
| .......O.. | ||
| #....###.. | ||
| #OO..#.... | ||
| </code></pre> | ||
| <p>Start by tilting the lever so all of the rocks will slide <em>north</em> as far as they will go:</p> | ||
| <pre><code>OOOO.#.O.. | ||
| OO..#....# | ||
| OO..O##..O | ||
| O..#.OO... | ||
| ........#. | ||
| ..#....#.# | ||
| ..O..#.O.O | ||
| ..O....... | ||
| #....###.. | ||
| #....#.... | ||
| </code></pre> | ||
| <p>You notice that the support beams along the north side of the platform are <em>damaged</em>; to ensure the platform doesn't collapse, you should calculate the <em>total load</em> on the north support beams.</p> | ||
| <p>The amount of load caused by a single rounded rock (<code>O</code>) is equal to the number of rows from the rock to the south edge of the platform, including the row the rock is on. (Cube-shaped rocks (<code>#</code>) don't contribute to load.) So, the amount of load caused by each rock in each row is as follows:</p> | ||
| <pre><code>OOOO.#.O.. 10 | ||
| OO..#....# 9 | ||
| OO..O##..O 8 | ||
| O..#.OO... 7 | ||
| ........#. 6 | ||
| ..#....#.# 5 | ||
| ..O..#.O.O 4 | ||
| ..O....... 3 | ||
| #....###.. 2 | ||
| #....#.... 1 | ||
| </code></pre> | ||
| <p>The total load is the sum of the load caused by all of the <em>rounded rocks</em>. In this example, the total load is <code><em>136</em></code>.</p> | ||
| <p>Tilt the platform so that the rounded rocks all roll north. Afterward, <em>what is the total load on the north support beams?</em></p> | ||
| </article> | ||
| <p>Your puzzle answer was <code>105784</code>.</p><article class="day-desc"><h2 id="part2">--- Part Two ---</h2><p>The parabolic reflector dish deforms, but not in a way that focuses the beam. To do that, you'll need to move the rocks to the edges of the platform. Fortunately, a button on the side of the control panel labeled "<em>spin cycle</em>" attempts to do just that!</p> | ||
| <p>Each <em>cycle</em> tilts the platform four times so that the rounded rocks roll <em>north</em>, then <em>west</em>, then <em>south</em>, then <em>east</em>. After each tilt, the rounded rocks roll as far as they can before the platform tilts in the next direction. After one cycle, the platform will have finished rolling the rounded rocks in those four directions in that order.</p> | ||
| <p>Here's what happens in the example above after each of the first few cycles:</p> | ||
| <pre><code>After 1 cycle: | ||
| .....#.... | ||
| ....#...O# | ||
| ...OO##... | ||
| .OO#...... | ||
| .....OOO#. | ||
| .O#...O#.# | ||
| ....O#.... | ||
| ......OOOO | ||
| #...O###.. | ||
| #..OO#.... | ||
|
|
||
| After 2 cycles: | ||
| .....#.... | ||
| ....#...O# | ||
| .....##... | ||
| ..O#...... | ||
| .....OOO#. | ||
| .O#...O#.# | ||
| ....O#...O | ||
| .......OOO | ||
| #..OO###.. | ||
| #.OOO#...O | ||
|
|
||
| After 3 cycles: | ||
| .....#.... | ||
| ....#...O# | ||
| .....##... | ||
| ..O#...... | ||
| .....OOO#. | ||
| .O#...O#.# | ||
| ....O#...O | ||
| .......OOO | ||
| #...O###.O | ||
| #.OOO#...O | ||
| </code></pre> | ||
| <p>This process should work if you leave it running long enough, but you're still worried about the north support beams. To make sure they'll survive for a while, you need to calculate the <em>total load</em> on the north support beams after <code>1000000000</code> cycles.</p> | ||
| <p>In the above example, after <code>1000000000</code> cycles, the total load on the north support beams is <code><em>64</em></code>.</p> | ||
| <p>Run the spin cycle for <code>1000000000</code> cycles. Afterward, <em>what is the total load on the north support beams?</em></p> | ||
| </article> | ||
| <p>Your puzzle answer was <code>91286</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="index.html">return to your Advent calendar</a> and try another puzzle.</p> | ||
| <p>If you still want to see it, you can <a href="day14.txt" 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+%22Parabolic+Reflector+Dish%22+%2D+Day+14+%2D+Advent+of+Code+2023&url=https%3A%2F%2Fadventofcode%2Ecom%2F2023%2Fday%2F14&related=ericwastl&hashtags=AdventOfCode" target="_blank">Twitter</a> | ||
| <a href="javascript:void(0);" onclick="var ms; try{ms=localStorage.getItem('mastodon.server')}finally{} if(typeof ms!=='string')ms=''; ms=prompt('Mastodon Server?',ms); if(typeof ms==='string' && ms.length){this.href='https://'+ms+'/share?text=I%27ve+completed+%22Parabolic+Reflector+Dish%22+%2D+Day+14+%2D+Advent+of+Code+2023+%23AdventOfCode+https%3A%2F%2Fadventofcode%2Ecom%2F2023%2Fday%2F14';try{localStorage.setItem('mastodon.server',ms);}finally{}}else{return false;}" target="_blank">Mastodon</a | ||
| ></span>]</span> this puzzle.</p> | ||
| </main> | ||
| </body> | ||
| </html> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,102 +1,56 @@ | ||
| function north(lines) { | ||
| function vertical(lines, add = 1) { | ||
| for (let x = 0; x < lines[0].length; x++) { | ||
| let target = 0; | ||
| for (let y = 0; y < lines.length; y++) { | ||
| let target = add > 0 ? 0 : lines.length - 1; | ||
| for (let y = target; y >= 0 && y < lines.length; y += add) { | ||
| if (lines[y][x] === 'O') { | ||
| lines[y][x] = '.'; | ||
| lines[target][x] = 'O'; | ||
| target++; | ||
| } | ||
| if (lines[y][x] === '#') { | ||
| target = y + 1; | ||
| } | ||
| } | ||
| } | ||
| } | ||
|
|
||
| function west(lines) { | ||
| for (let y = 0; y < lines.length; y++) { | ||
| let target = 0; | ||
| for (let x = 0; x < lines[0].length; x++) { | ||
| if (lines[y][x] === 'O') { | ||
| lines[y][x] = '.'; | ||
| lines[y][target] = 'O'; | ||
| target++; | ||
| } | ||
| if (lines[y][x] === '#') { | ||
| target = x + 1; | ||
| } | ||
| } | ||
| } | ||
| } | ||
|
|
||
| function south(lines) { | ||
| for (let x = 0; x < lines[0].length; x++) { | ||
| let target = lines.length - 1; | ||
| for (let y = lines.length - 1; y >= 0; y--) { | ||
| if (lines[y][x] === 'O') { | ||
| lines[y][x] = '.'; | ||
| lines[target][x] = 'O'; | ||
| target--; | ||
| } | ||
| if (lines[y][x] === '#') { | ||
| target = y - 1; | ||
| target += add; | ||
| } | ||
| if (lines[y][x] === '#') target = y + add; | ||
| } | ||
| } | ||
| } | ||
|
|
||
| function east(lines) { | ||
| function horizontal(lines, add = 1) { | ||
| for (let y = 0; y < lines.length; y++) { | ||
| let target = lines[0].length - 1; | ||
| for (let x = lines[0].length - 1; x >= 0; x--) { | ||
| let target = add > 0 ? 0 : lines[0].length - 1; | ||
| for (let x = target; x >= 0 && x < lines[0].length; x += add) { | ||
| if (lines[y][x] === 'O') { | ||
| lines[y][x] = '.'; | ||
| lines[y][target] = 'O'; | ||
| target--; | ||
| } | ||
| if (lines[y][x] === '#') { | ||
| target = x - 1; | ||
| target += add; | ||
| } | ||
| if (lines[y][x] === '#') target = x + add; | ||
| } | ||
| } | ||
| } | ||
|
|
||
| function weight(lines) { | ||
| let result = 0; | ||
| for (let i = 0; i < lines[0].length; i++) { | ||
| for (let j = 0; j < lines.length; j++) { | ||
| if (lines[j][i] === 'O') { | ||
| result += lines.length - j; | ||
| } | ||
| } | ||
| } | ||
| return result; | ||
| return lines.reduce((acc, line, y) => { | ||
| return acc + line.filter(x => x === 'O').length * (lines.length - y); | ||
| }, 0); | ||
| } | ||
|
|
||
| export function part1(input) { | ||
| const lines = input.split('\n').map(line => line.split('')); | ||
| north(lines); | ||
| vertical(lines, 1); | ||
| return weight(lines); | ||
| } | ||
|
|
||
| export function part2(input) { | ||
| const lines = input.split('\n').map(line => line.split('')); | ||
| const memory = new Map(); | ||
| const count = 1000000000; | ||
| for (let i = 0; i < count; i++) { | ||
| north(lines); | ||
| west(lines); | ||
| south(lines); | ||
| east(lines); | ||
| for (let i = 1; i <= count; i++) { | ||
| const key = lines.map(line => line.join('')).join('\n'); | ||
| if (memory.has(key)) i = count - ((count - i) % (i - memory.get(key))); | ||
| else memory.set(key, i); | ||
|
|
||
| const key = JSON.stringify(lines); | ||
| const index = memory.get(key); | ||
| if (index !== undefined) { | ||
| i += Math.floor((count - i - 1) / (i - index)) * (i - index); | ||
| } else { | ||
| memory.set(key, i); | ||
| } | ||
| vertical(lines, 1); | ||
| horizontal(lines, 1); | ||
| vertical(lines, -1); | ||
| horizontal(lines, -1); | ||
| } | ||
| return weight(lines); | ||
| } |
Oops, something went wrong.