last day (15 days later) » 

Stack Exchange
Stack Exchange
11:28 AM
1
A: Solve a game of Accordion

Pietu1998Python 3, 274 bytes def g(p): q=lambda a:[[i,a]for i in range(len(p)-a)if p[i][:-1]in p[i+a][:-1]or p[i][-1]in p[i+a]] for n in q(1)+q(3): s=sum(n);c=p[:s]+p[s+1:];c[n[0]]=p[s] if[]!=g(c):return p[n[0]]+' <- '+p[s]+','+g(c) return''if len(p)<2else[] print(g(input().split(','))[:-1]or'')...

 
orlp
orlp
Use functools.lru_cache instead of writing your own.
 
Pietu1998
Pietu1998
@orlp I would, but as list is unhashable it doesn't work.
 
orlp
orlp
Then use tuples.
 
Pietu1998
Pietu1998
@orlp OK, but that would require changes to the code (e.g. str.split returns list). I'd prefer the two programs to be functionally equivalent.
 
orlp
orlp
You could do h=lambda p:lru_cache(None)(g)(''.join(p)).
 
Pietu1998
Pietu1998
11:28 AM
@orlp That becomes another problem with c[n[0]]=p[s]. I'll just go with these changes and standard lru_cache
 
orlp
orlp
h=lambda p:lru_cache(None)(lambda q:g(list(q)))(tuple(p))
 
Pietu1998
Pietu1998
That still has the same problem, tuples can't be assigned to either
 
orlp
orlp
hold on let me actually read what everything does
first thing first by the way
you can remove maxsize=
 
Pietu1998
Pietu1998
Well that's not really a problem since I count only the bytes of the golfed solution
That sort of helps
 
orlp
orlp
second you can use from functools import*
 
Pietu1998
Pietu1998
11:31 AM
Again, I'm not golfing the cache thing, it's just to make testing possible
 
orlp
orlp
oh
well then you want something that memoizes it without having to edit it
 
Pietu1998
Pietu1998
That's basically what I was doing before
The functools thing is a lot faster though, so I'll just go with that
 
orlp
orlp
11:45 AM
@Pietu1998 you can safe a bit
remove []!=
and do return' 'if len(p)<2else[]
 
Pietu1998
Pietu1998
Yeah, and then just change [:-1] to [:-2] to get rid of the comma
 

last day (15 days later) »