oj.uz

답안 #103791

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
103791 2019-04-02T16:25:57 Z RockyB The Kingdom of JOIOI (JOI17_joioi) C++14
100 / 100
 895 ms 16120 KB 
/// In The Name Of God

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)2000 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n, m;
int a[N][N];

int mn = inf, mx = -inf;
bool check(int k) {
	int r = 0;
	rep(i, 1, n) {
		rep(j, 1, m) {
			if (!(a[i][j] <= mn + k)) r = max(r, j);
		}
		rep(j, 1, m) {
			if (!(a[i][j] >= mx - k)) {
				if (j <= r) return 0;
			}
		}
	}
	return 1;
}
int ans;
int solve() {
	int l = 0, r = ans - 1, res = ans;
	while (l <= r) {
		int mid = l + r >> 1;
		if (check(mid)) res = mid, r = mid - 1;
		else l = mid + 1;
	}
	return res;
}
void rows() {
	rep(i, 1, n / 2) {
		rep(j, 1, m) swap(a[i][j], a[n - i + 1][j]);
	}
}
void cols() {
	rep(i, 1, m / 2) {
		rep(j, 1, n) {
			swap(a[j][i], a[j][m - i + 1]);
		}
	}
}

int get_int() {
	char x = getchar();
	while (!isdigit(x)) x = getchar();
	int res = 0;
	while (isdigit(x)) res = res * 10 + x - '0', x = getchar();
	return res;
}
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	n = get_int(), m = get_int();
	rep(i, 1, n) rep(j, 1, m) {
		a[i][j] = get_int();
		mn = min(mn, a[i][j]);
		mx = max(mx, a[i][j]);
	}
	ans = mx - mn;
	ans = min(ans, solve());
	cols();
	ans = min(ans, solve());
	rows();
	ans = min(ans, solve());
	cols();
	ans = min(ans, solve());
	cout << ans;
	ioi
}

Compilation message

joioi.cpp: In function 'int solve()':
joioi.cpp:60:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid = l + r >> 1;
             ~~^~~

Subtask #1
15.0 / 15.0

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

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 1280 KB Output is correct
17 Correct 7 ms 1280 KB Output is correct
18 Correct 6 ms 1280 KB Output is correct
19 Correct 12 ms 1280 KB Output is correct
20 Correct 9 ms 1152 KB Output is correct
21 Correct 10 ms 1280 KB Output is correct
22 Correct 13 ms 1280 KB Output is correct
23 Correct 11 ms 1408 KB Output is correct
24 Correct 8 ms 1152 KB Output is correct
25 Correct 13 ms 1280 KB Output is correct
26 Correct 10 ms 1280 KB Output is correct
27 Correct 11 ms 1280 KB Output is correct
28 Correct 13 ms 1280 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 1280 KB Output is correct
17 Correct 7 ms 1280 KB Output is correct
18 Correct 6 ms 1280 KB Output is correct
19 Correct 12 ms 1280 KB Output is correct
20 Correct 9 ms 1152 KB Output is correct
21 Correct 10 ms 1280 KB Output is correct
22 Correct 13 ms 1280 KB Output is correct
23 Correct 11 ms 1408 KB Output is correct
24 Correct 8 ms 1152 KB Output is correct
25 Correct 13 ms 1280 KB Output is correct
26 Correct 10 ms 1280 KB Output is correct
27 Correct 11 ms 1280 KB Output is correct
28 Correct 13 ms 1280 KB Output is correct
29 Correct 349 ms 15316 KB Output is correct
30 Correct 398 ms 16120 KB Output is correct
31 Correct 537 ms 16084 KB Output is correct
32 Correct 422 ms 15964 KB Output is correct
33 Correct 288 ms 14072 KB Output is correct
34 Correct 538 ms 16120 KB Output is correct
35 Correct 652 ms 15992 KB Output is correct
36 Correct 454 ms 16120 KB Output is correct
37 Correct 895 ms 16120 KB Output is correct