NOI.AC
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #148757 | #1445. 理想的正方形 | joy20101 | 100 | 815ms | 60760kb | C++11 | 1.0kb | 2022-07-17 19:02:03 | 2022-07-17 22:03:33 |
answer
#include<bits/stdc++.h>
using namespace std;
int a,b,n,t[1001][1001],st1[8][1001][1001],st2[8][1001][1001],ans=INT_MAX;
int main(){
scanf("%d%d%d",&a,&b,&n);
for(int i=1;i<=a;i++)
for(int j=1;j<=b;j++)
scanf("%d",&t[i][j]);
for(int i=1;i<=a;i++)
for(int j=1;j<=b;j++)
st1[0][i][j]=t[i][j],st2[0][i][j]=t[i][j];
for(int k=1;(1<<k)<=n;k++)
for(int i=1;i+(1<<k)-1<=a;i++)
for(int j=1;j+(1<<k)-1<=b;j++)
st1[k][i][j]=max({st1[k-1][i][j],st1[k-1][i+(1<<(k-1))][j],st1[k-1][i][j+(1<<(k-1))],st1[k-1][i+(1<<(k-1))][j+(1<<(k-1))]}),st2[k][i][j]=min({st2[k-1][i][j+(1<<(k-1))],st2[k-1][i][j],st2[k-1][i+(1<<(k-1))][j],st2[k-1][i+(1<<(k-1))][j+(1<<(k-1))]});
for(int x=1;x+n-1<=a;x++)
for(int y=1;y+n-1<=b;y++){
int k=__lg(n);
int x2=x+n-1,y2=y+n-1;
ans=min(ans,max({st1[k][x][y],st1[k][x2-(1<<k)+1][y],st1[k][x][y2-(1<<k)+1],st1[k][x2-(1<<k)+1][y2-(1<<k)+1]})-min({st2[k][x][y],st2[k][x2-(1<<k)+1][y],st2[k][x][y2-(1<<k)+1],st2[k][x2-(1<<k)+1][y2-(1<<k)+1]}));
}
printf("%d",ans);
return 0;
}
详细
小提示：点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 143ms
memory: 60756kb
input:
1000 1000 100 804544523 340648618 718292412 235345736 704741136 942776831 741228920 463473302 677289...
output:
998893495
result:
ok single line: '998893495'
Test #2:
score: 10
Accepted
time: 157ms
memory: 60760kb
input:
1000 1000 100 629053044 957239666 456746076 940194386 201529807 592062148 244394389 825620014 223976...
output:
998862873
result:
ok single line: '998862873'
Test #3:
score: 10
Accepted
time: 0ms
memory: 9400kb
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 #4:
score: 10
Accepted
time: 3ms
memory: 22056kb
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 #5:
score: 10
Accepted
time: 140ms
memory: 45840kb
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 #6:
score: 10
Accepted
time: 38ms
memory: 37132kb
input:
500 500 50 79289095 232165705 955620938 481434262 465576217 112035388 50089892 459799006 181906335 3...
output:
995944328
result:
ok single line: '995944328'
Test #7:
score: 10
Accepted
time: 90ms
memory: 40584kb
input:
500 1000 80 499163842 331022295 940054497 684192083 248823911 842132608 629298697 398526298 98438040...
output:
998299092
result:
ok single line: '998299092'
Test #8:
score: 10
Accepted
time: 123ms
memory: 60760kb
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:
998
result:
ok single line: '998'
Test #9:
score: 10
Accepted
time: 37ms
memory: 40552kb
input:
500 500 100 65532583 920409544 753795976 989349545 818384831 778207112 425141881 853270293 542112588...
output:
999172505
result:
ok single line: '999172505'
Test #10:
score: 10
Accepted
time: 84ms
memory: 40584kb
input:
500 1000 100 456896744 779471086 578349238 52507342 192194992 156396237 475084995 775765435 96617474...
output:
998801667
result:
ok single line: '998801667'
