oj.uz

Submission #372838

# Submission time Handle Problem Language Result Execution time Memory
372838 2021-03-01T23:31:27 Z AmineWeslati The Kingdom of JOIOI (JOI17_joioi) C++14
60 / 100
 4000 ms 133512 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 = 1e9;
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[4],gg;

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

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

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


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

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

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

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

bool check(int K){
	FOR(i,0,4){
		if(solve(i,K)) return 1;
	}
	return 0;
}

void precompute(){
	FOR(i,0,4){
		g[i].resize(sz(gg));
		FOR(r,0,sz(gg)){
			g[i][r].assign(all(gg[r]));
		}

		rotate();
	}
}

int main() {
    boost; IO();

    cin>>N>>M;

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

	precompute();

	int l=0,r=mx-mn,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

Compilation message

joioi.cpp: In function 'int main()':
joioi.cpp:19:14: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   19 | #define endl "\n"
      |              ^~~~
joioi.cpp:136:18: note: 'ans' was declared here
  136 |  int l=0,r=mx-mn,ans;
      |                  ^~~

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 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 0 ms 364 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 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 1244 KB Output is correct
17 Correct 13 ms 1316 KB Output is correct
18 Correct 9 ms 1256 KB Output is correct
19 Correct 10 ms 1316 KB Output is correct
20 Correct 8 ms 1256 KB Output is correct
21 Correct 13 ms 1316 KB Output is correct
22 Correct 13 ms 1364 KB Output is correct
23 Correct 11 ms 1316 KB Output is correct
24 Correct 10 ms 1256 KB Output is correct
25 Correct 10 ms 1316 KB Output is correct
26 Correct 17 ms 1316 KB Output is correct
27 Correct 17 ms 1316 KB Output is correct
28 Correct 13 ms 1316 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 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 1244 KB Output is correct
17 Correct 13 ms 1316 KB Output is correct
18 Correct 9 ms 1256 KB Output is correct
19 Correct 10 ms 1316 KB Output is correct
20 Correct 8 ms 1256 KB Output is correct
21 Correct 13 ms 1316 KB Output is correct
22 Correct 13 ms 1364 KB Output is correct
23 Correct 11 ms 1316 KB Output is correct
24 Correct 10 ms 1256 KB Output is correct
25 Correct 10 ms 1316 KB Output is correct
26 Correct 17 ms 1316 KB Output is correct
27 Correct 17 ms 1316 KB Output is correct
28 Correct 13 ms 1316 KB Output is correct
29 Correct 2980 ms 90820 KB Output is correct
30 Correct 3207 ms 110560 KB Output is correct
31 Correct 3386 ms 118128 KB Output is correct
32 Correct 3779 ms 118080 KB Output is correct
33 Correct 2577 ms 104368 KB Output is correct
34 Correct 3789 ms 118380 KB Output is correct
35 Execution timed out 4045 ms 133512 KB Time limit exceeded
36 Halted 0 ms 0 KB -