task398.py

# best: 72(lv1.dev, LogicLynx) / others: 73(FuunAgent), 73(ox jam), 77(jailctf merger), 78(Code Golf International), 79(4atj sisyphus luke Seek mukundan)
# def p(g):a=g[0];d={i:v for i,v in enumerate(a)if v};m=len(a)*len(d);return[[d.get(r+j-m+1,0)for j in range(m)]for r in range(m)]

# def p(g):
#  m=5*sum(map(bool,g[0]))
#  a=[0]*~-m+g[0]
# #  a=[0]*~-m+g[0]+[0]*m
#  return [(a[i:]+[0]*i)[:m] for i in range(m)]

# lambda g:([a:=g[0]+[0]*5*~-sum(map(bool,*g))]+[a:=[0]+a[:-1]for _ in a[1:]])[::-1]
# lambda g:([a:=g[0]+[0]*5*(4-g[0].count(0))]+[a:=[0]+a[:-1]for _ in a[1:]])[::-1]
# lambda g:[a:=g[0]+[0]*5*(4-g[0].count(0)),*(a:=[0]+a[:-1]for _ in a[1:])][::-1]

# p=lambda g:(m:=5*sum(map(bool,a:=g[0])))and[([0]*(m-1-i)+a+[0]*m)[:m]for i in range(m)]
# f p(g):m=5*sum(map(bool,a:=g[0]));return[([0]*(m-1-i)+a+[0]*m)[:m]for i in range(m)]
# f p(g):m=5*sum(map(bool,a:=g[0]));return[([0]*(m-1-i)+a+[0]*m)[:m]for i in range(m)]
# f p(g):m=20-5*(a:=g[0]).count(0);return[([0]*(m-1-i)+a+[0]*m)[:m]for i in range(m)]
# f p(g):m=20-5*g[0].count(0);return[([0]*(m-1-i)+g[0]+[0]*m)[:m]for i in range(m)]

# ================================= 72 =================================
p=lambda g:[a:=g[0]+[0]*5*(4-g[0].count(0)),*(a:=[0]+a[:-1]for _ in a[1:])][::-1]



#  b=[(v,i)for i,v in enumerate(a)if v]
#  m=len(a)*len(b)
#  g=[[0]*m for _ in range(m)]
#  for s in range(m):
#   for v,i in b:
#    k=i+s
#    if k<m:g[m-1-s][k]=v