trying to bruteforce part2

2023/5/if_you_give_a_seed_a_fertilizer.py

@@ -1,38 +1,61 @@
-from multiprocessing import Pool, cpu_count
-
-LOWEST = float("inf")
 
 def main():
     lines = read_input()
 
     seeds = lines[0].split(" ")
     seeds = [int(seed) for seed in seeds[1:]]
+    lowest = float("inf")
 
     res_1 = solve(lines, seeds)
     print(res_1)
 
-    # hups muisti loppuu :D
-    pool = Pool(processes=(cpu_count() - 1))
 
+    maps = [
+            generate_map(lines, "seed-to-soil"), 
+            generate_map(lines, "soil-to-fertilizer"), 
+            generate_map(lines, "fertilizer-to-water"),
+            generate_map(lines, "water-to-light"),
+            generate_map(lines, "light-to-temperature"),
+            generate_map(lines, "temperature-to-humidity"),
+            generate_map(lines, "humidity-to-location"),
+            ]
+
+    results = []
     for i in range(0, len(seeds), 2):
         for x in range(seeds[i+1]):
-            pool.map(solve_2, [(lines, seeds[i] + x)])
-            print(f"{i}/{len(seeds)} - {x/seeds[i+1]:.2f}%: {x} --- {LOWEST}")
+            seed =  solve_2(lines, seeds[i] + x)
+            #seed =  solve_2_maps(maps, seeds[i] + x)
+            lowest = seed if seed < lowest else lowest
+            print(f"{i}/{len(seeds)} - {(x/seeds[i+1])*100:.2f}%: {x} --- {lowest} - {results}")
+        results.append(lowest)
 
-    pool.close()
-    pool.join()
 
-    res_2 = LOWEST
+    res_2 = lowest
     print(res_2)
 
     return res_1, res_2
 
-def solve_2(data):
-    lines = data[:-1]
-    seed = data[-1]
 
-    global LOWEST
+def solve_2_maps(maps, seed):
+    for map in maps:
+        transformed_seed = solve_2_map(map, seed)
+        if transformed_seed:
+            seed = transformed_seed
+    return seed
+
+
+def solve_2_map(map, seed):
+    for line in map:
+        if in_range(seed, line[1], line[2]):
+            transfromed_seed = transform_seed_to_dest(seed, line[1], line[0])
+            print("seed", seed, "in range", line[0], "-", line[0]+line[2], "=", transfromed_seed)
+            return transfromed_seed
+
+
+def solve_2(lines, seed):
     transformed_seed = float("inf")
+
+
     for line in lines[1:]:
         if not line.strip() or line[-1] == ":":
             if transformed_seed == float("inf"):
@@ -59,8 +82,31 @@ def solve_2(data):
         transformed_seed = seed
 
     seed = transformed_seed
-    LOWEST = seed if seed < LOWEST else LOWEST
-    #print(LOWEST)
+    return seed
+
+def generate_map(lines, map_str):
+    is_map = False
+    some_map = []
+    for line in lines:
+        #print("line", line)
+
+        if map_str in line:
+            is_map = True
+            continue
+
+        if not is_map or not line.strip() or line[-1] == ":":
+            continue
+
+        values = line.split(" ")
+        destination_start_range = int(values[0])
+        source_start_range = int(values[1])
+        count = int(values[2])
+        some_map.append([destination_start_range, source_start_range, count])
+
+        if not line.strip():
+            break
+
+    return some_map
 
 def solve(lines, seeds):
     transformed_seeds = [0] * len(seeds)