Submission #632320

# Submission time Handle Problem Language Result Execution time Memory
632320 2022-08-19T20:39:17 Z karolb2011 Coins (LMIO19_monetos) Python 3
97.1576 / 100
1938 ms 58656 KB
import sys
input = sys.stdin.readline
t,n,k1,k2=list(map(int,input().split()))
m=[]
if t<=2:
    sw=1
elif t in [3,4,6,7,10]:
    sw=6
else:
    sw=10
nn=n//sw
ssw=sw*sw
mm=[[0 for i in range(nn)]for j in range(nn)]
for i in range(n):
    mx=list(map(int,input().split()))
    for j in range(n):
        mm[i//sw][j//sw]+=mx[j]

d=[[[1000000 for _ in range(nn*nn//2+1)]for _ in range(nn+2)]for _ in range(nn+1)]
d[nn][0][0]=0
for i in reversed(range(nn)):
    a=0
    di=d[i]
    dip=d[i+1]
    for j in range(nn+1):
        dij=di[j]
        dipj=dip[j]
        dipjp=dip[j+1]
        for k in range(nn*nn//2+1-j):
            if dij[k+j]>dipj[k]+a:
                dij[k+j]=dipj[k]+a
            if dipj[k]<dipjp[k]:
                dipjp[k]=dipj[k]
        if j<nn:
            a+=mm[i][j]
v=[0 for _ in range(nn)]

k=nn*nn//2
dm=1000000
for j in range(nn+1):
    if d[0][j][k]<dm:
        dm=d[0][j][k]
        jj=j
j=jj
for i in range(nn):
    if i>0:
        while j>0 and d[i][j-1][k]==d[i][j][k]:
            j-=1
    v[i]=j
    k-=j
    if j==0:
        break
    
#print(*v)
for i in range(n):
    ss=""
    for j in range(nn):
        if v[i//sw]>j:
            
            ss+="0 "*sw
        else:
            ss+="1 "*sw
    ss+="\n"
    sys.stdout.write(ss)
# Verdict Execution time Memory Grader output
1 Correct 16 ms 3024 KB K = 17
2 Correct 1820 ms 45060 KB K = 576
3 Partially correct 1930 ms 56056 KB K = 18672
4 Partially correct 1921 ms 54120 KB K = 21858
5 Partially correct 325 ms 8980 KB K = 17237
6 Partially correct 1915 ms 58656 KB K = 20888
7 Partially correct 1933 ms 57148 KB K = 21498
8 Partially correct 346 ms 9676 KB K = 19690
9 Partially correct 300 ms 9200 KB K = 20790
10 Partially correct 1938 ms 51208 KB K = 20181