|
20 | 20 | continue
|
21 | 21 | distance[material] = max([distance[i] for i in recipes[material]['ingredients'].keys()]) + 1
|
22 | 22 |
|
23 |
| -needed = {'FUEL': 1} |
24 |
| -while len(needed) > 1 or 'ORE' not in needed: |
25 |
| - material = max(needed, key=lambda x: distance[x]) |
26 |
| - quantity = needed[material] |
27 |
| - del needed[material] |
28 |
| - if material == 'ORE': |
29 |
| - needed[material] = quantity |
30 |
| - continue |
31 |
| - base_quantity, ingredients = recipes[material].values() |
32 |
| - for a, b in ingredients.items(): |
33 |
| - if a not in needed: |
34 |
| - needed[a] = 0 |
35 |
| - needed[a] += math.ceil(quantity/base_quantity)*b |
36 | 23 |
|
37 |
| -print('Part 1:', needed['ORE']) |
| 24 | +def required_ore(fuel): |
| 25 | + global materials, recipes, distance |
| 26 | + needed = {'FUEL': fuel} |
| 27 | + while len(needed) > 1 or 'ORE' not in needed: |
| 28 | + material = max(needed, key=lambda x: distance[x]) |
| 29 | + quantity = needed[material] |
| 30 | + del needed[material] |
| 31 | + if material == 'ORE': |
| 32 | + needed[material] = quantity |
| 33 | + continue |
| 34 | + base_quantity, ingredients = recipes[material].values() |
| 35 | + for a, b in ingredients.items(): |
| 36 | + if a not in needed: |
| 37 | + needed[a] = 0 |
| 38 | + needed[a] += math.ceil(quantity/base_quantity)*b |
| 39 | + return needed['ORE'] |
| 40 | + |
| 41 | +def search_fuel_target(ore): |
| 42 | + one_unit = required_ore(1) |
| 43 | + target = ore//one_unit |
| 44 | + used_ore = required_ore(target) |
| 45 | + while True: |
| 46 | + target += (ore-used_ore)//one_unit + 1 |
| 47 | + used_ore = required_ore(target) |
| 48 | + if used_ore > ore: |
| 49 | + break |
| 50 | + return target - 1 |
| 51 | + |
| 52 | + |
| 53 | +print('Part 1:', required_ore(1)) |
| 54 | +print('Part 2:', search_fuel_target(1000000000000)) |
0 commit comments