oj.uz

Submission #20912

# Submission time Handle Problem Language Result Execution time Memory
20912 2017-03-19T15:20:36 Z model_code The Kingdom of JOIOI (JOI17_joioi) C++11
100 / 100
 1373 ms 17056 KB 
#include <cstdio>
#include <algorithm>
using namespace std;

int H, W, A[2020][2020];
int gmin, gmax;

bool check(int th)
{
	int sep = 0;
	for (int i = 0; i < H; ++i) {
		for (int j = 0; j < W; ++j) {
			if (A[i][j] < gmax - th) {
				sep = max(sep, j + 1);
			}
		}
		for (int j = 0; j < W; ++j) {
			if (gmin + th < A[i][j]) {
				if (j < sep) return false;
			}
		}
	}
	return true;
}
void flip_row()
{
	for (int i = 0; i < H / 2; ++i) {
		for (int j = 0; j < W; ++j) {
			swap(A[i][j], A[H - 1 - i][j]);
		}
	}
}
void flip_col()
{
	for (int i = 0; i < H; ++i) {
		for (int j = 0; j < W / 2; ++j) {
			swap(A[i][j], A[i][W - 1 - j]);
		}
	}
}
int solve()
{
	int lo = 0, hi = gmax - gmin;
	while (lo < hi) {
		int mid = (lo + hi) / 2;
		if (check(mid)) {
			hi = mid;
		} else {
			lo = mid + 1;
		}
	}
	return lo;
}
int main()
{
	scanf("%d%d", &H, &W);
	for (int i = 0; i < H; ++i) {
		for (int j = 0; j < W; ++j) {
			scanf("%d", &(A[i][j]));
		}
	}

	gmin = gmax = A[0][0];
	for (int i = 0; i < H; ++i) {
		for (int j = 0; j < W; ++j) {
			gmin = min(gmin, A[i][j]);
			gmax = max(gmax, A[i][j]);
		}
	}

	int ret = solve();
	flip_row();
	ret = min(ret, solve());
	flip_col();
	ret = min(ret, solve());
	flip_row();
	ret = min(ret, solve());
	printf("%d\n", ret);
	return 0;
}

Compilation message

joioi.cpp: In function 'int main()':
joioi.cpp:56:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &H, &W);
                       ^
joioi.cpp:59:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &(A[i][j]));
                           ^

Subtask #1
15.0 / 15.0

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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17056 KB Output is correct
2 Correct 0 ms 17056 KB Output is correct
3 Correct 0 ms 17056 KB Output is correct
4 Correct 0 ms 17056 KB Output is correct
5 Correct 0 ms 17056 KB Output is correct
6 Correct 0 ms 17056 KB Output is correct
7 Correct 0 ms 17056 KB Output is correct
8 Correct 0 ms 17056 KB Output is correct
9 Correct 0 ms 17056 KB Output is correct
10 Correct 0 ms 17056 KB Output is correct
11 Correct 0 ms 17056 KB Output is correct
12 Correct 0 ms 17056 KB Output is correct
13 Correct 0 ms 17056 KB Output is correct
14 Correct 0 ms 17056 KB Output is correct
15 Correct 0 ms 17056 KB Output is correct
16 Correct 6 ms 17056 KB Output is correct
17 Correct 0 ms 17056 KB Output is correct
18 Correct 9 ms 17056 KB Output is correct
19 Correct 6 ms 17056 KB Output is correct
20 Correct 6 ms 17056 KB Output is correct
21 Correct 13 ms 17056 KB Output is correct
22 Correct 9 ms 17056 KB Output is correct
23 Correct 13 ms 17056 KB Output is correct
24 Correct 9 ms 17056 KB Output is correct
25 Correct 19 ms 17056 KB Output is correct
26 Correct 9 ms 17056 KB Output is correct
27 Correct 13 ms 17056 KB Output is correct
28 Correct 9 ms 17056 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17056 KB Output is correct
2 Correct 0 ms 17056 KB Output is correct
3 Correct 0 ms 17056 KB Output is correct
4 Correct 0 ms 17056 KB Output is correct
5 Correct 0 ms 17056 KB Output is correct
6 Correct 0 ms 17056 KB Output is correct
7 Correct 0 ms 17056 KB Output is correct
8 Correct 0 ms 17056 KB Output is correct
9 Correct 0 ms 17056 KB Output is correct
10 Correct 0 ms 17056 KB Output is correct
11 Correct 0 ms 17056 KB Output is correct
12 Correct 0 ms 17056 KB Output is correct
13 Correct 0 ms 17056 KB Output is correct
14 Correct 0 ms 17056 KB Output is correct
15 Correct 0 ms 17056 KB Output is correct
16 Correct 6 ms 17056 KB Output is correct
17 Correct 0 ms 17056 KB Output is correct
18 Correct 9 ms 17056 KB Output is correct
19 Correct 6 ms 17056 KB Output is correct
20 Correct 6 ms 17056 KB Output is correct
21 Correct 13 ms 17056 KB Output is correct
22 Correct 9 ms 17056 KB Output is correct
23 Correct 13 ms 17056 KB Output is correct
24 Correct 9 ms 17056 KB Output is correct
25 Correct 19 ms 17056 KB Output is correct
26 Correct 9 ms 17056 KB Output is correct
27 Correct 13 ms 17056 KB Output is correct
28 Correct 9 ms 17056 KB Output is correct
29 Correct 623 ms 17056 KB Output is correct
30 Correct 663 ms 17056 KB Output is correct
31 Correct 836 ms 17056 KB Output is correct
32 Correct 616 ms 17056 KB Output is correct
33 Correct 509 ms 17056 KB Output is correct
34 Correct 726 ms 17056 KB Output is correct
35 Correct 1089 ms 17056 KB Output is correct
36 Correct 933 ms 17056 KB Output is correct
37 Correct 1373 ms 17056 KB Output is correct