2018 day8

3 files changed, 51 insertions, 6 deletions

diff --git a/src/2018/day8/aoc.cpp b/src/2018/day8/aoc.cpp
index 2f7729f..0c912da 100644
--- a/src/2018/day8/aoc.cpp
+++ b/src/2018/day8/aoc.cpp
@@ -1,4 +1,5 @@
 #include "aoc.h"
+#include <map>
 #include <stack>
 #include <vector>
 
@@ -17,9 +18,40 @@ static void get_number(const char** pp, int* d) {
 struct header {
   int nodes;
   int metas;
+  size_t id;
 };
 
-int day8(line_view file) {
+// static void check(const std::map<int, std::vector<int>>& m) {
+//   for (auto& kv : m) {
+//     printf("%d -> ", kv.first);
+//     for (auto x : kv.second) {
+//       printf("%d ", x);
+//     }
+//     printf("\n");
+//   }
+// }
+
+static int eval(int index, const std::map<int, std::vector<int>>& ms, const std::map<int, std::vector<int>>& mr) {
+  auto it = ms.find(index);
+  auto jt = mr.find(index);
+  if (it != ms.end() && jt == mr.end()) {
+    return it->second[0];
+  }
+  if (it != ms.end() && jt != mr.end()) {
+    auto rs = it->second;
+    auto xs = jt->second;
+    int d{0};
+    for (auto& r : rs) {
+      if (size_t(r) <= xs.size()) {
+        d += eval(xs[r - 1], ms, mr);
+      }
+    }
+    return d;
+  }
+  return 0;
+}
+
+std::pair<int, int> day8(line_view file) {
   std::vector<int> is;
   const char* p1 = file.line;
   const char* p2 = file.line + file.length;
@@ -33,26 +65,37 @@ int day8(line_view file) {
   }
 
   std::stack<header> hs;
+  std::map<int, std::vector<int>> mr;
+  std::map<int, std::vector<int>> ms;
   size_t index{0};
   int total{0};
-  hs.push({is[index], is[index + 1]});
+  hs.push({is[index], is[index + 1], index});
   index += 2;
   while (!hs.empty()) {
     auto& h = hs.top();
     if (h.nodes > 0) {
-      hs.push({is[index], is[index + 1]});
+      hs.push({is[index], is[index + 1], index});
+      mr[h.id].push_back(index);
       index += 2;
       h.nodes -= 1;
     } else {
+      int sub{0};
       while (h.metas > 0) {
         total += is[index];
+        ms[h.id].push_back(is[index]);
+        sub += is[index];
         index += 1;
         h.metas -= 1;
       }
+      if (mr.find(h.id) == mr.end()) {
+        ms[h.id] = {sub};
+      }
       hs.pop();
     }
   }
-  return total;
+
+  int d = eval(0, ms, mr);
+  return {total, d};
 }
 
 } // namespace aoc2018
diff --git a/src/2018/day8/aoc.h b/src/2018/day8/aoc.h
index 22b2d3e..59cc0e5 100644
--- a/src/2018/day8/aoc.h
+++ b/src/2018/day8/aoc.h
@@ -3,5 +3,5 @@
 
 namespace aoc2018 {
 
-int day8(line_view);
+std::pair<int, int> day8(line_view);
 }
diff --git a/test/test_2018.cpp b/test/test_2018.cpp
index e91e4b7..0ef6359 100644
--- a/test/test_2018.cpp
+++ b/test/test_2018.cpp
@@ -66,6 +66,8 @@ TEST_CASE("The Sum of Its Parts", "[2018]") {
 TEST_CASE("Memory Maneuver", "[2018]") {
   line_view lv = load_file("../src/2018/day8/input");
   auto p = aoc2018::day8(lv);
+  REQUIRE(36891 == p.first);
+  REQUIRE(20083 == p.second);
   // auto p = aoc2018::day8("2 3 0 3 10 11 12 1 1 0 1 99 2 1 1 2");
-  REQUIRE(36891 == p);
+  // REQUIRE(138 == p.first);
 }