oj.uz

Submission #61127

# Submission time Handle Problem Language Result Execution time Memory
61127 2018-07-25T08:29:53 Z gusfring The Kingdom of JOIOI (JOI17_joioi) C++14
60 / 100
 2489 ms 263168 KB 
#include <bits/stdc++.h>
using namespace std;
 
const int N = 2005;
 
int n, m, mn = 1e9, a[N][N], b[N][N], f[N];
 
bool check0(int x) {
	f[0] = 1e9;
	int _mn, _mx;
	_mn = 1e9, _mx = 0;
	for (int i = 1; i <= n; ++i) {
		int mx = 0; f[i] = 0;
		for (int j = 1; j <= m; ++j) {
			mx = max(mx, b[i][j]);
			if (mx - mn > x) break;
			f[i]++;
		}
		f[i] = min(f[i], f[i - 1]);
		for (int j = f[i] + 1; j <= m; ++j) {
			_mn = min(_mn, b[i][j]);
			_mx = max(_mx, b[i][j]);
		}
	}
	return _mx - _mn <= x;
}
 
bool check1(int x) {
	bool ok = 0;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			b[i][j] = a[i][j];
		}
	}
	ok |= check0(x);
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			b[i][j] = a[i][m - j + 1];
		}
	}
	ok |= check0(x);
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			b[i][j] = a[n - i + 1][j];
		}
	}
	ok |= check0(x);
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			b[i][j] = a[n - i + 1][m - j + 1];
		}
	}
	ok |= check0(x);
	return ok;
}
 
int main() {
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			scanf("%d", &a[i][j]); mn = min(mn, a[i][j]);
		}
	}
 
	int l = 0, r = 1e9;
	while (l < r) {
		int mid = (l + r) >> 1;
		if (check1(mid)) r = mid;
		else l = mid + 1;
	}
	cout << l;
}

Compilation message

joioi.cpp: In function 'int main()':
joioi.cpp:58:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~~
joioi.cpp:61:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &a[i][j]); mn = min(mn, a[i][j]);
    ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 4 ms 552 KB Output is correct
3 Correct 3 ms 552 KB Output is correct
4 Correct 3 ms 552 KB Output is correct
5 Correct 2 ms 552 KB Output is correct
6 Correct 3 ms 552 KB Output is correct
7 Correct 3 ms 552 KB Output is correct
8 Correct 2 ms 552 KB Output is correct
9 Correct 3 ms 552 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 3 ms 596 KB Output is correct
13 Correct 4 ms 596 KB Output is correct
14 Correct 2 ms 620 KB Output is correct
15 Correct 4 ms 620 KB Output is correct
16 Correct 20 ms 2416 KB Output is correct
17 Correct 29 ms 2524 KB Output is correct
18 Correct 25 ms 2524 KB Output is correct
19 Correct 24 ms 2524 KB Output is correct
20 Correct 19 ms 2524 KB Output is correct
21 Correct 31 ms 2524 KB Output is correct
22 Correct 24 ms 2524 KB Output is correct
23 Correct 23 ms 2524 KB Output is correct
24 Correct 31 ms 2524 KB Output is correct
25 Correct 21 ms 2524 KB Output is correct
26 Correct 25 ms 2524 KB Output is correct
27 Correct 26 ms 2524 KB Output is correct
28 Correct 25 ms 2640 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 4 ms 552 KB Output is correct
3 Correct 3 ms 552 KB Output is correct
4 Correct 3 ms 552 KB Output is correct
5 Correct 2 ms 552 KB Output is correct
6 Correct 3 ms 552 KB Output is correct
7 Correct 3 ms 552 KB Output is correct
8 Correct 2 ms 552 KB Output is correct
9 Correct 3 ms 552 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 3 ms 596 KB Output is correct
13 Correct 4 ms 596 KB Output is correct
14 Correct 2 ms 620 KB Output is correct
15 Correct 4 ms 620 KB Output is correct
16 Correct 20 ms 2416 KB Output is correct
17 Correct 29 ms 2524 KB Output is correct
18 Correct 25 ms 2524 KB Output is correct
19 Correct 24 ms 2524 KB Output is correct
20 Correct 19 ms 2524 KB Output is correct
21 Correct 31 ms 2524 KB Output is correct
22 Correct 24 ms 2524 KB Output is correct
23 Correct 23 ms 2524 KB Output is correct
24 Correct 31 ms 2524 KB Output is correct
25 Correct 21 ms 2524 KB Output is correct
26 Correct 25 ms 2524 KB Output is correct
27 Correct 26 ms 2524 KB Output is correct
28 Correct 25 ms 2640 KB Output is correct
29 Correct 1919 ms 50104 KB Output is correct
30 Correct 2130 ms 73440 KB Output is correct
31 Correct 2465 ms 96524 KB Output is correct
32 Correct 2347 ms 119632 KB Output is correct
33 Correct 1888 ms 135900 KB Output is correct
34 Correct 2233 ms 162908 KB Output is correct
35 Correct 2464 ms 201624 KB Output is correct
36 Correct 2331 ms 235092 KB Output is correct
37 Runtime error 2489 ms 263168 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.