oj.uz

답안 #592744

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
592744 2022-07-09T14:22:39 Z hail The Kingdom of JOIOI (JOI17_joioi) C++17
100 / 100
 479 ms 15972 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;
    //min left top
    if(country[0][0]-min_alt<=x)
    {
        valid=true;
        for(int i=0; i<h; i++)
        {
            for(int j=0; j<w; j++)
            {
                if(j<border)
                {
                    if(country[i][j]-min_alt>x) {border=j; j--;}
                }
                else
                {
                    if(max_alt-country[i][j]>x)
                    {
                        valid=false;
                        break;
                    }
                }
            }
            if(not valid) break;
        }
        if(valid) return true;
    }
    //min left bottom
    border=w;
    if(country[h-1][0]-min_alt<=x)
    {
        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>x) {border=j; j--;}
                }
                else
                {
                    if(max_alt-country[i][j]>x)
                    {
                        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;
        for(int i=0; i<h; i++)
        {
            for(int j=0; j<w; j++)
            {
                if(j<border)
                {
                    if(max_alt-country[i][j]>x) {border=j; j--;}
                }
                else
                {
                    if(country[i][j]-min_alt>x)
                    {
                        valid=false;
                        break;
                    }
                }
            }
            if(not valid) break;
        }
        if(valid) return true;
    }
    //max left bottom
    border=w;
    if(max_alt-country[h-1][0]<=x)
    {
        valid=true;
        for(int i=h-1; i>=0; i--)
        {
            for(int j=0; j<w; j++)
            {
                if(j<border)
                {
                    if(max_alt-country[i][j]>x) {border=j; j--;}
                }
                else
                {
                    if(country[i][j]-min_alt>x)
                    {
                        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

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 15888 KB Output is correct
2 Correct 7 ms 15956 KB Output is correct
3 Correct 7 ms 15888 KB Output is correct
4 Correct 6 ms 15956 KB Output is correct
5 Correct 7 ms 15956 KB Output is correct
6 Correct 7 ms 15840 KB Output is correct
7 Correct 8 ms 15956 KB Output is correct
8 Correct 7 ms 15872 KB Output is correct
9 Correct 8 ms 15948 KB Output is correct
10 Correct 9 ms 15932 KB Output is correct
11 Correct 8 ms 15888 KB Output is correct
12 Correct 7 ms 15956 KB Output is correct
13 Correct 8 ms 15956 KB Output is correct
14 Correct 8 ms 15956 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 15888 KB Output is correct
2 Correct 7 ms 15956 KB Output is correct
3 Correct 7 ms 15888 KB Output is correct
4 Correct 6 ms 15956 KB Output is correct
5 Correct 7 ms 15956 KB Output is correct
6 Correct 7 ms 15840 KB Output is correct
7 Correct 8 ms 15956 KB Output is correct
8 Correct 7 ms 15872 KB Output is correct
9 Correct 8 ms 15948 KB Output is correct
10 Correct 9 ms 15932 KB Output is correct
11 Correct 8 ms 15888 KB Output is correct
12 Correct 7 ms 15956 KB Output is correct
13 Correct 8 ms 15956 KB Output is correct
14 Correct 8 ms 15956 KB Output is correct
15 Correct 7 ms 15944 KB Output is correct
16 Correct 8 ms 15956 KB Output is correct
17 Correct 10 ms 15920 KB Output is correct
18 Correct 9 ms 15856 KB Output is correct
19 Correct 10 ms 15944 KB Output is correct
20 Correct 10 ms 15888 KB Output is correct
21 Correct 16 ms 15956 KB Output is correct
22 Correct 12 ms 15968 KB Output is correct
23 Correct 11 ms 15964 KB Output is correct
24 Correct 12 ms 15956 KB Output is correct
25 Correct 11 ms 15972 KB Output is correct
26 Correct 12 ms 15956 KB Output is correct
27 Correct 12 ms 15956 KB Output is correct
28 Correct 12 ms 15880 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 15888 KB Output is correct
2 Correct 7 ms 15956 KB Output is correct
3 Correct 7 ms 15888 KB Output is correct
4 Correct 6 ms 15956 KB Output is correct
5 Correct 7 ms 15956 KB Output is correct
6 Correct 7 ms 15840 KB Output is correct
7 Correct 8 ms 15956 KB Output is correct
8 Correct 7 ms 15872 KB Output is correct
9 Correct 8 ms 15948 KB Output is correct
10 Correct 9 ms 15932 KB Output is correct
11 Correct 8 ms 15888 KB Output is correct
12 Correct 7 ms 15956 KB Output is correct
13 Correct 8 ms 15956 KB Output is correct
14 Correct 8 ms 15956 KB Output is correct
15 Correct 7 ms 15944 KB Output is correct
16 Correct 8 ms 15956 KB Output is correct
17 Correct 10 ms 15920 KB Output is correct
18 Correct 9 ms 15856 KB Output is correct
19 Correct 10 ms 15944 KB Output is correct
20 Correct 10 ms 15888 KB Output is correct
21 Correct 16 ms 15956 KB Output is correct
22 Correct 12 ms 15968 KB Output is correct
23 Correct 11 ms 15964 KB Output is correct
24 Correct 12 ms 15956 KB Output is correct
25 Correct 11 ms 15972 KB Output is correct
26 Correct 12 ms 15956 KB Output is correct
27 Correct 12 ms 15956 KB Output is correct
28 Correct 12 ms 15880 KB Output is correct
29 Correct 313 ms 15956 KB Output is correct
30 Correct 284 ms 15956 KB Output is correct
31 Correct 302 ms 15956 KB Output is correct
32 Correct 329 ms 15956 KB Output is correct
33 Correct 247 ms 15884 KB Output is correct
34 Correct 304 ms 15968 KB Output is correct
35 Correct 425 ms 15956 KB Output is correct
36 Correct 376 ms 15960 KB Output is correct
37 Correct 479 ms 15956 KB Output is correct