update 107

python/107.py

@@ -1,45 +1,31 @@
-ff = open('../network.txt', 'r')
-nnn = ff.readlines()
-ff.close()
 
-inf = 10 ** 10
+def get_file(fn):
+    with open(fn, 'r') as f:
+        network = list(map(lambda x: list(map(lambda n: int(n),
+                    x.strip().replace('-', '0').split(','))), f.readlines()))
+        return network, sum(map(lambda x: sum(x), network)) // 2
 
-def stolis(s):
-  mid = s.split(',')
-  out = []
-  for i in mid:
-    if i.isdigit():
-      out.append(int(i))
-    else:
-      out.append(inf)
-  return out
+def remake(network, total):
+    p_todo = list(range(1, len(network)))
+    p_tree = [0]
+    trace = []
+    while len(p_todo):
+        least = (total, 0)
+        for pick in p_todo:
+            for in_tree in p_tree:
+                dist = network[pick][in_tree]
+                if not dist:
+                    continue
+                if dist < least[0]:
+                    least = (dist, pick)
+        if least[0] < total:
+            trace.append(least[0])
+            p_tree.append(least[1])
+            p_todo.remove(least[1])
+    return sum(trace)
 
-hole = 0
-net = []
-for i in nnn:
-  tmp = stolis(i.strip())
-  for j in tmp:
-    if j < inf:
-      hole += j
-  net.append(tmp)
+def calc(fn):
+    network, total = get_file(fn)
+    return total - remake(network, total)
 
-#print net
-
-have = [0]
-nothave = range(1, len(net))
-
-total = 0
-while len(nothave) > 0:
-  choose = [inf, 0]
-  node = 0
-  it = 0
-  for node in nothave:
-    for it in have:
-      if net[node][it] < choose[0]:
-        choose = [net[node][it], node]
-  if choose[0] < inf:
-    have.append(choose[1])
-    nothave.remove(choose[1])
-    total += choose[0]
-
-print hole / 2 - total
+print(calc('../resource/network.txt'))