Submission #533902

#	Time	Username	Problem	Language	Result	Execution time	Memory
533902		ioi	The Kingdom of JOIOI (JOI17_joioi)	C++14	60 / 100	4032 ms	35820 KiB

joioi

#include<bits/stdc++.h>

using namespace std;

#define debug(x) cout << '[' << #x << " is: " << x << "] " << endl;
#define inF freopen("6in.txt" , "r" , stdin);
#define outF freopen("6.txt" , "w" , stdout);
#define imod(a , n) (a % n + n ) % n
#define sor(v) sort(v.begin() , v.end());
#define print(v) for(auto f : v ) cout << f << " " ;
#define rsor(v) sort(v.rbegin() , v.rend());
#define rev(v) reverse(v.begin() , v.end());
#define scan(v)for(auto &it : v)cin >> it ;
#define ll long long
//#define int ll
#define logar(x , y) log(x) / log(y)
#define __sum(n) n * (n + 1) / 2
#define __lcm(a , b) a / __gcd(a , b) * b
#define pii pair<int , int >
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);
const int N =  2e3 + 5 ,  M = N * 64  , MX = 2e4 + 40;

int n , m ;

int arr[N][N];
int sz ;

bool check(int from , int to){
    int mx = 0 , mn = 1e9 , en = n;

    for(int c = 0 ; c < m ; c ++){
        for(int r = 0 ; r < n ; r ++){
            if(arr[r][c] < from || arr[r][c] > to)en = min(r , en) ;

            if(r >= en)mx = max(mx , arr[r][c] ) , mn = min(mn , arr[r][c]);
        }

    }


    return mx-mn <= to - from;

}

int arr2[N][N];
int32_t main()
{   //inF;
    //inF;outF;
    fastio;

    cin >> n >> m ;

    int mx = 0 , mn = 1e9 ;

    for(int i = 0 ; i <  n; i ++){
        for(int j = 0 ; j <m; j ++){
            cin >> arr[i][j];
            arr2[i][j] =  arr[i][j];


            mx = max(mx , arr[i][j]) , mn = min(mn , arr[i][j]);

        }
    }


    int mnans = mx - mn;
    for(int all = 0 ; all < 2 ; all ++){


        int  l = 0 , r = mx - mn , md ;



        while(l <= r){


            md = (l + r) / 2 ;


            if(check(mn , mn + md) || check(mx - md , mx))
                mnans = min(mnans , md) ,  r = md- 1 ;
            else l = md + 1 ;


        }


        for(int c = 0 ; c < m ; c ++){
            for(int r = 0 ; r< n ; r ++){
                arr[r][c] = arr2[r][m - 1 - c];
               // debug(arr[r][c])
            }
        }
    }

    cout << mnans ;

}

• Subtask 1: 15 / 15
• Subtask 2: 45 / 45
• Subtask 3: 0 / 40