NOI.AC
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #213843 | #2406. Thief Masters | ckliang | 70 | 2318ms | 439868kb | C++11 | 1.9kb | 2024-11-13 21:50:48 | 2024-11-13 23:08:59 |
answer
#include<bits/stdc++.h>
using namespace std;
const int N=1010,M=11;
int s[N][N];
int st[N][M][N][M][2];
int lg2[N];
int n,m,l;
int main()
{
cin>>n>>m>>l;
for( int i=2 ; i<N ; i++ )lg2[i]=lg2[i/2]+1;
for( int i=1 ; i<=n ; i++ )
{
for( int j=1 ; j<=m ; j++ )
{
cin>>s[i][j];
st[i][0][j][0][0]=s[i][j];
st[i][0][j][0][1]=s[i][j];
}
}
for( int k1=1 ; (1<<k1)<=l ; k1++ )
{
for( int i=1 ; i+(1<<k1)-1<=n ; i++ )
{
for( int k2=1 ; (1<<k2)<=l ; k2++ )
{
for( int j=1 ; j+(1<<k2)-1<=m ; j++ )
{
st[i][k1][j][k2][0]=min(
min(st[i][k1-1][j][k2-1][0],st[i+(1<<(k1-1))][k1-1][j][k2-1][0]),
min(st[i][k1-1][j+(1<<(k2-1))][k2-1][0],st[i+(1<<(k1-1))][k1-1][j+(1<<(k2-1))][k2-1][0])
);
st[i][k1][j][k2][1]=max(
max(st[i][k1-1][j][k2-1][1],st[i+(1<<(k1-1))][k1-1][j][k2-1][1]),
max(st[i][k1-1][j+(1<<(k2-1))][k2-1][1],st[i+(1<<(k1-1))][k1-1][j+(1<<(k2-1))][k2-1][1])
);
}
}
}
}
int ans=1e9+7,i2,j2,x=lg2[l],d=1<<(lg2[l]);
int tmp;
// cout<<x<<" "<<d<<endl;
for( int i=1 ; i+l-1<=n ; i++ )
{
for( int j=1 ; j+l-1<=m ; j++ )
{
i2=i+l-1;
j2=j+l-1;
tmp=ans;
ans=min(ans,
max(
max(st[i][x][j][x][1],st[i2-d+1][x][j][x][1]),
max(st[i][x][j2-d+1][x][1],st[i2-d+1][x][j2-d+1][x][1])
)-
min(
min(st[i][x][j][x][0],st[i2-d+1][x][j][x][0]),
min(st[i][x][j2-d+1][x][0],st[i2-d+1][x][j2-d+1][x][0])
)
);
/* cout<<i<<" "<<j<<" "<<i2<<" "<<j2<<" "<<max(
max(st[i][x][j][x][1],st[i2-d+1][x][j][x][1]),
max(st[i][x][j2-d+1][x][1],st[i2-d+1][x][j2-d+1][x][1])
)<<" "<<
min(
min(st[i][x][j][x][0],st[i2-d+1][x][j][x][0]),
min(st[i][x][j2-d+1][x][0],st[i2-d+1][x][j2-d+1][x][0])
)<<endl;
*/
}
}
cout<<ans<<endl;
return 0;
}
/*
5 5 4
1 1 3 2 4
1 1 2 5 4
3 3 1 3 4
1 3 1 3 2
2 2 4 4 2
*/
Details
小提示：点击横条可展开更详细的信息
Test #1:
score: 0
Memory Limit Exceeded
input:
1000 1000 100 804544523 340648618 718292412 235345736 704741136 942776831 741228920 463473302 677289...
output:
result:
Test #2:
score: 10
Accepted
time: 0ms
memory: 1268kb
input:
5 4 2 1 2 5 6 0 17 16 0 16 17 0 1 2 10 2 1 1 2 3 2
output:
2
result:
ok single line: '2'
Test #3:
score: 10
Accepted
time: 3ms
memory: 6456kb
input:
100 100 10 2 100001 200001 300001 400001 500001 600001 700001 800001 900001 1000001 1100001 1200001 ...
output:
908999
result:
ok single line: '908999'
Test #4:
score: 10
Accepted
time: 653ms
memory: 439868kb
input:
1000 1000 20 1 100001 200001 300001 400001 500001 600001 700001 800001 900001 1000001 1100001 120000...
output:
1901899
result:
ok single line: '1901899'
Test #5:
score: 10
Accepted
time: 197ms
memory: 140940kb
input:
500 500 50 79289095 232165705 955620938 481434262 465576217 112035388 50089892 459799006 181906335 3...
output:
995944328
result:
ok single line: '995944328'
Test #6:
score: 10
Accepted
time: 588ms
memory: 298040kb
input:
500 1000 80 499163842 331022295 940054497 684192083 248823911 842132608 629298697 398526298 98438040...
output:
998299092
result:
ok single line: '998299092'
Test #7:
score: 0
Time Limit Exceeded
input:
1000 1000 80 102 134 429 251 299 109 264 669 727 296 112 550 270 270 544 660 131 546 968 219 113 678...
output:
result:
Test #8:
score: 10
Accepted
time: 332ms
memory: 161392kb
input:
500 500 100 65532583 920409544 753795976 989349545 818384831 778207112 425141881 853270293 542112588...
output:
999172505
result:
ok single line: '999172505'
Test #9:
score: 10
Accepted
time: 545ms
memory: 298040kb
input:
500 1000 100 456896744 779471086 578349238 52507342 192194992 156396237 475084995 775765435 96617474...
output:
998801667
result:
ok single line: '998801667'
Test #10:
score: 0
Time Limit Exceeded
input:
1000 1000 100 629053044 957239666 456746076 940194386 201529807 592062148 244394389 825620014 223976...
