NOI.AC
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #148727 | #1445. 理想的正方形 | X_X | 100 | 906ms | 20800kb | C++ | 1.3kb | 2022-07-17 18:30:37 | 2022-07-17 22:01:29 |
answer
//#pragma GCC optimize(2)
//#pragma C++ optimize(2)
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=1002;
int n,m,k,a[N][N],q[N],s,t,ans=INT_MAX;
int xx[N][N],xy[N][N],yx[N][N],yy[N][N];
int main()
{
scanf("%d%d%d",&n,&m,&k);
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
scanf("%d",&a[i][j]);
for(int i=1;i<=n;i++){
s=1,t=0;
for(int j=1;j<=m;j++){
if(s<=t&&q[s]<j-k+1) s++;
while(s<=t&&a[i][q[t]]>=a[i][j]) t--;
q[++t]=j;
if(j>=k) xx[i][j-k+1]=a[i][q[s]];
}
s=1,t=0;
for(int j=1;j<=m;j++){
if(s<=t&&q[s]<j-k+1) s++;
while(s<=t&&a[i][q[t]]<=a[i][j]) t--;
q[++t]=j;
if(j>=k) xy[i][j-k+1]=a[i][q[s]];
}
}
for(int i=1;i<=m;i++){
s=1,t=0;
for(int j=1;j<=n;j++){
if(s<=t&&q[s]<j-k+1) s++;
while(s<=t&&xx[q[t]][i]>=xx[j][i]) t--;
q[++t]=j;
if(j>=k) yx[j-k+1][i]=xx[q[s]][i];
}
s=1,t=0;
for(int j=1;j<=n;j++){
if(s<=t&&q[s]<j-k+1) s++;
while(s<=t&&xy[q[t]][i]<=xy[j][i]) t--;
q[++t]=j;
if(j>=k) yy[j-k+1][i]=xy[q[s]][i];
}
}
for(int i=1;i<=n-k+1;i++)
for(int j=1;j<=m-k+1;j++)
ans=min(ans,yy[i][j]-yx[i][j]);
printf("%d",ans);
return 0;
}
详细
小提示：点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 164ms
memory: 20800kb
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: 155ms
memory: 20800kb
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: 2ms
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: 0ms
memory: 13832kb
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: 142ms
memory: 20796kb
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: 37ms
memory: 19340kb
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: 72ms
memory: 19220kb
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: 132ms
memory: 20800kb
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: 66ms
memory: 19140kb
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: 136ms
memory: 19144kb
input:
500 1000 100 456896744 779471086 578349238 52507342 192194992 156396237 475084995 775765435 96617474...
output:
998801667
result:
ok single line: '998801667'
