oj.uz

Submission #467933

# Submission time Handle Problem Language Result Execution time Memory
467933 2021-08-25T16:01:51 Z wind_reaper The Kingdom of JOIOI (JOI17_joioi) C++17
100 / 100
 2070 ms 54852 KB 
#include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
*/

using namespace std;
// using namespace __gnu_pbds;
using namespace chrono;

// mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
/*
template <class T> using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
*/

//***************** CONSTANTS *****************

const int NAX = 2000;

//***************** GLOBAL VARIABLES *****************

int grid[NAX][NAX], temp[NAX][NAX];
int H, W;
int mxv = 0, mnv = 1'000'000'000;

//***************** AUXILIARY STRUCTS *****************



//***************** MAIN BODY *****************

void solve(){
	cin >> H >> W;
	for(int i = 0; i < H; i++)
		for(int j = 0; j < W; j++){
			cin >> grid[i][j];
			mxv = max(mxv, grid[i][j]);
			mnv = min(mnv, grid[i][j]);
		}

	function<void()> vert = [](){
		for(int i = 0; i < H; i++)
			for(int j = 0; j < W; j++)
				temp[H - i - 1][j] = grid[i][j];

		for(int i = 0; i < H; i++)
			for(int j = 0; j < W; j++)
				grid[i][j] = temp[i][j];
	};

	function<void()> hor = [](){
		for(int i = 0; i < H; i++)
			for(int j = 0; j < W; j++)
				temp[i][W - j - 1] = grid[i][j];

		for(int i = 0; i < H; i++)
			for(int j = 0; j < W; j++)
				grid[i][j] = temp[i][j];
	};

	function<bool(int)> check = [](int mid)->bool{
		int cur = H - 1;
		for(int j = 0; j < W; j++){
			for(int i = 0; i <= cur; i++)
				if(mxv - grid[i][j] > mid){
					cur = i - 1;
					break;
				}

			for(int i = cur + 1; i < H; i++){
				if(grid[i][j] - mnv > mid)
					return false;
			}
		}

		return true;
	};

	function<int()> find = [&]()->int{
		int lo = 0, hi = mxv - mnv + 1, ans = mxv - mnv + 1;
		while(lo <= hi){
			int mid = (lo + hi) >> 1;
			if(check(mid))
				ans = mid, hi = mid - 1;
			else lo = mid + 1;
		}
		return ans;
	};

	int ans = find();
	hor();
	ans = min(ans, find());
	vert();
	ans = min(ans, find());
	hor();
	ans = min(ans, find());

	cout << ans << '\n';
}

//***************** *****************

int32_t main(){
	ios_base::sync_with_stdio(NULL);
	cin.tie(NULL);

	#ifdef LOCAL
		auto begin = high_resolution_clock::now();
	#endif

	int tc = 1;
	// cin >> tc; 
	for (int t = 0; t < tc; t++)
		solve();

	#ifdef LOCAL 
		auto end = high_resolution_clock::now();
		cout << fixed << setprecision(4);
		cout << "Execution Time: " << duration_cast<duration<double>>(end - begin).count() << "seconds" << endl;
	#endif

	return 0;
}

/*
If code gives a WA, check for the following : 
1. I/O format

2. Are you clearing all global variables in between tests if multitests are a thing

3. Can you definitively prove the logic

4. If the code gives an inexplicable TLE, and you are sure you have the best possible complexity,
use faster io
*/

Subtask #1
15.0 / 15.0

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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 4 ms 2252 KB Output is correct
17 Correct 7 ms 2380 KB Output is correct
18 Correct 7 ms 2388 KB Output is correct
19 Correct 7 ms 2380 KB Output is correct
20 Correct 6 ms 2124 KB Output is correct
21 Correct 9 ms 2508 KB Output is correct
22 Correct 8 ms 2560 KB Output is correct
23 Correct 11 ms 2616 KB Output is correct
24 Correct 8 ms 2252 KB Output is correct
25 Correct 9 ms 2508 KB Output is correct
26 Correct 9 ms 2512 KB Output is correct
27 Correct 9 ms 2572 KB Output is correct
28 Correct 9 ms 2512 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 4 ms 2252 KB Output is correct
17 Correct 7 ms 2380 KB Output is correct
18 Correct 7 ms 2388 KB Output is correct
19 Correct 7 ms 2380 KB Output is correct
20 Correct 6 ms 2124 KB Output is correct
21 Correct 9 ms 2508 KB Output is correct
22 Correct 8 ms 2560 KB Output is correct
23 Correct 11 ms 2616 KB Output is correct
24 Correct 8 ms 2252 KB Output is correct
25 Correct 9 ms 2508 KB Output is correct
26 Correct 9 ms 2512 KB Output is correct
27 Correct 9 ms 2572 KB Output is correct
28 Correct 9 ms 2512 KB Output is correct
29 Correct 743 ms 52136 KB Output is correct
30 Correct 685 ms 52984 KB Output is correct
31 Correct 764 ms 54852 KB Output is correct
32 Correct 716 ms 54692 KB Output is correct
33 Correct 623 ms 47968 KB Output is correct
34 Correct 752 ms 54852 KB Output is correct
35 Correct 1745 ms 50928 KB Output is correct
36 Correct 1673 ms 48580 KB Output is correct
37 Correct 2070 ms 51144 KB Output is correct