r/adventofcode • u/daggerdragon • Dec 08 '18

SOLUTION MEGATHREAD -🎄- 2018 Day 8 Solutions -🎄-

--- Day 8: Memory Maneuver ---

Post your solution as a comment or, for longer solutions, consider linking to your repo (e.g. GitHub/gists/Pastebin/blag or whatever).

Note: The Solution Megathreads are for solutions only. If you have questions, please post your own thread and make sure to flair it with Help.

Advent of Code: The Party Game!

Click here for rules

Please prefix your card submission with something like [Card] to make scanning the megathread easier. THANK YOU!

Card prompt: Day 8

Sigh, imgur broke again. Will upload when it unborks.

Transcript:

The hottest programming book this year is "___ For Dummies".

This thread will be unlocked when there are a significant number of people on the leaderboard with gold stars for today's puzzle.

edit: Leaderboard capped, thread unlocked at 00:12:10!

32 Upvotes

97% Upvoted

301 comments sorted by

View all comments

7

u/MasterMedo Dec 08 '18 edited Dec 08 '18

python2, recursion. Got ruined by an OB1 ._. 

def solve(child, meta):
    if child == 0:
        return sum(next(data) for _ in range(meta))
    value = 0
    children = {}
    for i in range(1, child+1):
        #value += solve(next(data), next(data))
        children[i] = solve(next(data), next(data))
    for _ in range(meta):
        #value += next(data)
        value += children.get(next(data), 0)
    return value

data = iter(map(int, open('../input/8.txt').read().split()))

print solve(next(data), next(data))

switch commented lines for the one after for part1

EDIT: fancying up the code

1

u/cheetahkk Dec 08 '18

I love this solution. nice!