NOI.AC
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #213854 | #2406. Thief Masters | sean1381 | 100 | 2262ms | 20704kb | C++11 | 1.7kb | 2024-11-13 22:02:36 | 2024-11-13 23:10:15 |
answer
#include<bits/stdc++.h>
using namespace std;
const int MAXN=1005;
int a,b,n,ans;
int G[MAXN][MAXN];
int xx[MAXN][MAXN],mx[MAXN][MAXN],xn[MAXN][MAXN],mn[MAXN][MAXN];
int q[MAXN],l,r;
int main()
{
cin>>a>>b>>n;
for(int i=1;i<=a;i++){
for(int j=1;j<=b;j++){
cin >>G[i][j];
}
}
for(int i=1;i<=a;i++){
l=0,r=-1;
for(int j = 1; j <= b; j++){
while(l <= r && j - q[l] + 1 > n) l++;
while(l <= r && G[i][j] > G[i][q[r]]) r--;
q[++r] = j;
if(j >= n) xx[i][j - n + 1] = G[i][q[l]];
}
}
for(int i = 1; i <= b - n + 1; i++){
l=0,r=-1;
for(int j = 1; j <= a; j++){
while(l <= r && j - q[l] + 1 > n) l++;
while(l <= r && xx[j][i] > xx[q[r]][i]) r--;
q[++r] = j;
if(j >= n) mx[j - n + 1][i] = xx[q[l]][i];
}
}
for(int i=1;i<=a;i++){
l=0,r=-1;
for(int j = 1; j <= b; j++){
while(l <= r && j - q[l] + 1 > n) l++;
while(l <= r && G[i][j] < G[i][q[r]]) r--;
q[++r] = j;
if(j >= n) xn[i][j - n + 1] = G[i][q[l]];
}
}
for(int i = 1; i <= b - n + 1; i++){
l=0,r=-1;
for(int j = 1; j <= a; j++){
while(l <= r && j - q[l] + 1 > n) l++;
while(l <= r && xn[j][i] < xn[q[r]][i]) r--;
q[++r] = j;
if(j >= n) mn[j - n + 1][i] = xn[q[l]][i];
}
}
ans=INT_MAX;
for(int i=1;i<=a-n+1;i++){
for(int j=1;j<=b-n+1;j++){
ans=min(ans,mx[i][j]-mn[i][j]);
}
}
cout<<ans<<endl;
return 0;
}
Details
小提示：点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 444ms
memory: 20076kb
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: 0ms
memory: 1296kb
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: 4ms
memory: 3096kb
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: 397ms
memory: 20704kb
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: 109ms
memory: 10640kb
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: 223ms
memory: 10416kb
input:
500 1000 80 499163842 331022295 940054497 684192083 248823911 842132608 629298697 398526298 98438040...
output:
998299092
result:
ok single line: '998299092'
Test #7:
score: 10
Accepted
time: 257ms
memory: 20232kb
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 #8:
score: 10
Accepted
time: 100ms
memory: 10252kb
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: 256ms
memory: 10264kb
input:
500 1000 100 456896744 779471086 578349238 52507342 192194992 156396237 475084995 775765435 96617474...
output:
998801667
result:
ok single line: '998801667'
Test #10:
score: 10
Accepted
time: 472ms
memory: 20080kb
input:
1000 1000 100 629053044 957239666 456746076 940194386 201529807 592062148 244394389 825620014 223976...
output:
998862873
result:
ok single line: '998862873'
Extra Test:
score: 0
Extra Test Passed
