# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
124782 | ainta | The Kingdom of JOIOI (JOI17_joioi) | C++17 | 2 ms | 256 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
int n, m;
int w[2010][2010], Mn = 2e9;
bool Pos(int K){
int i, j, M1 = 2e9, M2 = 0;
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
if(w[i][j] > Mn+K)break;
}
for(;j<=m;j++){
M1 = min(M1, w[i][j]);
M2 = max(M2, w[i][j]);
}
if(M2-M1>K)break;
}
if(M2-M1<=K)return true;
M1=2e9,M2=0;
for(i=1;i<=n;i++){
for(j=m;j>=1;j--){
if(w[i][j] > Mn+K)break;
}
for(;j>=1;j--){
M1 = min(M1, w[i][j]);
M2 = max(M2, w[i][j]);
}
if(M2-M1>K)break;
}
if(M2-M1<=K)return true;
return false;
}
int main() {
int i, j;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
scanf("%d",&w[i][j]);
Mn = min(Mn, w[i][j]);
}
}
int b = 0, e = 1e9, mid, r;
while(b<=e){
mid=(b+e)>>1;
if(Pos(mid))r=mid, e=mid-1;
else b=mid+1;
}
printf("%d\n",r);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |