oj.uz

Submission #632298

# Submission time Handle Problem Language Result Execution time Memory
632298 2022-08-19T20:12:21 Z karolb2011 Coins (LMIO19_monetos) Python 3
10 / 100
 2000 ms 45056 KB 
import sys
input = sys.stdin.readline
t,n,k1,k2=list(map(int,input().split()))
m=[]
if t<=1:
    sw=1
elif t==2:
    sw=5
else:
    sw=6
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
    for j in range(nn+1):
        for k in range(nn*nn//2+1-j):
            if d[i][j][k+j]>d[i+1][j][k]+a:
                d[i][j][k+j]=d[i+1][j][k]+a
            if d[i+1][j][k]<d[i+1][j+1][k]:
                d[i+1][j+1][k]=d[i+1][j][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):
    for j in range(nn):
        if v[i//sw]>j:
            print("0 "*sw,end="")
        else:
            print("1 "*sw,end="")
    print()

Subtask #1
10.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 3028 KB K = 17
2 Incorrect 20 ms 3156 KB K = 589
3 Execution timed out 2100 ms 38712 KB Time limit exceeded
4 Execution timed out 2085 ms 40180 KB Time limit exceeded
5 Execution timed out 2078 ms 39256 KB Time limit exceeded
6 Execution timed out 2092 ms 45056 KB Time limit exceeded
7 Execution timed out 2087 ms 41896 KB Time limit exceeded
8 Execution timed out 2081 ms 44632 KB Time limit exceeded
9 Execution timed out 2078 ms 40348 KB Time limit exceeded
10 Execution timed out 2082 ms 40432 KB Time limit exceeded