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
z=nn*nn//2
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]
dm=1000000
d=[[[dm for _ in range(z+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]
mi=max(0,z-(i+1)*nn)
for j in range(nn+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<nn:
a+=mm[i][j]
for x in range(nn+1):
if d[0][x][z]<dm:
dm=d[0][x][z]
j=x
for i in range(nn):
if i>0:
while j>0 and d[i][j-1][z]==d[i][j][z]:
j-=1
z-=j
w="0 "*sw*j+"1 "*sw*(nn-j)+"\n"
for _ in range(sw):
sys.stdout.write(w)
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
14 ms |
3028 KB |
K = 17 |
2 |
Correct |
709 ms |
34672 KB |
K = 576 |
3 |
Correct |
1473 ms |
73904 KB |
K = 18657 |
4 |
Correct |
1566 ms |
72784 KB |
K = 21839 |
5 |
Correct |
1477 ms |
71732 KB |
K = 17169 |
6 |
Correct |
1435 ms |
74144 KB |
K = 20873 |
7 |
Correct |
1466 ms |
73248 KB |
K = 21477 |
8 |
Correct |
1544 ms |
75240 KB |
K = 19614 |
9 |
Correct |
1449 ms |
71944 KB |
K = 20777 |
10 |
Correct |
1490 ms |
69392 KB |
K = 20150 |