oj.uz

Submission #1003762

# Submission time Handle Problem Language Result Execution time Memory
1003762 2024-06-20T16:54:38 Z vako_p The Kingdom of JOIOI (JOI17_joioi) C++14
100 / 100
 2812 ms 137216 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back

const int mxN = 2e3 + 5;
ll n,m,a[mxN][mxN],b[mxN][mxN],x,y,p[mxN][mxN];
bool vis[mxN][mxN];

bool turn(ll mid){
	swap(x, y);
	y = n - y + 1;
	for(int j = 1; j <= m; j++){
		for(int i = n; i >= 1; i--){
			b[j][n - i + 1] = a[i][j];
		}
	}
	swap(n, m);
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			a[i][j] = b[i][j];
			p[i][j] = max(p[i - 1][j], p[i][j - 1]);
			p[i][j] = max(p[i][j], a[i][j]);
			vis[i][j] = false;
		}
	}
	if(p[x][y] - a[x][y] > mid) return false;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			if(p[i][j] - a[x][y] > mid) break;
			vis[i][j] = true;
		}
	}
	ll mn = 1e17, mx = 0;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			if(vis[i][j]) continue;
			mx = max(mx, a[i][j]);
			mn = min(mn, a[i][j]);
		}
	}
	return (mx - mn <= mid);
}

bool ok(ll mid){
	return (turn(mid) or turn(mid) or turn(mid) or turn(mid));
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	ll mn = 1e17;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			cin >> a[i][j];
			if(mn > a[i][j]){
				x = i;
				y = j;
				mn = a[i][j];
			}
		}
	}
	ll l = 0, r = 1e9;
	while(r > l + 1){
		ll mid = l + (r - l) / 2;
		if(ok(mid)) r = mid;
		else l = mid;
	}
	cout << r;
}

Subtask #1
15.0 / 15.0

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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 2 ms 3160 KB Output is correct
16 Correct 7 ms 4188 KB Output is correct
17 Correct 12 ms 4700 KB Output is correct
18 Correct 12 ms 4444 KB Output is correct
19 Correct 12 ms 4504 KB Output is correct
20 Correct 11 ms 4456 KB Output is correct
21 Correct 16 ms 4444 KB Output is correct
22 Correct 19 ms 4616 KB Output is correct
23 Correct 14 ms 4444 KB Output is correct
24 Correct 13 ms 4564 KB Output is correct
25 Correct 15 ms 4616 KB Output is correct
26 Correct 14 ms 4444 KB Output is correct
27 Correct 16 ms 4444 KB Output is correct
28 Correct 14 ms 4616 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 2 ms 3160 KB Output is correct
16 Correct 7 ms 4188 KB Output is correct
17 Correct 12 ms 4700 KB Output is correct
18 Correct 12 ms 4444 KB Output is correct
19 Correct 12 ms 4504 KB Output is correct
20 Correct 11 ms 4456 KB Output is correct
21 Correct 16 ms 4444 KB Output is correct
22 Correct 19 ms 4616 KB Output is correct
23 Correct 14 ms 4444 KB Output is correct
24 Correct 13 ms 4564 KB Output is correct
25 Correct 15 ms 4616 KB Output is correct
26 Correct 14 ms 4444 KB Output is correct
27 Correct 16 ms 4444 KB Output is correct
28 Correct 14 ms 4616 KB Output is correct
29 Correct 1899 ms 120584 KB Output is correct
30 Correct 1887 ms 119892 KB Output is correct
31 Correct 2051 ms 121424 KB Output is correct
32 Correct 1906 ms 121596 KB Output is correct
33 Correct 1753 ms 117808 KB Output is correct
34 Correct 1969 ms 121708 KB Output is correct
35 Correct 2708 ms 137212 KB Output is correct
36 Correct 2478 ms 131428 KB Output is correct
37 Correct 2812 ms 137216 KB Output is correct