This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define Lg(x) 31 - __builtin_clz(x)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e3 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void setupIO(){
#define name "Whisper"
//Phu Trong from Nguyen Tat Thanh High School for gifted student
srand(time(NULL));
cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
//freopen(name".inp", "r", stdin);
//freopen(name".out", "w", stdout);
cout << fixed << setprecision(10);
}
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
int nCol, nRow;
int a[MAX][MAX], b[MAX][MAX];
void print(){
FOR(i, 1, nRow) FOR(j, 1, nCol) cout << a[i][j] << " \n"[j == nCol];
}
void rot(){
//table rotation
for (int i = 1; i <= nRow; ++i){
for (int j = 1; j <= nCol; ++j){
b[j][nRow + 1 - i] = a[i][j];
}
}
swap(nRow, nCol);
FOR(i, 1, nRow) FOR(j, 1, nCol) a[i][j] = b[i][j];
}
int mn = INF;
void Whisper(){
cin >> nRow >> nCol;
FOR(i, 1, nRow) FOR(j, 1, nCol){
cin >> a[i][j]; minimize(mn, a[i][j]);
}
int l = 0, r = 1e9;
int ans = -1;
//
auto check = [&](int v){
for (int dir = 0; dir < 4; ++dir){
int lst = nCol, mnVal = INF, mxVal = 0;
for (int i = 1; i <= nRow; ++i){
for (int j = 1; j <= lst; ++j){
if (a[i][j] - mn > v){
lst = j - 1; break;
}
}
for (int j = lst + 1; j <= nCol; ++j){
maximize(mxVal, a[i][j]);
minimize(mnVal, a[i][j]);
}
}
if(mxVal - mnVal <= v) return 1;
if (dir < 3) rot();
}
return 0;
};
while (l <= r){
int mid = (l + r) >> 1;
if (check(mid)) r = mid - 1, ans = mid;
else l = mid + 1;
}
cout << ans;
}
signed main(){
setupIO();
int Test = 1;
// cin >> Test;
for ( int i = 1 ; i <= Test ; i++ ){
Whisper();
if (i < Test) cout << '\n';
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |