NOI.AC
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #211037 | #3801. Thief Masters | drdilyor | 100 | 18175ms | 450884kb | C++11 | 2.0kb | 2024-08-09 09:21:37 | 2024-08-09 12:32:25 |
answer
#include<bits/stdc++.h>
inline int read(){
int n=0,f=1,ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-')f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
n=n*10+ch-'0';
ch=getchar();
}
return n*f;
}
using namespace std;
void ts(){cout<<"IAKIOI\n";}
int n,m,k;
int a[5005][5005];
int b[5005][5005];
int c[5005][5005];
int d[5005][5005];
int e[5005][5005];
int dq[100005];
void solve(){
for(int i=1;i<=n;i++){
int fr=1,rear=0;
for(int j=1;j<=k;j++){
while(fr<=rear&&a[i][j]<a[i][dq[rear]])--rear;
dq[++rear]=j;
}
d[i][1]=a[i][dq[fr]];
for(int j=k+1;j<=m;j++){
while(fr<=rear&&a[i][j]<a[i][dq[rear]])--rear;
dq[++rear]=j;
if(dq[fr]==j-k)fr++;
d[i][j-k+1]=a[i][dq[fr]];
}
}
for(int i=1;i<=m-k+1;i++){
int fr=1,rear=0;
for(int j=1;j<=k;j++){
while(fr<=rear&&d[j][i]<d[dq[rear]][i])--rear;
dq[++rear]=j;
}
e[1][i]=d[dq[fr]][i];
for(int j=k+1;j<=m;j++){
while(fr<=rear&&d[j][i]<d[dq[rear]][i])--rear;
dq[++rear]=j;
if(dq[fr]==j-k)fr++;
e[j-k+1][i]=d[dq[fr]][i];
}
}
}
signed main(){
n=read(),m=read(),k=read();
for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)a[i][j]=read();
for(int i=1;i<=n;i++){
int fr=1,rear=0;
for(int j=1;j<=k;j++){
while(fr<=rear&&a[i][j]>a[i][dq[rear]])--rear;
dq[++rear]=j;
}
b[i][1]=a[i][dq[fr]];
for(int j=k+1;j<=m;j++){
while(fr<=rear&&a[i][j]>a[i][dq[rear]])--rear;
dq[++rear]=j;
if(dq[fr]==j-k)fr++;
b[i][j-k+1]=a[i][dq[fr]];
}
}
for(int i=1;i<=m-k+1;i++){
int fr=1,rear=0;
for(int j=1;j<=k;j++){
while(fr<=rear&&b[j][i]>b[dq[rear]][i])--rear;
dq[++rear]=j;
}
c[1][i]=b[dq[fr]][i];
for(int j=k+1;j<=n;j++){
while(fr<=rear&&b[j][i]>b[dq[rear]][i])--rear;
dq[++rear]=j;
if(dq[fr]==j-k)fr++;
c[j-k+1][i]=b[dq[fr]][i];
}
}
solve();
int res=(1<<30);
for(int i=1;i<=n-k+1;i++){
for(int j=1;j<=m-k+1;j++)res=min(res,c[i][j]-e[i][j]);
}
cout<<res<<"\n";
return 0;
}
Details
小提示：点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 3603ms
memory: 450880kb
input:
5000 5000 1000 112860841 963292630 950228017 843100821 628111020 568250408 901169419 322571542 98853...
output:
999988492
result:
ok single line: '999988492'
Test #2:
score: 10
Accepted
time: 0ms
memory: 1256kb
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: 2ms
memory: 3264kb
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: 2831ms
memory: 450884kb
input:
5000 5000 1000 8974 8293 3530 8179 6181 2983 6500 3525 2603 1983 6720 5938 9247 2494 4568 9909 3852 ...
output:
9999
result:
ok single line: '9999'
Test #5:
score: 20
Accepted
time: 2734ms
memory: 450880kb
input:
5000 5000 1000 3206 5640 1070 5846 5931 3274 6116 1741 543 6399 1626 115 92 3037 464 100 3700 2694 5...
output:
9999
result:
ok single line: '9999'
Test #6:
score: 10
Accepted
time: 2822ms
memory: 450880kb
input:
5000 5000 1000 9041 1397 3723 7115 4298 5210 8033 5608 6711 6539 7140 5331 4282 2599 59 9363 5817 25...
output:
9999
result:
ok single line: '9999'
Test #7:
score: 10
Accepted
time: 3014ms
memory: 450884kb
input:
5000 5000 1000 19636 14616 3910 15971 9484 16390 2221 13667 5771 1364 2375 15202 16870 7107 13189 16...
output:
21813
result:
ok single line: '21813'
Test #8:
score: 20
Accepted
time: 3169ms
memory: 450880kb
input:
5000 5000 1000 3628 1018 3668 18160 14975 18599 9087 10641 19468 16400 19072 16984 6583 7925 19853 1...
output:
21811
result:
ok single line: '21811'
Extra Test:
score: 0
Extra Test Passed
