def golf(s): c=() for p in t(s): p=list(p)+[(0,0)] c+=sum(math.hypot(p[i+1][0]-p[i][0],p[i+1][1]-p[i][1]) for i in range(5)), return min(c)
def golf2(s,r=[]): for p in t(s): i=j=c=0 for x,y in p:c+=math.hypot(i-x,j-y);i,j=x,y r+=[c] return min(r)