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=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
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(n):
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()
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
19 ms |
3028 KB |
K = 17 |
| 2 |
Incorrect |
22 ms |
3120 KB |
K = 589 |
| 3 |
Runtime error |
500 ms |
9860 KB |
Execution failed because the return code was nonzero |
| 4 |
Runtime error |
494 ms |
9456 KB |
Execution failed because the return code was nonzero |
| 5 |
Runtime error |
510 ms |
8884 KB |
Execution failed because the return code was nonzero |
| 6 |
Runtime error |
487 ms |
10084 KB |
Execution failed because the return code was nonzero |
| 7 |
Partially correct |
528 ms |
10096 KB |
K = 21580 |
| 8 |
Runtime error |
510 ms |
9424 KB |
Execution failed because the return code was nonzero |
| 9 |
Runtime error |
539 ms |
9052 KB |
Execution failed because the return code was nonzero |
| 10 |
Runtime error |
552 ms |
9172 KB |
Execution failed because the return code was nonzero |
