45:["$","title",null,{"children":"Advent of Code 2017: Day 14 | Matt Cowan | Observable"}] 4d:T7af,md` Suddenly, a scheduled job activates the system's disk defragmenter. Were the situation different, you might sit and watch it for a while, but today, you just don't have that kind of time. It's soaking up valuable system resources that are needed elsewhere, and so the only option is to help it finish its task as soon as possible. The disk in question consists of a 128x128 grid; each square of the grid is either free or used. On this disk, the state of the grid is tracked by the bits in a sequence of knot hashes. A total of 128 knot hashes are calculated, each corresponding to a single row in the grid; each hash contains 128 bits which correspond to individual grid squares. Each bit of a hash indicates whether that square is free (0) or used (1). The hash inputs are a key string (your puzzle input), a dash, and a number from 0 to 127 corresponding to the row. For example, if your key string were flqrgnkx, then the first row would be given by the bits of the knot hash of flqrgnkx-0, the second row from the bits of the knot hash of flqrgnkx-1, and so on until the last row, flqrgnkx-127. The output of a knot hash is traditionally represented by 32 hexadecimal digits; each of these digits correspond to 4 bits, for a total of 4 * 32 = 128 bits. To convert to bits, turn each hexadecimal digit to its equivalent binary value, high-bit first: 0 becomes 0000, 1 becomes 0001, e becomes 1110, f becomes 1111, and so on; a hash that begins with a0c2017... in hexadecimal would begin with 10100000110000100000000101110000... in binary. Continuing this process, the first 8 rows and columns for key flqrgnkx appear as follows, using # to denote used squares, and . to denote free ones: \`\`\` ##.#.#..--> .#.#.#.# ....#.#. #.#.##.# .##.#... ##..#..# .#...#.. ##.#.##.--> | | V V \`\`\` In this example, 8108 squares are used across the entire 128x128 grid. Given your actual key string, how many squares are used? `4e:[] 49:{"id":"5a19ccf22f82b267","slug":"advent-of-code-2017-day-14","title":"Advent of Code 2017: Day 14","thumbnail":"823f318790137ba1a1e47aaca0954209a155eecd2be06d42c2f22483a9ca6343","access_level":"public","create_time":"$D2018-12-09T02:33:49.166Z","update_time":"$D2018-12-13T02:07:19.537Z","view_time":null,"first_public_time":"$D2018-12-13T02:07:57.915Z","has_unpublished_edits":null,"fork":false,"stars":0,"starred":false,"owner":{"type":"team","id":"150d072324233635","login":"mpcowan","name":"Matt Cowan","avatar_url":"https://avatars-next.observableusercontent.com/e2099947d874f59a033405d9b14644227c3f8d11863e2bc35ca7b69242c72fd5","tier":"starter_2024","bio":"","followed_by_you":false,"follows_you":false},"version":58,"publish_version":58,"role":null,"authored":false,"authors":[{"type":"individual","id":"0d1ab105ae1b9374","login":"mpcowan","name":"Matt Cowan","avatar_url":"https://avatars-next.observableusercontent.com/e2099947d874f59a033405d9b14644227c3f8d11863e2bc35ca7b69242c72fd5","tier":null,"bio":"","followed_by_you":false,"follows_you":false}],"members":[{"type":"individual","id":"0d1ab105ae1b9374","login":"mpcowan","name":"Matt Cowan","avatar_url":"https://avatars-next.observableusercontent.com/e2099947d874f59a033405d9b14644227c3f8d11863e2bc35ca7b69242c72fd5","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":0,"collection":{"id":"b982a7315f3f2787","slug":"advent-of-code-2017","title":"Advent of Code 2017","owner":{"id":"150d072324233635","login":"mpcowan","name":"Matt Cowan"}},"type":"notebook","body":{"titling":"auto","title":"Advent of Code 2017: Day 14","cells":[{"id":0,"value":"md`# Advent of Code 2017: Day 14`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":2,"value":"md`## [Disk Defragmentation](https://adventofcode.com/2017/day/14)`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":5,"value":"md`---\n## Part 1`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":7,"value":"$4d","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":9,"value":"input = 'stpzcrnm'","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":11,"value":"md`---\n### Solution`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":13,"value":"function reverseArrayPortion(arr, start, end) {\n let i = start;\n let j = end;\n while (i < j) {\n const tmp = arr[i % arr.length];\n arr[i % arr.length] = arr[j % arr.length];\n arr[j % arr.length] = tmp;\n i++;\n j--;\n }\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":26,"value":"function knotHash(list, lengths, pos, skip) { \n lengths.forEach(length => {\n reverseArrayPortion(list, pos, pos + length - 1);\n pos = (pos + length + skip) % list.length;\n skip++;\n });\n \n return { pos, skip };\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":33,"value":"function hexToBinary(hex) {\n return hex.match(/.{2}/g)\n .map(h => parseInt(h, 16).toString(2).padStart(8, '0'))\n .join('');\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":28,"value":"function binaryKnotHash(key) {\n let lengths = [...key].map(c => c.charCodeAt(0));\n lengths = lengths.concat([17, 31, 73, 47, 23]);\n \n let list = new Array(256).fill().map((v, i) => i);\n let pos = 0;\n let skip = 0;\n for (let i = 0; i < 64; i++) {\n const output = knotHash(list, lengths, pos, skip);\n pos = output.pos;\n skip = output.skip;\n }\n \n const blocks = [];\n for (let i = 0; i < 256; i += 16) {\n let xored = list[i];\n for (let j = i + 1; j < i + 16; j++) {\n xored = xored ^ list[j];\n }\n blocks.push(xored);\n }\n \n const hex = blocks.reduce((acc, b) => {\n if (b < 16) {\n return acc + '0' + b.toString(16);\n }\n return acc + b.toString(16);\n }, '');\n \n return hexToBinary(hex);\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":43,"value":"{\n let cells = '';\n for (let i = 0; i < 128; i++) {\n cells += binaryKnotHash(`${input}-${i}`)\n }\n return [...cells].reduce((acc, v) => {\n return acc + parseInt(v, 10);\n }, 0);\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":15,"value":"md`---\n## Part 2`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":17,"value":"md`\nNow, all the defragmenter needs to know is the number of regions. A region is a group of used squares that are all adjacent, not including diagonals. Every used square is in exactly one region: lone used squares form their own isolated regions, while several adjacent squares all count as a single region.\n\nIn the example above, the following nine regions are visible, each marked with a distinct digit:\n\n\\`\\`\\`\n11.2.3..-->\n.1.2.3.4 \n....5.6. \n7.8.55.9 \n.88.5... \n88..5..8 \n.8...8.. \n88.8.88.-->\n| | \nV V \n\\`\\`\\`\n\nOf particular interest is the region marked 8; while it does not appear contiguous in this small view, all of the squares marked 8 are connected when considering the whole 128x128 grid. In total, in this example, 1242 regions are present.\n\nHow many regions are present given your key string?\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":19,"value":"md`---\n### Solution`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":50,"value":"function makeDefragGrid(size) {\n const grid = new Array(size).fill();\n for (let i = 0; i < size; i++) {\n grid[i] = [...binaryKnotHash(`${input}-${i}`)];\n }\n return grid;\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":21,"value":"{\n const size = 128;\n const defragGrid = makeDefragGrid(size);\n \n function tagGroup(row, column, tag) {\n if (defragGrid[row][column] === '1') {\n defragGrid[row][column] = tag;\n if (row > 0) {\n tagGroup(row-1, column, tag);\n }\n if (row < size - 1) {\n tagGroup(row+1, column, tag);\n }\n if (column > 0) {\n tagGroup(row, column-1, tag);\n }\n if (column < size - 1) {\n tagGroup(row, column+1, tag);\n }\n }\n }\n \n let currentGroup = 0;\n for (let i = 0; i < size; i++) {\n for (let j = 0; j < size; j++) {\n if (defragGrid[i][j] === '1') {\n currentGroup++;\n tagGroup(i, j, currentGroup)\n }\n }\n }\n \n return currentGroup;\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W4e","stdlib":"1"}} 44:null