oj.uz

Submission #592754

# Submission time Handle Problem Language Result Execution time Memory
592754 2022-07-09T14:37:01 Z hail The Kingdom of JOIOI (JOI17_joioi) C++17
100 / 100
 443 ms 16060 KB 
#include <bits/stdc++.h>

using namespace std;

int h{};
int w{};
int max_alt{0};
int min_alt(1e9);

bool check_kingdom(int x, int country[2000][2000])
{
    int border{w};
    bool valid;
    bool element_present;
    //min left top
    if(country[0][0]-min_alt<=x)
    {
        valid=true;
        element_present=false;
        for(int i=0; i<h; i++)
        {
            for(int j=0; j<w; j++)
            {
                if(j<border)
                {
                    if(country[i][j]==min_alt) element_present=true;
                    if(country[i][j]-min_alt>x) {border=j; j--;}
                }
                else
                {
                    if(max_alt-country[i][j]>x)
                    {
                        valid=false;
                        break;
                    }
                }
                if(border==0 && (not element_present))
                {
                    valid=false;
                    break;
                }
            }
            if(not valid) break;
        }
        if(valid) return true;
    }
    //min left bottom
    border=w;
    if(country[h-1][0]-min_alt<=x)
    {
        element_present=false;
        valid=true;
        for(int i=h-1; i>=0; i--)
        {
            for(int j=0; j<w; j++)
            {
                if(j<border)
                {
                    if(country[i][j]==min_alt) element_present=true;
                    if(country[i][j]-min_alt>x) {border=j; j--;}
                }
                else
                {
                    if(max_alt-country[i][j]>x)
                    {
                        valid=false;
                        break;
                    }
                }
                if(border==0 && (not element_present))
                {
                    valid=false;
                    break;
                }
            }
            if(not valid) break;
        }
        if(valid) return true;
    }
    //max left top
    border=w;
    if(max_alt-country[0][0]<=x)
    {
        valid=true;
        element_present=false;
        for(int i=0; i<h; i++)
        {
            for(int j=0; j<w; j++)
            {
                if(j<border)
                {
                    if(country[i][j]==max_alt) element_present=true;
                    if(max_alt-country[i][j]>x) {border=j; j--;}
                }
                else
                {
                    if(country[i][j]-min_alt>x)
                    {
                        valid=false;
                        break;
                    }
                }
                if(border==0 && (not element_present))
                {
                    valid=false;
                    break;
                }
            }
            if(not valid) break;
        }
        if(valid) return true;
    }
    //max left bottom
    border=w;
    if(max_alt-country[h-1][0]<=x)
    {
        element_present=false;
        valid=true;
        for(int i=h-1; i>=0; i--)
        {
            for(int j=0; j<w; j++)
            {
                if(j<border)
                {
                    if(country[i][j]==max_alt) element_present=true;
                    if(max_alt-country[i][j]>x) {border=j; j--;}
                }
                else
                {
                    if(country[i][j]-min_alt>x)
                    {
                        valid=false;
                        break;
                    }
                }
                if(border==0 && (not element_present))
                {
                    valid=false;
                    break;
                }
            }
            if(not valid) break;
        }
        if(valid) return true;
    }
    return false;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin>>h>>w;
    int country[2000][2000];


    for(int i=0; i<h; i++)
    {
        for(int j=0; j<w; j++)
        {
            cin>>country[i][j];
            max_alt=max(max_alt, country[i][j]);
            min_alt=min(min_alt, country[i][j]);
        }
    }

    int high=max_alt-min_alt;
    int low=-1;

    int mid;

    while(high-low>1)
    {
        mid=(high+low)/2;
        if(check_kingdom(mid, country)) high=mid;
        else low=mid;
    }

    cout<<high;

    return 0;

}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15956 KB Output is correct
2 Correct 7 ms 15956 KB Output is correct
3 Correct 6 ms 15956 KB Output is correct
4 Correct 8 ms 15876 KB Output is correct
5 Correct 7 ms 15956 KB Output is correct
6 Correct 7 ms 15956 KB Output is correct
7 Correct 8 ms 15956 KB Output is correct
8 Correct 6 ms 15956 KB Output is correct
9 Correct 7 ms 15956 KB Output is correct
10 Correct 7 ms 15908 KB Output is correct
11 Correct 7 ms 15864 KB Output is correct
12 Correct 6 ms 15956 KB Output is correct
13 Correct 6 ms 15956 KB Output is correct
14 Correct 7 ms 15956 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15956 KB Output is correct
2 Correct 7 ms 15956 KB Output is correct
3 Correct 6 ms 15956 KB Output is correct
4 Correct 8 ms 15876 KB Output is correct
5 Correct 7 ms 15956 KB Output is correct
6 Correct 7 ms 15956 KB Output is correct
7 Correct 8 ms 15956 KB Output is correct
8 Correct 6 ms 15956 KB Output is correct
9 Correct 7 ms 15956 KB Output is correct
10 Correct 7 ms 15908 KB Output is correct
11 Correct 7 ms 15864 KB Output is correct
12 Correct 6 ms 15956 KB Output is correct
13 Correct 6 ms 15956 KB Output is correct
14 Correct 7 ms 15956 KB Output is correct
15 Correct 7 ms 15956 KB Output is correct
16 Correct 8 ms 15956 KB Output is correct
17 Correct 10 ms 15956 KB Output is correct
18 Correct 10 ms 15956 KB Output is correct
19 Correct 12 ms 16060 KB Output is correct
20 Correct 10 ms 15956 KB Output is correct
21 Correct 12 ms 15956 KB Output is correct
22 Correct 11 ms 15956 KB Output is correct
23 Correct 11 ms 15948 KB Output is correct
24 Correct 10 ms 15972 KB Output is correct
25 Correct 11 ms 15856 KB Output is correct
26 Correct 11 ms 15976 KB Output is correct
27 Correct 12 ms 15956 KB Output is correct
28 Correct 19 ms 15972 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15956 KB Output is correct
2 Correct 7 ms 15956 KB Output is correct
3 Correct 6 ms 15956 KB Output is correct
4 Correct 8 ms 15876 KB Output is correct
5 Correct 7 ms 15956 KB Output is correct
6 Correct 7 ms 15956 KB Output is correct
7 Correct 8 ms 15956 KB Output is correct
8 Correct 6 ms 15956 KB Output is correct
9 Correct 7 ms 15956 KB Output is correct
10 Correct 7 ms 15908 KB Output is correct
11 Correct 7 ms 15864 KB Output is correct
12 Correct 6 ms 15956 KB Output is correct
13 Correct 6 ms 15956 KB Output is correct
14 Correct 7 ms 15956 KB Output is correct
15 Correct 7 ms 15956 KB Output is correct
16 Correct 8 ms 15956 KB Output is correct
17 Correct 10 ms 15956 KB Output is correct
18 Correct 10 ms 15956 KB Output is correct
19 Correct 12 ms 16060 KB Output is correct
20 Correct 10 ms 15956 KB Output is correct
21 Correct 12 ms 15956 KB Output is correct
22 Correct 11 ms 15956 KB Output is correct
23 Correct 11 ms 15948 KB Output is correct
24 Correct 10 ms 15972 KB Output is correct
25 Correct 11 ms 15856 KB Output is correct
26 Correct 11 ms 15976 KB Output is correct
27 Correct 12 ms 15956 KB Output is correct
28 Correct 19 ms 15972 KB Output is correct
29 Correct 307 ms 15952 KB Output is correct
30 Correct 281 ms 15956 KB Output is correct
31 Correct 315 ms 15956 KB Output is correct
32 Correct 312 ms 15956 KB Output is correct
33 Correct 257 ms 15956 KB Output is correct
34 Correct 316 ms 15952 KB Output is correct
35 Correct 420 ms 15956 KB Output is correct
36 Correct 398 ms 15956 KB Output is correct
37 Correct 443 ms 15956 KB Output is correct