-
Notifications
You must be signed in to change notification settings - Fork 0
/
fertilizer_v2.py
148 lines (119 loc) · 3.4 KB
/
fertilizer_v2.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
# -*- coding: utf-8 -*-
"""
Day 5-bis of Advent of Code, December 2023
https://adventofcode.com/
@author: gualandi
"""
# seeds: 79 14 55 13
# seed-to-soil map:
# 50 98 2
# 52 50 48
from time import perf_counter
def Merge(Ps, Rs=[]):
if Ps == []:
return Rs
if len(Ps) == 1:
Rs.append(Ps[0])
return Rs
a,b = Ps[0]
c,d = Ps[1]
if b == c:
return Merge([(a, d)] + Ps[2:], Rs)
Rs.append( (a,b) )
return Merge(Ps[1:], Rs)
def MergeTwo(Ps, Rs=[]):
if Ps == []:
return Rs
if len(Ps) == 1:
Rs.append(Ps[0])
return Rs
a, b, c = Ps[0]
d, e, f = Ps[1]
if c == f and b == d:
return MergeTwo([(a, e, c)] + Ps[2:], Rs)
Rs.append( Ps[0] )
return MergeTwo(Ps[1:], Rs)
def Compress(Ps, Rs=[]):
if Ps == []:
return Rs
if len(Ps) == 1:
Rs.append(Ps[0])
return Rs
a, b = Ps[0]
c, d = Ps[1]
if b < c:
Rs.append( (a,b) )
return Compress(Ps[1:], Rs)
e = max(b, d)
return Compress( [(a, e)] + Ps[2:], Rs)
def ProcessHeader(header):
Seed = [int(c) for c in header.split(':')[1].strip().split(' ')]
Ps = [(Seed[i], Seed[i] + Seed[i+1]) for i in range(0, len(Seed), 2)]
Ps.sort(key=lambda x: x[0])
return Merge(Ps, [])
def ProcessBlock(block, Ps):
Hs = block.split('\n')
Ts = []
for buf in Hs[1:-1]:
if buf != '':
dest, source, ra = list(map(int, buf.split(' ')))
Ts.append( (source, source+ra, dest-source) )
Ts.sort(key=lambda x: x[0])
Ts = MergeTwo(Ts, [])
Bs = ForwardScan(Ps, Ts, [])
Bs.sort(key=lambda z: z[0])
return [a for a in Compress(Bs, [])]
def ForwardScan(As, Bs, Rs):
if As == []: return Rs
if Bs == []: return Rs + As
# Take two heads
a, b = As[0]
p, q, delta = Bs[0]
if q <= a:
return ForwardScan(As, Bs[1:], Rs)
if b <= p:
Rs.append( (a, b) )
return ForwardScan( As[1:], Bs, Rs)
# 1. (a, b) contained in (p, q)
if p <= a < b <= q:
Rs.append( ((a+delta, b+delta)) )
return ForwardScan(As[1:], Bs, Rs)
# 2. (p, q) contained in (a, b)
elif a <= p < q <= b:
if a < p:
Rs.append( (a, p) )
Rs.append( (p+delta, q+delta) )
if q < b:
return ForwardScan( [(q,b)]+As, Bs[1:], Rs)
return ForwardScan( As[1:], Bs[1:], Rs)
# 3. (a, b) before (p, q)
elif a < p < b < q:
Rs.append( (a, p) )
Rs.append( (p+delta, b+delta) )
return ForwardScan(As[1:], Bs, Rs)
# 4. (p, q) before (a, b)
elif p < a < q < b:
Rs.append( (a+delta, q+delta))
return ForwardScan( [(q, b)]+As[1:], Bs[1:], Rs)
raise RuntimeError('This should not happen!')
def Parser(filename):
t1_start = perf_counter()
fh = open(filename, mode='r', encoding='utf-8')
Ps = ProcessHeader(fh.readline())
fh.readline()
block = ''
for row in fh:
if row == '\n':
Ps = ProcessBlock(block, Ps)
block = ''
else:
block = block + row
if block != '':
Ps = ProcessBlock(block, Ps)
t1_stop = perf_counter()
print("AoC 2023 - Day 5 part 2, solved in", round(t1_stop - t1_start, 3), "seconds!")
return Ps[0][0]
# Check for PartOne (Lost!)
#print('Solution 1:', Parser('input.txt'))
# Check for PartTwo
print('Solution 2:', Parser('input.txt'))