Day 7: Handy Haversacks / Visnu Pitiyanuvath

Visnu Pitiyanuvath

Workspace

Published

Advent of Code 2020

Edited

Dec 12, 2020

1 fork

2 stars

parsed = {

const lines = input.trim().split('\n')

return new Map(lines.map(l => {

const [name, to] = l.replace(/ bags?/g, '').split(' contain ')

const children = to.split(', ')

.map(t => {

const [, n, name] = t.replace('.', '').match(/(\d+) (.*)/) || []

return n && {name, n: +n}

})

.filter(d => d)

return [name, children]

}))

}

roots = {

const parented = new Set([...parsed.values()].flat().map(d => d.name))

return [...parsed.keys()].filter(x => !parented.has(x))

}

data = tree(root)

function tree(name) {

const children = parsed.get(name).map(({name}) => tree(name))

return { name, children, value: children.length ? undefined : 1 }

}

import { drag, height } with { data } from '@d3/force-directed-tree'

import { chart as treemap } with { data } from '@d3/treemap'

treemap

import { chart as circlePacking } with { data } from '@d3/circle-packing'

circlePacking

rules = input.trim().split('\n').map(r => {

const [from, to] = r.replace(/ bags?/g, '').split(' contain ')

return {from, to: to.split(', ').map(t => t.replace(/\d+ |\./g, ''))}

})

upwards = d3.rollup(rules.flatMap(({from, to}) => to.map(to => ({from, to}))), r => r.map(d => d.from), d => d.to)

function up(bag) {

const r = [bag]

if (upwards.has(bag))

for (const u of upwards.get(bag))

r.push(...up(u))

return r

}

part1 = new Set(up('shiny gold')).size - 1

function down(bag) {

let sum = 1

if (parsed.has(bag))

for (const {name, n} of parsed.get(bag))

sum += n * down(name)

return sum

}

part2 = down('shiny gold') - 1

d3 = require('d3@6')

Purpose-built for displays of data

Observable is your go-to platform for exploring data and creating expressive data visualizations. Use reactive JavaScript notebooks for prototyping and a collaborative canvas for visual data exploration and dashboard creation.

Learn more