oj.uz

답안 #363985

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
363985 2021-02-07T19:42:31 Z NachoLibre The Kingdom of JOIOI (JOI17_joioi) C++17
100 / 100
 576 ms 16532 KB 
#include <bits/stdc++.h>
using namespace std;
#undef wambule
#define wambule
#define sz(a) ((int)a.size())
typedef vector<int> vint;
#ifndef wambule
#include ".h"
#else
#endif
 
const int N = 2003, M = N;
int n, m, a[N][M], ox, on = 1e9;
 
void X() {
	for(int i = 0; i < n; ++i) {
		for(int j = 0; j < m / 2; ++j) {
			swap(a[i][j], a[i][m - 1 - j]);
		}
	}
}
 
void Y() {
	for(int i = 0; i < n / 2; ++i) {
		for(int j = 0; j < m; ++j) {
			swap(a[i][j], a[n - 1 - i][j]);
		}
	}
}
 
bool C(int x) {
	int y = m;
	for(int i = 0; i < n; ++i) {
		for(int j = 0; j < y; ++j) {
			if(ox - x > a[i][j]) {
				y = j;
				break;
			}
		}
		for(int j = y; j < m; ++j) {
			if(on + x < a[i][j]) {
				return 0;
			}
		}
	}
	return 1;
}
 
int D() {
	int l = 0, r = ox - on;
	while(l < r) {
		int m = (l + r) / 2;
		if(C(m)) {
			r = m;
		} else {
			l = m + 1;
		}
	}
	return l;
}
 
#ifdef wambule
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
    cin >> n >> m;
    for(int i = 0; i < n; ++i) {
      for(int j = 0; j < m; ++j) {
        cin >> a[i][j];
        ox = max(ox, a[i][j]);
        on = min(on, a[i][j]);
      }
    }
    int fp = D();
    Y();
    fp = min(fp, D());
    X();
    fp = min(fp, D());
    Y();
    fp = min(fp, D());
    cout << fp << endl;
	return 0;
}
#endif

Subtask #1
15.0 / 15.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 3 ms 1388 KB Output is correct
17 Correct 5 ms 1516 KB Output is correct
18 Correct 6 ms 1516 KB Output is correct
19 Correct 6 ms 1516 KB Output is correct
20 Correct 5 ms 1388 KB Output is correct
21 Correct 8 ms 1516 KB Output is correct
22 Correct 7 ms 1516 KB Output is correct
23 Correct 7 ms 1516 KB Output is correct
24 Correct 7 ms 1516 KB Output is correct
25 Correct 10 ms 1524 KB Output is correct
26 Correct 10 ms 1516 KB Output is correct
27 Correct 10 ms 1516 KB Output is correct
28 Correct 9 ms 1516 KB Output is correct
29 Correct 357 ms 15596 KB Output is correct
30 Correct 373 ms 16300 KB Output is correct
31 Correct 390 ms 16264 KB Output is correct
32 Correct 391 ms 16364 KB Output is correct
33 Correct 347 ms 14220 KB Output is correct
34 Correct 380 ms 16492 KB Output is correct
35 Correct 576 ms 16532 KB Output is correct
36 Correct 525 ms 16236 KB Output is correct
37 Correct 558 ms 16364 KB Output is correct