oj.uz

Submission #362900

# Submission time Handle Problem Language Result Execution time Memory
362900 2021-02-04T16:18:10 Z AmineWeslati The Kingdom of JOIOI (JOI17_joioi) C++14
60 / 100
 2286 ms 262148 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;
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 = 2e9;
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,g[MX][MX],vis[MX][MX];
V<pair<int,pi>>vec;
//set<pair<int,pi>>s,ss;
multiset<int>s,ss;

bool grid(int x, int y, int r, int c, int rr, int cc){
	return x>=r && y>=c && x<=rr && y<=cc;
}

void dfs(int x, int y, int r, int c, int rr, int cc){
	if(vis[x][y]) return;
	vis[x][y]=1;
	/*s.insert({g[x][y],{x,y}});
	ss.erase({g[x][y],{x,y}});*/
	s.insert(g[x][y]);
	if(ss.count(g[x][y])) ss.erase(ss.find(g[x][y]));
	FOR(i,0,4){
		int nwx=x+nx[i],nwy=y+ny[i];
		if(grid(nwx,nwy,r,c,rr,cc) && !vis[nwx][nwy]) dfs(nwx,nwy,r,c,rr,cc);
	}
}

int solve(){
	s.clear(); ss.clear();
	for(auto x: vec){
		ss.insert(x.fi);
	}
	FOR(i,0,N) FOR(j,0,M) vis[i][j]=0;

	int ans=INF;
	for(auto x: vec){
		int r=x.se.fi,c=x.se.se;
		dfs(r,c,r,c,N-1,M-1);

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

	FOR(i,0,N) FOR(j,0,M) vis[i][j]=0;

	int ans=INF;
	for(auto x: vec){
		int r=x.se.fi,c=x.se.se;
		dfs(r,c,0,0,r,c);

		int a=0,b=0;
		if(sz(s)){
			auto it=s.begin(),itr=s.end(); itr--;
			a=(*itr)-(*it);
		}
		if(sz(ss)){
			auto it=ss.begin(),itr=ss.end(); itr--;
			b=(*itr)-(*it);
		}
		ckmin(ans,max(a,b));
	}
	return ans;
}
int solve3(){
	s.clear(); ss.clear();
	for(auto x: vec){
		ss.insert(x.fi);
	}
	FOR(i,0,N) FOR(j,0,M) vis[i][j]=0;

	int ans=INF;
	for(auto x: vec){
		int r=x.se.fi,c=x.se.se;
		dfs(r,c,0,c,r,M-1);

		int a=0,b=0;
		if(sz(s)){
			auto it=s.begin(),itr=s.end(); itr--;
			a=(*itr)-(*it);
		}
		if(sz(ss)){
			auto it=ss.begin(),itr=ss.end(); itr--;
			b=(*itr)-(*it);
		}
		ckmin(ans,max(a,b));
	}
	return ans;
}
int solve4(){
	s.clear(); ss.clear();
	for(auto x: vec){
		ss.insert(x.fi);
	}
	FOR(i,0,N) FOR(j,0,M) vis[i][j]=0;

	int ans=INF;
	for(auto x: vec){
		int r=x.se.fi,c=x.se.se;
		dfs(r,c,r,0,N-1,c);

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

int 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 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 364 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 8 ms 748 KB Output is correct
16 Correct 178 ms 7236 KB Output is correct
17 Correct 279 ms 6628 KB Output is correct
18 Correct 251 ms 6392 KB Output is correct
19 Correct 258 ms 6756 KB Output is correct
20 Correct 237 ms 6244 KB Output is correct
21 Correct 278 ms 7268 KB Output is correct
22 Correct 248 ms 6628 KB Output is correct
23 Correct 271 ms 7140 KB Output is correct
24 Correct 221 ms 6628 KB Output is correct
25 Correct 263 ms 6116 KB Output is correct
26 Correct 267 ms 7652 KB Output is correct
27 Correct 273 ms 7140 KB Output is correct
28 Correct 274 ms 7268 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 8 ms 748 KB Output is correct
16 Correct 178 ms 7236 KB Output is correct
17 Correct 279 ms 6628 KB Output is correct
18 Correct 251 ms 6392 KB Output is correct
19 Correct 258 ms 6756 KB Output is correct
20 Correct 237 ms 6244 KB Output is correct
21 Correct 278 ms 7268 KB Output is correct
22 Correct 248 ms 6628 KB Output is correct
23 Correct 271 ms 7140 KB Output is correct
24 Correct 221 ms 6628 KB Output is correct
25 Correct 263 ms 6116 KB Output is correct
26 Correct 267 ms 7652 KB Output is correct
27 Correct 273 ms 7140 KB Output is correct
28 Correct 274 ms 7268 KB Output is correct
29 Runtime error 2286 ms 262148 KB Execution killed with signal 9
30 Halted 0 ms 0 KB -