제출 #314159

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
314159		MarcoMeijer	The Kingdom of JOIOI (JOI17_joioi)	C++14	100 / 100	979 ms	117988 KiB

joioi

#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
//===================//
//  Added libraries  //
//===================//
 
//===================//
//end added libraries//
//===================//
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 3000;

ll h, w;
ll mn, mx;
ll a[MX][MX];
ll b[MX][MX];

bool possible(ll cost) {
    int lst = -1;
    RE(i,h) {
        int cur = -1;
        bool firstOther = 0;
        RE(j,w) {
            if(a[i][j] < mx-cost) {
                if(a[i][j] > mn+cost)
                    return 0;
                cur = j;
                if(firstOther)
                    return 0;
            } else if(a[i][j] > mn+cost) {
                if(j <= lst)
                    return 0;
                firstOther = 1;
            }
        }
        lst = max(lst, cur);
    }
    return 1;
}
ll searchAns() {
    ll lb=0, ub=mx-mn;
    while(lb != ub) {
        ll mid=(lb+ub)/2;
        if(possible(mid)) ub=mid;
        else lb=mid+1;
    }
    return lb;
}

void program() {
    IN(h,w);
    RE(i,h) RE(j,w) IN(a[i][j]);
    RE(i,h) RE(j,w) b[i][j] = a[i][j];
    mn = INF; mx=-INF;
    RE(i,h) RE(j,w) mn = min(mn, a[i][j]);
    RE(i,h) RE(j,w) mx = max(mx, a[i][j]);

    ll ans = INF;
    ans = min(ans, searchAns());
    RE(i,h) RE(j,w) a[i][j] = b[h-i-1][j];
    ans = min(ans, searchAns());
    RE(i,h) RE(j,w) a[i][j] = b[i][w-j-1];
    ans = min(ans, searchAns());
    RE(i,h) RE(j,w) a[i][j] = b[h-i-1][w-j-1];
    ans = min(ans, searchAns());
    OUTL(ans);
}

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