oj.uz

Submission #770698

# Submission time Handle Problem Language Result Execution time Memory
770698 2023-07-01T18:09:43 Z raysh07 The Kingdom of JOIOI (JOI17_joioi) C++17
100 / 100
 1132 ms 32096 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

int n, m;
const int N = 2005;
vector<vector<int>> a;
int p[N];
int mx = 0;

bool ok(int x){
	for (int i = 0; i < n; i++){
		p[i] = m;
		for (int j = 0; j < m; j++){
			if (abs(mx - a[i][j]) <= x);
			else {
			    p[i] = j;
			    break;
			}
		}
	}

	for (int i = 1; i < n; i++){
		p[i] = min(p[i] , p[i - 1]);
	}

	int ma = 0, mi = INF;
	for (int i = 0; i < n; i++){
		for (int j = p[i]; j < m; j++){
			mi = min(mi, a[i][j]);
			ma = max(ma, a[i][j]);
		}
	}

	return (ma - mi) <= x;
}

bool check(int x){
	for (int i1 = 0; i1 < 2; i1++){
		for (int i = 0; i < n; i++){
			reverse(a[i].begin(), a[i].end());
		}

		for (int i2 = 0; i2 < 2; i2++){
			for (int i = 0; i < n; i++){
				if (n - 1 - i > i){
					swap(a[i], a[n - 1 - i]);
				}
			}

			if (ok(x)) return true;
		}
	}

	return false;
}

void Solve()
{
	cin >> n >> m;
	a.resize(n);
	for (int i = 1; i <= n; i++) a[i - 1].resize(m);

	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= m; j++){
			cin >> a[i - 1][j - 1], mx = max(mx, a[i - 1][j - 1]);
		}
	}

	int l = 0, r = 1e9;
	while (l != r){
		int mid = (l + r) / 2;

		if (check(mid)) r = mid;
		else l = mid + 1; 
	}

	cout << l << "\n";
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
  //  cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

Subtask #1
15.0 / 15.0

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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 596 KB Output is correct
17 Correct 7 ms 852 KB Output is correct
18 Correct 8 ms 916 KB Output is correct
19 Correct 8 ms 916 KB Output is correct
20 Correct 7 ms 852 KB Output is correct
21 Correct 14 ms 1036 KB Output is correct
22 Correct 10 ms 980 KB Output is correct
23 Correct 10 ms 980 KB Output is correct
24 Correct 9 ms 960 KB Output is correct
25 Correct 10 ms 1012 KB Output is correct
26 Correct 12 ms 980 KB Output is correct
27 Correct 11 ms 1012 KB Output is correct
28 Correct 10 ms 976 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 596 KB Output is correct
17 Correct 7 ms 852 KB Output is correct
18 Correct 8 ms 916 KB Output is correct
19 Correct 8 ms 916 KB Output is correct
20 Correct 7 ms 852 KB Output is correct
21 Correct 14 ms 1036 KB Output is correct
22 Correct 10 ms 980 KB Output is correct
23 Correct 10 ms 980 KB Output is correct
24 Correct 9 ms 960 KB Output is correct
25 Correct 10 ms 1012 KB Output is correct
26 Correct 12 ms 980 KB Output is correct
27 Correct 11 ms 1012 KB Output is correct
28 Correct 10 ms 976 KB Output is correct
29 Correct 766 ms 30316 KB Output is correct
30 Correct 739 ms 29616 KB Output is correct
31 Correct 806 ms 31912 KB Output is correct
32 Correct 811 ms 31900 KB Output is correct
33 Correct 676 ms 27880 KB Output is correct
34 Correct 764 ms 31828 KB Output is correct
35 Correct 1132 ms 32092 KB Output is correct
36 Correct 1004 ms 28064 KB Output is correct
37 Correct 1114 ms 32096 KB Output is correct