NOI.AC
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #205643 | #1445. 理想的正方形 | yhmm | 40 | 1665ms | 5304kb | C++11 | 1.5kb | 2024-07-18 20:52:00 | 2024-07-18 20:52:02 |
answer
#include<bits/stdc++.h>
#pragma GCC optimize(3)
using namespace std;
int a,b,n,c[1001][1001],minn=INT_MAX,Minn,Maxn;
deque<int>q[201];
int main(){
cin>>a>>b>>n;
for(int i=1;i<=a;i++)
{
for(int j=1;j<=b;j++)
{
cin>>c[i][j];
}
}
for(int x=1;x<=a-n+1;x++)
{
Minn=INT_MAX,Maxn=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
while(q[i].size()&&c[x+i-1][q[i].back()]>=c[x+i-1][j])
{
q[i].pop_back();
}
q[i].push_back(j);
while(q[i+100].size()&&c[x+i-1][q[i+100].back()]<=c[x+i-1][j])
{
q[i+100].pop_back();
}
q[i+100].push_back(j);
Minn=min(Minn,c[x+i-1][q[i].front()]),Maxn=max(Maxn,c[x+i-1][q[i+100].front()]);
}
}
minn=min(minn,Maxn-Minn);
for(int y=2;y<=b-n+1;y++)
{
Minn=INT_MAX,Maxn=0;
for(int i=1;i<=n;i++)
{
if(q[i].size()&&q[i].front()<y)
{
q[i].pop_front();
}
while(q[i].size()&&c[x+i-1][q[i].back()]>=c[x+i-1][n+y-1])
{
q[i].pop_back();
}
q[i].push_back(n+y-1);
if(q[i+100].size()&&q[i+100].front()<y)
{
q[i+100].pop_front();
}
while(q[i+100].size()&&c[x+i-1][q[i+100].back()]<=c[x+i-1][n+y-1])
{
q[i+100].pop_back();
}
q[i+100].push_back(n+y-1);
Minn=min(Minn,c[x+i-1][q[i].front()]),Maxn=max(Maxn,c[x+i-1][q[i+100].front()]);
}
minn=min(minn,Maxn-Minn);
}
for(int i=1;i<=200;i++)
{
q[i].clear();
}
}
cout<<minn;
return 0;
}
Details
小提示：点击横条可展开更详细的信息
Test #1:
score: 0
Time Limit Exceeded
input:
1000 1000 100 804544523 340648618 718292412 235345736 704741136 942776831 741228920 463473302 677289...
output:
result:
Test #2:
score: 0
Time Limit Exceeded
input:
1000 1000 100 629053044 957239666 456746076 940194386 201529807 592062148 244394389 825620014 223976...
output:
result:
Test #3:
score: 10
Accepted
time: 0ms
memory: 1396kb
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: 7ms
memory: 1784kb
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: 965ms
memory: 5304kb
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: 693ms
memory: 3356kb
input:
500 500 50 79289095 232165705 955620938 481434262 465576217 112035388 50089892 459799006 181906335 3...
output:
995944328
result:
ok single line: '995944328'
Test #7:
score: 0
Time Limit Exceeded
input:
500 1000 80 499163842 331022295 940054497 684192083 248823911 842132608 629298697 398526298 98438040...
output:
result:
Test #8:
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 #9:
score: 0
Time Limit Exceeded
input:
500 500 100 65532583 920409544 753795976 989349545 818384831 778207112 425141881 853270293 542112588...
output:
result:
Test #10:
score: 0
Time Limit Exceeded
input:
500 1000 100 456896744 779471086 578349238 52507342 192194992 156396237 475084995 775765435 96617474...
