oj.uz

답안 #684210

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
684210 2023-01-20T16:31:44 Z ethening The Kingdom of JOIOI (JOI17_joioi) C++17
100 / 100
 2443 ms 117728 KB 
#include "bits/stdc++.h"
#include <climits>
using namespace std;
using ll = long long;

int h, w;
int a[2005][2005];
int minv, maxv;

int t[2005][2005];
int t2[2005][2005];
int t3[2005][2005];
int t4[2005][2005];

// int t1[3][2005][2005];
// int t2[3][2005][2005];
// int t3[3][2005][2005];
// int t4[3][2005][2005];

bool check(int thr) {
	// cout << "!!" << thr << endl;
	for (int i = 1; i <= h; i++) {
		for (int j = 1; j <= w; j++) {
			t[i][j] = 0;
			if (a[i][j] <= minv + thr) {
				t[i][j] += 1;
			}
			if (a[i][j] >= maxv - thr) {
				t[i][j] += 2;
			}
			// cout << i << " " << j << " " << t[i][j] << endl;
			if (t[i][j] == 0) return false;
			t2[w - j + 1][i] = t[i][j];
			t3[h - i + 1][w - j + 1] = t[i][j];
			t4[j][h - i + 1] = t[i][j];
		}
	}
	
	bool flag1 = 1, flag2 = 1, flag3 = 1, flag4 = 1;
	{
		int small_right_most = 0;
		int big_left_most = w + 1;
		for (int i = 1; i <= h && flag1 == 1; i++) {
			int cur_small_right_most = 0;
			int cur_big_left_most = w + 1;
			for (int j = 1; j <= w; j++) {
				if (t[i][j] == 1) {
					cur_small_right_most = max(cur_small_right_most, j);
				}
				if (t[i][j] == 2) {
					cur_big_left_most = min(cur_big_left_most, j);
				}
			}
			if (cur_small_right_most >= cur_big_left_most) {
				flag1 = 0;
				break;
			}
			if (small_right_most >= cur_big_left_most) {
				flag1 = 0;
				break;
			}
			small_right_most = max(small_right_most, cur_small_right_most);
			big_left_most = cur_big_left_most;
		}
	}
	{
		int small_right_most = 0;
		int big_left_most = w + 1;
		for (int i = 1; i <= h && flag3 == 1; i++) {
			int cur_small_right_most = 0;
			int cur_big_left_most = w + 1;
			for (int j = 1; j <= w; j++) {
				if (t3[i][j] == 1) {
					cur_small_right_most = max(cur_small_right_most, j);
				}
				if (t3[i][j] == 2) {
					cur_big_left_most = min(cur_big_left_most, j);
				}
			}
			if (cur_small_right_most >= cur_big_left_most) {
				flag3 = 0;
				break;
			}
			if (small_right_most >= cur_big_left_most) {
				flag3 = 0;
				break;
			}
			small_right_most = max(small_right_most, cur_small_right_most);
			big_left_most = cur_big_left_most;
		}
	}
	{
		int small_right_most = 0;
		int big_left_most = h + 1;
		for (int i = 1; i <= w && flag2 == 1; i++) {
			int cur_small_right_most = 0;
			int cur_big_left_most = h + 1;
			for (int j = 1; j <= h; j++) {
				if (t2[i][j] == 1) {
					cur_small_right_most = max(cur_small_right_most, j);
				}
				if (t2[i][j] == 2) {
					cur_big_left_most = min(cur_big_left_most, j);
				}
			}
			if (cur_small_right_most >= cur_big_left_most) {
				flag2 = 0;
				break;
			}
			if (small_right_most >= cur_big_left_most) {
				flag2 = 0;
				break;
			}
			small_right_most = max(small_right_most, cur_small_right_most);
			big_left_most = cur_big_left_most;
		}
	}
	{
		int small_right_most = 0;
		int big_left_most = h + 1;
		for (int i = 1; i <= w && flag4 == 1; i++) {
			int cur_small_right_most = 0;
			int cur_big_left_most = h + 1;
			for (int j = 1; j <= h; j++) {
				if (t4[i][j] == 1) {
					cur_small_right_most = max(cur_small_right_most, j);
				}
				if (t4[i][j] == 2) {
					cur_big_left_most = min(cur_big_left_most, j);
				}
			}
			if (cur_small_right_most >= cur_big_left_most) {
				flag4 = 0;
				break;
			}
			if (small_right_most >= cur_big_left_most) {
				flag4 = 0;
				break;
			}
			small_right_most = max(small_right_most, cur_small_right_most);
			big_left_most = cur_big_left_most;
		}
	}
	return flag1 || flag2 || flag3 || flag4;
}


int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	cin >> h >> w;
	minv = INT_MAX;
	maxv = INT_MIN;
	for (int i = 1; i <= h; i++) {
		for (int j = 1; j <= w; j++) {
			cin >> a[i][j];
			minv = min(minv, a[i][j]);
			maxv = max(maxv, a[i][j]);
		}
	}

	if (minv == maxv) {
		cout << 0 << endl;
		return 0;
	}
	int l = 0, r = maxv - minv;
	while (l <= r) {
		int d = (l + r) / 2;
		if (check(d)) {
			r = d - 1;
		}
		else {
			l = d + 1;
		}
	}
	cout << l << endl;
}

Compilation message

joioi.cpp: In function 'bool check(int)':
joioi.cpp:42:7: warning: variable 'big_left_most' set but not used [-Wunused-but-set-variable]
   42 |   int big_left_most = w + 1;
      |       ^~~~~~~~~~~~~
joioi.cpp:68:7: warning: variable 'big_left_most' set but not used [-Wunused-but-set-variable]
   68 |   int big_left_most = w + 1;
      |       ^~~~~~~~~~~~~
joioi.cpp:94:7: warning: variable 'big_left_most' set but not used [-Wunused-but-set-variable]
   94 |   int big_left_most = h + 1;
      |       ^~~~~~~~~~~~~
joioi.cpp:120:7: warning: variable 'big_left_most' set but not used [-Wunused-but-set-variable]
  120 |   int big_left_most = h + 1;
      |       ^~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 0 ms 468 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 1 ms 2004 KB Output is correct
16 Correct 5 ms 4948 KB Output is correct
17 Correct 8 ms 5076 KB Output is correct
18 Correct 6 ms 5044 KB Output is correct
19 Correct 10 ms 5140 KB Output is correct
20 Correct 11 ms 4772 KB Output is correct
21 Correct 12 ms 5076 KB Output is correct
22 Correct 7 ms 5076 KB Output is correct
23 Correct 13 ms 5076 KB Output is correct
24 Correct 6 ms 4692 KB Output is correct
25 Correct 17 ms 5144 KB Output is correct
26 Correct 10 ms 5144 KB Output is correct
27 Correct 11 ms 5076 KB Output is correct
28 Correct 11 ms 5076 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 1 ms 2004 KB Output is correct
16 Correct 5 ms 4948 KB Output is correct
17 Correct 8 ms 5076 KB Output is correct
18 Correct 6 ms 5044 KB Output is correct
19 Correct 10 ms 5140 KB Output is correct
20 Correct 11 ms 4772 KB Output is correct
21 Correct 12 ms 5076 KB Output is correct
22 Correct 7 ms 5076 KB Output is correct
23 Correct 13 ms 5076 KB Output is correct
24 Correct 6 ms 4692 KB Output is correct
25 Correct 17 ms 5144 KB Output is correct
26 Correct 10 ms 5144 KB Output is correct
27 Correct 11 ms 5076 KB Output is correct
28 Correct 11 ms 5076 KB Output is correct
29 Correct 1262 ms 76452 KB Output is correct
30 Correct 1250 ms 76516 KB Output is correct
31 Correct 1455 ms 78812 KB Output is correct
32 Correct 1324 ms 78800 KB Output is correct
33 Correct 600 ms 72780 KB Output is correct
34 Correct 1392 ms 78904 KB Output is correct
35 Correct 2211 ms 78912 KB Output is correct
36 Correct 1300 ms 108320 KB Output is correct
37 Correct 2443 ms 117728 KB Output is correct