From 0d4e07448333f212ef5e72e67de9cbfb7c01768f Mon Sep 17 00:00:00 2001
From: Bruno BELANYI <bruno@belanyi.fr>
Date: Sun, 29 Dec 2024 18:19:44 -0500
Subject: [PATCH] 2018: d08: ex1: add solution

---
 2018/d08/ex1/ex1.py | 53 +++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 53 insertions(+)
 create mode 100755 2018/d08/ex1/ex1.py

diff --git a/2018/d08/ex1/ex1.py b/2018/d08/ex1/ex1.py
new file mode 100755
index 0000000..b3dd61a
--- /dev/null
+++ b/2018/d08/ex1/ex1.py
@@ -0,0 +1,53 @@
+#!/usr/bin/env python
+
+import itertools
+import sys
+from collections.abc import Iterator
+from typing import NamedTuple
+
+
+class Tree(NamedTuple):
+    children: list["Tree"]
+    metadata: list[int]
+
+    @classmethod
+    def from_raw(cls, raw: list[int]) -> "Tree":
+        def helper(offset: int) -> tuple[Tree, int]:
+            n_children, n_metadata = raw[offset], raw[offset + 1]
+            offset += 2
+
+            children: list[Tree] = []
+            for _ in range(n_children):
+                tree, offset = helper(offset)
+                children.append(tree)
+            metadata = raw[offset : offset + n_metadata]
+            offset += n_metadata
+
+            return cls(children, metadata), offset
+
+        tree, offset = helper(0)
+        assert offset == len(raw)
+        return tree
+
+    def preorder(self) -> Iterator["Tree"]:
+        yield self
+        for child in self.children:
+            yield from child.preorder()
+
+
+def solve(input: str) -> int:
+    def parse(input: str) -> Tree:
+        raw = [int(n) for n in input.split()]
+        return Tree.from_raw(raw)
+
+    tree = parse(input)
+    return sum(itertools.chain.from_iterable(node.metadata for node in tree.preorder()))
+
+
+def main() -> None:
+    input = sys.stdin.read()
+    print(solve(input))
+
+
+if __name__ == "__main__":
+    main()