aoc08

01.py

# V1
class Node:
	nodes = []
	def __init__(self, numbers):
		#print(numbers)
		if not numbers:
			self.num_childs=0
			self.num_meta=0
			self.metadata=[]
			self.children=[]
			return
		self.num_childs = numbers[0]
		self.num_meta = numbers[1]
		self.children = []
		start = 2
		Node.nodes.append(self)
		for i in range(self.num_childs):
			c = Node(numbers[start:-self.num_meta])
			self.children.append(c)
			start += c.len()
		self.metadata = numbers[start:start + self.num_meta]
		if not len(self.metadata) == self.num_meta:
			print("ALERT")
		
	def len(self):
		return 2 + self.num_meta + sum([c.len() for c in self.children])
	def meta_sum(self):
		return sum(self.metadata) + sum([c.meta_sum() for c in self.children])
	def __repr__(self):
		return f"({self.num_childs}, {self.num_meta}, ({self.metadata}))"
	
n = Node(numbers)
print(n.meta_sum())


# V2
meta = []

def node(n):
	if n[0] == 0:
		end = 2 + n[1]
		meta.append(n[2:end])
		return end
	end = 2
	for i in range(n[0]):
		end_i = node(n[end:])
		#meta.append(n[end_i-n[3]:end_i])
		end += end_i
	end += n[1]
	meta.append(n[end-n[1]:end])
	return end

print(sum([sum(x) for x in meta]))