Created
December 14, 2023 19:28
-
-
Save benjamingr/44ac74270608b0866f849270325a910a to your computer and use it in GitHub Desktop.
This file contains hidden or 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
| var input = ` | |
| O....#.... | |
| O.OO#....# | |
| .....##... | |
| OO.#O....O | |
| .O.....O#. | |
| O.#..O.#.# | |
| ..O..#O..O | |
| .......O.. | |
| #....###.. | |
| #OO..#.... | |
| `.trim(); | |
| var input = document.body.textContent.trim() | |
| var data = input.split("\n").map(row => row.split("")); | |
| function tiltNorth(data) { | |
| for (let n = 0; n < data.length; n++) { | |
| for (let i = 1; i < data.length; i++) { | |
| for (let j = 0; j < data[0].length; j++) { | |
| if (data[i][j] === "O" && data[i - 1][j] === ".") { | |
| data[i - 1][j] = "O"; | |
| data[i][j] = "." | |
| } | |
| } | |
| } | |
| } | |
| } | |
| function tiltSouth(data) { | |
| for (let n = 0; n < data.length; n++) { | |
| for (let i = 0; i < data.length - 1; i++) { | |
| for (let j = 0; j < data[0].length; j++) { | |
| if (data[i][j] === "O" && data[i + 1][j] === ".") { | |
| data[i + 1][j] = "O"; | |
| data[i][j] = "." | |
| } | |
| } | |
| } | |
| } | |
| } | |
| function tiltEast(data) { | |
| for (let n = 0; n < data.length; n++) { | |
| for (let i = 0; i < data.length; i++) { | |
| for (let j = 1; j < data[0].length; j++) { | |
| if (data[i][j] === "O" && data[i][j - 1] === ".") { | |
| data[i][j - 1] = "O"; | |
| data[i][j] = "." | |
| } | |
| } | |
| } | |
| } | |
| } | |
| function tiltWest(data) { | |
| for (let n = 0; n < data.length; n++) { | |
| for (let i = 0; i < data.length; i++) { | |
| for (let j = 0; j < data[0].length - 1; j++) { | |
| if (data[i][j] === "O" && data[i][j + 1] === ".") { | |
| data[i][j + 1] = "O"; | |
| data[i][j] = "." | |
| } | |
| } | |
| } | |
| } | |
| } | |
| // 1000 is probably enough | |
| for (let cycle = 0; cycle < 1000; cycle++) { | |
| tiltNorth(data); | |
| tiltEast(data); | |
| tiltSouth(data); | |
| tiltWest(data); | |
| } | |
| var sums = data.map((row, i) => { | |
| const count = data.length - i; | |
| return row.reduce((p, c) => p + ((c === "O") ? 1 : 0), 0) * count; | |
| }) | |
| var sum = sums.reduce((p, c) => p + c, 0); | |
| sum; |
Author
benjamingr
commented
Dec 14, 2023
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment