aoc 2017 - day 7

www/statics/aoc/2017/07_challenge.txt

@@ -0,0 +1,65 @@
+--- Day 7: Recursive Circus ---
+
+Wandering further through the circuits of the computer, you come upon a tower of programs that have gotten themselves into a bit of trouble. A recursive algorithm has gotten out of hand, and now they're balanced precariously in a large tower.
+
+One program at the bottom supports the entire tower. It's holding a large disc, and on the disc are balanced several more sub-towers. At the bottom of these sub-towers, standing on the bottom disc, are other programs, each holding their own disc, and so on. At the very tops of these sub-sub-sub-...-towers, many programs stand simply keeping the disc below them balanced but with no disc of their own.
+
+You offer to help, but first you need to understand the structure of these towers. You ask each program to yell out their name, their weight, and (if they're holding a disc) the names of the programs immediately above them balancing on that disc. You write this information down (your puzzle input). Unfortunately, in their panic, they don't do this in an orderly fashion; by the time you're done, you're not sure which program gave which information.
+
+For example, if your list is the following:
+
+pbga (66)
+xhth (57)
+ebii (61)
+havc (66)
+ktlj (57)
+fwft (72) -> ktlj, cntj, xhth
+qoyq (66)
+padx (45) -> pbga, havc, qoyq
+tknk (41) -> ugml, padx, fwft
+jptl (61)
+ugml (68) -> gyxo, ebii, jptl
+gyxo (61)
+cntj (57)
+
+...then you would be able to recreate the structure of the towers that looks like this:
+
+                gyxo
+              /
+         ugml - ebii
+       /      \
+      |         jptl
+      |
+      |         pbga
+     /        /
+tknk --- padx - havc
+     \        \
+      |         qoyq
+      |
+      |         ktlj
+       \      /
+         fwft - cntj
+              \
+                xhth
+
+In this example, tknk is at the bottom of the tower (the bottom program), and is holding up ugml, padx, and fwft. Those programs are, in turn, holding up other programs; in this example, none of those programs are holding up any other programs, and are all the tops of their own towers. (The actual tower balancing in front of you is much larger.)
+
+Before you're ready to help them, you need to make sure your information is correct. What is the name of the bottom program?
+
+--- Part Two ---
+
+The programs explain the situation: they can't get down. Rather, they could get down, if they weren't expending all of their energy trying to keep the tower balanced. Apparently, one program has the wrong weight, and until it's fixed, they're stuck here.
+
+For any program holding a disc, each program standing on that disc forms a sub-tower. Each of those sub-towers are supposed to be the same weight, or the disc itself isn't balanced. The weight of a tower is the sum of the weights of the programs in that tower.
+
+In the example above, this means that for ugml's disc to be balanced, gyxo, ebii, and jptl must all have the same weight, and they do: 61.
+
+However, for tknk to be balanced, each of the programs standing on its disc and all programs above it must each match. This means that the following sums must all be the same:
+
+    ugml + (gyxo + ebii + jptl) = 68 + (61 + 61 + 61) = 251
+    padx + (pbga + havc + qoyq) = 45 + (66 + 66 + 66) = 243
+    fwft + (ktlj + cntj + xhth) = 72 + (57 + 57 + 57) = 243
+
+As you can see, tknk's disc is unbalanced: ugml's stack is heavier than the other two. Even though the nodes above ugml are balanced, ugml itself is too heavy: it needs to be 8 units lighter for its stack to weigh 243 and keep the towers balanced. If this change were made, its weight would be 60.
+
+Given that exactly one program is the wrong weight, what would its weight need to be to balance the entire tower?

www/statics/aoc/2017/07_solution-1.py

@@ -0,0 +1,35 @@
+#!/usr/bin/env python3
+
+import aoc
+
+
+def parse_line(line: str):
+    childs = list()
+    if ' -> ' in line:
+        split1 = line.split(' -> ')
+        childs = list(map(lambda x: x.strip(), split1[1].strip().split(',')))
+        line = split1[0]
+
+    line = line.strip()
+    line = line.replace('(', '').replace(')', '')
+    split2 = line.split(' ')
+    name = split2[0].strip()
+    weight = int(split2[1].strip())
+    return name, weight, childs
+
+
+rawinput = aoc.read_input(7)
+
+data = list(map(lambda x: parse_line(x), rawinput.splitlines()))
+
+rnodes = list(map(lambda x: x[0], data))
+
+for datum in data:
+    for xnode in datum[2]:
+        rnodes.remove(xnode)
+
+assert len(rnodes) == 1
+print(rnodes[0])
+
+
+

www/statics/aoc/2017/07_solution-2.py

@@ -0,0 +1,60 @@
+#!/usr/bin/env python3
+
+import aoc
+
+
+def parse_line(line: str):
+    childs = list()
+    if ' -> ' in line:
+        split1 = line.split(' -> ')
+        childs = list(map(lambda x: x.strip(), split1[1].strip().split(',')))
+        line = split1[0]
+
+    line = line.strip()
+    line = line.replace('(', '').replace(')', '')
+    split2 = line.split(' ')
+    name = split2[0].strip()
+    weight = int(split2[1].strip())
+    return name, weight, childs
+
+
+def calc_weight_rec(fdatamap, key):
+    w = fdatamap[key][1]
+    for child in fdatamap[key][2]:
+        w += calc_weight_rec(fdatamap, child)
+    return w
+
+
+def is_balanced(fdatamap, key):
+    if len(fdatamap[key][2]) == 0:
+        return True
+    subweights = list(map(lambda x: calc_weight_rec(fdatamap, x), fdatamap[key][2]))
+    return len(set(subweights)) == 1
+
+
+rawinput = aoc.read_input(7)
+
+data = list(map(lambda x: parse_line(x), rawinput.splitlines()))
+datamap = {x[0]: x for x in data}
+
+rnodes = list(map(lambda x: x[0], data))
+
+for datum in data:
+    if is_balanced(datamap, datum[0]):
+        continue
+    weights = list(map(lambda x: calc_weight_rec(datamap, x), datum[2]))
+    if len(set(weights)) != 1:
+        for idx, w in enumerate(weights):
+            if weights.count(w) != 1:
+                continue
+            if not is_balanced(datamap, datum[2][idx]):
+                continue
+            real_direct_subweight = datamap[datum[2][idx]][1]
+            real_full_subweight = w
+            wanted_full_subweight = weights[(idx+1) % len(weights)]
+            wanted_direct_subweight = real_direct_subweight + (wanted_full_subweight - real_full_subweight)
+
+            # print(datamap[datum[2][idx]])
+            # print(real_full_subweight, real_direct_subweight, wanted_full_subweight, wanted_direct_subweight)
+            # print(datum, weights)
+            print(wanted_direct_subweight)

www/statics/aoc/__all.php

@@ -10,6 +10,7 @@ return
 			['day' =>  4, 'parts' => 2, 'title' => 'High-Entropy Passphrases',                'language' => 'pyth', 'solutions' => ['477', '167'] ],
 			['day' =>  5, 'parts' => 2, 'title' => 'A Maze of Twisty Trampolines, All Alike', 'language' => 'pyth', 'solutions' => ['388611', '27763113'] ],
 			['day' =>  6, 'parts' => 2, 'title' => 'Memory Reallocation',                     'language' => 'pyth', 'solutions' => ['11137', '1037'] ],
+			['day' =>  6, 'parts' => 2, 'title' => 'Recursive Circus',                        'language' => 'pyth', 'solutions' => ['hlqnsbe', '1993'] ],
 		],
 		'2018' =>
 		[