+/AoC
advent of code
git clone https://git.julia.blue/+/AoC
1536a35
master
1from functools import reduce 2 3sections = open ("input" ).read ().split ("\n\n" ) 4seeds = [int (s )for s in sections [0 ].split ()[1 :]] 5maps = [[list (map (int ,s .split ()))for s in l .splitlines ()[1 :]]for l in sections [1 :]] 6maps = [sorted ([(src ,dest ,len )for dest ,src ,len in stage ])for stage in maps ] 7trymap = lambda n ,src ,dest ,l :dest - src + n if n in range (src ,src + l )else None 8some = lambda l : [x for x in l if x is not None ] 9step = lambda cur ,stage : [(some ([trymap (n ,* m )for m in stage ])+ [n ])[0 ]for n in cur ] 10 11min (reduce (lambda cur ,stage :step (cur ,stage ),maps ,seeds ))) 12 13seeds = [range (a ,a + b )for a ,b in zip (seeds [::2 ],seeds [1 ::2 ])] 14seeds .sort (key = lambda r :r .start ) 15for stage in maps : 16s = m = 0 17seed = seeds [s ] 18result = [] 19while seed : 20if m >= len (stage ): 21result .append (seed ) 22for i in range (s + 1 ,len (seeds )): 23result .append (seeds [i ]) 24break 25src ,dest ,l = stage [m ] 26if seed .stop < src : 27result .append (seed ) 28s += 1 29seed = seeds [s ]if s < len (seeds )else None 30elif src + l < seed .start : 31m += 1 32elif (start := trymap (seed .start ,src ,dest ,l ))is not None : 33if (stop := trymap (seed .stop ,src ,dest ,l ))is not None : 34result .append (range (start ,stop )) 35s += 1 36seed = seeds [s ]if s < len (seeds )else None 37else : 38stop = src + l 39result .append (range (start ,dest + l )) 40m += 1 41seed = range (src + l ,seed .stop ) 42else : 43result .append (range (seed .start ,src )) 44result .append (range (dest ,dest + seed .stop - src )) 45s += 1 46seed = seeds [s ]if s < len (seeds )else None 47seeds = sorted (result ,key = lambda r :r .start ) 48 49seeds [0 ].start )