oj.uz

Submission #855864

# Submission time Handle Problem Language Result Execution time Memory
855864 2023-10-02T04:58:50 Z abcvuitunggio The Kingdom of JOIOI (JOI17_joioi) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
int h,w,a[2006][2006],mn[2006][2],mx[2006][2],tmp[2006],lo=1e9,hi;
bool check(int x){
    for (int i=1;i<=h;i++){
        mx[i][0]=mx[i][1]=-1;
        mn[i][0]=mn[i][1]=1e9;
        for (int j=1;j<=w;j++){
            if (a[i][j]>lo+x&&a[i][j]<hi-x)
                return false;
            if (a[i][j]>=hi-x&&a[i][j]<=lo+x)
                continue;
            int val=(a[i][j]>=hi-x);
            mx[i][val]=max(mx[i][val],j);
            mn[i][val]=min(mn[i][val],j);
        }
    }
    tmp[h+1]=w+1;
    int ch=4;
    for (int k=0;k<2;k++){
        for (int i=1;i<=h;i++)
            tmp[i]=max(tmp[i-1],mx[i][k]);
        int cur=w+1;
        for (int i=h;i>=1;i--){
            cur=min(cur,mn[i][k^1]);
            if (cur<=tmp[i]){
                ch--;
                break;
            }
        }
        for (int i=h;i>=1;i--)
            tmp[i]=min(tmp[i],mn[i][k]);
        cur=0;
        for (int i=1;i<=h;i++){
            cur=max(cur,mx[i][k^1]);
            if (cur>=tmp[i]){
                ch--;
                break;
            }
        }
    }
    return ch;
}
int main(){
    ios_base::sync_with_stdio(NULL);cin.tie(nullptr);
    cin >> h >> w;
    for (int i=1;i<=h;i++)
        for (int j=1;j<=w;j++){
            cin >> a[i][j];
            lo=min(lo,a[i][j]);
            hi=max(hi,a[i][j]);
        }
    int l=0,r=1e9,kq=-1;
    while (l<=r){
        int mid=(l+r)>>1;
        if (check(mid)){
            kq=mid;
            r=mid-1;
        }
        else
            l=mid+1;
    }
    cout << kq;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Incorrect 0 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Incorrect 0 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Incorrect 0 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -