제출 #372835

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
372835		AmineWeslati	The Kingdom of JOIOI (JOI17_joioi)	C++14	60 / 100	4051 ms	83720 KiB

joioi

//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
#define int ll
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2000 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////


int N,M,mn=INF,mx=-INF;
V<vi>g;

bool solve(int K){
	int top=-1;

	bool ok=1;
	FOR(j,0,sz(g[0])){
		ROF(i,0,sz(g)) if(!(g[i][j]>=mx-K)){
			ckmax(top,i);
			break;
		}
		FOR(i,0,top+1) if(!(g[i][j]<=mn+K)){
			ok=0;
		}
	}
	if(ok) return 1;

	ok=1;
	ROF(j,0,sz(g[0])){
		ROF(i,0,sz(g)) if(!(g[i][j]>=mx-K)){
			ckmax(top,i);
			break;
		}
		FOR(i,0,top+1) if(!(g[i][j]<=mn+K)){
			ok=0;
		}
	}
	return ok;
}


void rotate(){
	int n=sz(g),m=sz(g[0]); 

	V<vi>gg; 
	gg.resize(m); 
    FOR(i,0,m) gg[i].resize(n);

    FOR(i,0,n) FOR(j,0,m){
    	gg[j][n-1-i]=g[i][j];
    }

    g.resize(m);
    FOR(i,0,m) g[i].assign(all(gg[i]));
}

bool check(int K){
	int ans=0;
	FOR(i,0,4){
		ans|=solve(K);
		rotate();
	}
	return ans;
}

int32_t main() {
    boost; IO();

    cin>>N>>M;
    g.resize(N); 
    FOR(i,0,N) g[i].resize(M);
    FOR(i,0,N) FOR(j,0,M){
    	cin>>g[i][j];
    	ckmin(mn,g[i][j]);
    	ckmax(mx,g[i][j]);
	}

	int l=0,r=INF,ans;
	while(l<=r){
		int m=(l+r)/2;
		if(check(m)){
			ans=m;
			r=m-1;
		}
		else l=m+1;
	}
	cout << ans << endl;


    

    return 0;
}
//Change your approach 

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