제출 #363985

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
363985		NachoLibre	The Kingdom of JOIOI (JOI17_joioi)	C++17	100 / 100	576 ms	16532 KiB

joioi

#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 / 15
• Subtask 2: 45 / 45
• Subtask 3: 40 / 40