dost

@@ -12,6 +12,7 @@ class RadixTree:

         self.children = set()

         self.parent = parent

         self.weight = 1 if label is not None else 0

+        self.depth = parent.depth + 1 if parent else 0

         self.height = 1

         self.usage = 0

@@ -86,7 +87,7 @@ class RadixTree:

     def best(self) -> "RadixTree":

         if self.children:

-            branches = minima(self.children, lambda c: (c.usage / c.weight, -c.weight))

+            branches = minima(self.children, lambda c: (c.usage / c.weight, -(c.weight // c.depth)))

             return min((b.best() for b in branches), key=lambda b: (len(b.full()), b.full()))

         else:

             return self

@@ -95,12 +96,12 @@ t = RadixTree()

 words = {w.strip() for w in sys.stdin}

 for w in words:

     t.add(w.strip())

+if "" not in words:

     t.del_empty()

 leaves = {l.full() for l in t.leaves()}

 assert leaves <= words

 assert words <= leaves

 while t.usage < t.weight:

     b = t.best()

-    print(b.full())

     b.use()

-print(str(t))

+    print(b.full())