oj.uz

Submission #632364

# Submission time Handle Problem Language Result Execution time Memory
632364 2022-08-19T21:53:33 Z karolb2011 Coins (LMIO19_monetos) Python 3
100 / 100
 1588 ms 75320 KB 
import sys
input = sys.stdin.readline
t,n,k1,k2=list(map(int,input().split()))
m=[]
if t<=2:
    sw=1
else:
    sw=5
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]
        ma=nn*nn//2+1-j*(i+1)
        mi=max(0,nn*nn//2-(i+1)*nn)
        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<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)

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 3028 KB K = 17
2 Correct 694 ms 34716 KB K = 576
3 Correct 1345 ms 73880 KB K = 18657
4 Correct 1409 ms 72844 KB K = 21839
5 Correct 1495 ms 71924 KB K = 17169
6 Correct 1433 ms 74220 KB K = 20873
7 Correct 1428 ms 73376 KB K = 21477
8 Correct 1392 ms 75320 KB K = 19614
9 Correct 1399 ms 72084 KB K = 20777
10 Correct 1588 ms 69328 KB K = 20150