oj.uz

Submission #362889

# Submission time Handle Problem Language Result Execution time Memory
362889 2021-02-04T15:48:56 Z AmineWeslati The Kingdom of JOIOI (JOI17_joioi) C++14
15 / 100
 4000 ms 4704 KB 
//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;
int g[MX][MX];
V<pair<int,pi>>vec;

int solve(){
	set<pair<int,pi>>s,ss;
	for(auto x: vec){
		ss.insert(x);
	}

	int ans=INF;
	for(auto x: vec){
		int r=x.se.fi,c=x.se.se;
		FOR(i,0,r+1) FOR(j,0,c+1){
			s.insert({g[i][j],{i,j}});
			ss.erase({g[i][j],{i,j}});
		}

		int a=0,b=0;
		if(sz(s)){
			auto it=s.begin(),itr=s.end(); itr--;
			a=(*itr).fi-(*it).fi;
		}
		if(sz(ss)){
			auto it=ss.begin(),itr=ss.end(); itr--;
			b=(*itr).fi-(*it).fi;
		}
		ckmin(ans,max(a,b));
	}
	return ans;
}

int solve2(){
	set<pair<int,pi>>s,ss;
	for(auto x: vec){
		ss.insert(x);
	}

	int ans=INF;
	for(auto x: vec){
		int r=x.se.fi,c=x.se.se;
		FOR(i,0,r+1) FOR(j,c,M){
			s.insert({g[i][j],{i,j}});
			ss.erase({g[i][j],{i,j}});
		}

		int a=0,b=0;
		if(sz(s)){
			auto it=s.begin(),itr=s.end(); itr--;
			a=(*itr).fi-(*it).fi;
		}
		if(sz(ss)){
			auto it=ss.begin(),itr=ss.end(); itr--;
			b=(*itr).fi-(*it).fi;
		}
		ckmin(ans,max(a,b));
	}
	return ans;
}
int solve3(){
	set<pair<int,pi>>s,ss;
	for(auto x: vec){
		ss.insert(x);
	}

	int ans=INF;
	for(auto x: vec){
		int r=x.se.fi,c=x.se.se;
		FOR(i,r,N) FOR(j,0,c+1){
			s.insert({g[i][j],{i,j}});
			ss.erase({g[i][j],{i,j}});
		}

		int a=0,b=0;
		if(sz(s)){
			auto it=s.begin(),itr=s.end(); itr--;
			a=(*itr).fi-(*it).fi;
		}
		if(sz(ss)){
			auto it=ss.begin(),itr=ss.end(); itr--;
			b=(*itr).fi-(*it).fi;
		}
		ckmin(ans,max(a,b));
	}
	return ans;
}
int solve4(){
	set<pair<int,pi>>s,ss;
	for(auto x: vec){
		ss.insert(x);
	}

	int ans=INF;
	for(auto x: vec){
		int r=x.se.fi,c=x.se.se;
		FOR(i,r,N) FOR(j,c,M){
			s.insert({g[i][j],{i,j}});
			ss.erase({g[i][j],{i,j}});
		}

		int a=0,b=0;
		if(sz(s)){
			auto it=s.begin(),itr=s.end(); itr--;
			a=(*itr).fi-(*it).fi;
		}
		if(sz(ss)){
			auto it=ss.begin(),itr=ss.end(); itr--;
			b=(*itr).fi-(*it).fi;
		}
		ckmin(ans,max(a,b));
	}
	return ans;
}

int32_t main() {
    boost; IO();

    cin>>N>>M;
    FOR(i,0,N) FOR(j,0,M){
    	cin>>g[i][j];
    	vec.pb({g[i][j],{i,j}});
	}
	sort(all(vec));

	int ans=min(min(solve(),solve2()),min(solve3(),solve4()));
	reverse(all(vec));
	ckmin(ans,min(min(solve(),solve2()),min(solve3(),solve4())));
	
	cout << ans << endl;

    

    return 0;
}
//Change your approach

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 3 ms 364 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 3 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct

Subtask #2
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 3 ms 364 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 3 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 1238 ms 748 KB Output is correct
16 Execution timed out 4078 ms 4704 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 3 ms 364 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 3 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 1238 ms 748 KB Output is correct
16 Execution timed out 4078 ms 4704 KB Time limit exceeded
17 Halted 0 ms 0 KB -