# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
633083 | karolb2011 | Coins (LMIO19_monetos) | Pypy 3 | 170 ms | 75204 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
import sys
input = sys.stdin.readline
t,n,k1,k2=list(map(int,input().split()))
c=1
if t>2:
c=5
r=n//c
z=r*r//2
mm=[[0 for i in range(r)]for j in range(r)]
for i in range(n):
mx=list(map(int,input().split()))
for j in range(n):
mm[i//c][j//c]+=mx[j]
dm=1000000
d=[[[dm for _ in range(z+1)]for _ in range(r+2)]for _ in range(r+1)]
d[r][0][0]=0
for i in reversed(range(r)):
a=0
di=d[i]
dip=d[i+1]
mi=max(0,z-(i+1)*r)
for j in range(r+1):
dij=di[j]
dipj=dip[j]
dipjp=dip[j+1]
ma=z+1-j*(i+1)
for k in range(mi,ma):
dk=dipj[k]
if dij[k+j]>dk+a:
dij[k+j]=dk+a
if dipjp[k]>dk:
dipjp[k]=dk
if j<r:
a+=mm[i][j]
for x in range(r+1):
if di[x][z]<dm:
dm=di[x][z]
j=x
for i in range(r):
if i>0:
while j>0 and d[i][j-1][z]==d[i][j][z]:
j-=1
z-=j
w="0 "*c*j+"1 "*c*(r-j)+"\n"
for _ in range(c):
sys.stdout.write(w)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |