// Om Namah Shivaya
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 2e3 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
ll n,m;
ll a[N][N];
ll ans = inf2;
vector<ll> lens;
void go(ll i, ll prev_len, ll mnl, ll mxl, ll mnr, ll mxr){
if(i > n){
ll val = max(mxl-mnl, mxr-mnr);
amin(ans,val);
// if(val == 19){
// debug(lens);
// }
return;
}
rep(j,m+1){
if(j < prev_len) conts;
ll mn1 = inf2, mx1 = -inf2;
ll mn2 = inf2, mx2 = -inf2;
rep1(k,m){
if(k <= j){
amin(mn1,a[i][k]);
amax(mx1,a[i][k]);
}
else{
amin(mn2,a[i][k]);
amax(mx2,a[i][k]);
}
}
lens.pb(j);
go(i+1, j, min(mnl,mn1), max(mxl,mx1), min(mnr,mn2), max(mxr,mx2));
lens.pop_back();
}
}
void solve(int test_case)
{
cin >> n >> m;
rep1(i,n) rep1(j,m) cin >> a[i][j];
// go(1,0,inf2,-inf2,inf2,-inf2);
// debug(ans);
// return;
vector<ll> b;
rep1(i,n){
rep1(j,m){
b.pb(a[i][j]);
}
}
sort(all(b));
b.resize(unique(all(b))-b.begin());
ll ans = inf2;
trav(mn,b){
trav(mx,b){
if(mn > mx) conts;
// dec
{
ll prev_len = inf2;
ll other_mn = inf2, other_mx = -inf2;
rep1(i,n){
ll len = 0;
rep1(j,m){
if(a[i][j] >= mn and a[i][j] <= mx){
len++;
}
else{
break;
}
}
amin(len,prev_len);
prev_len = len;
for(int j = len+1; j <= m; ++j){
amin(other_mn, a[i][j]);
amax(other_mx, a[i][j]);
}
}
ll val = max(mx-mn, other_mx-other_mn);
amin(ans,val);
}
// inc
{
ll prev_len = inf2;
ll other_mn = inf2, other_mx = -inf2;
rev(i,n,1){
ll len = 0;
rep1(j,m){
if(a[i][j] >= mn and a[i][j] <= mx){
len++;
}
else{
break;
}
}
amin(len,prev_len);
prev_len = len;
for(int j = len+1; j <= m; ++j){
amin(other_mn, a[i][j]);
amax(other_mx, a[i][j]);
}
}
ll val = max(mx-mn, other_mx-other_mn);
amin(ans,val);
}
}
}
cout << ans << endl;
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
0 ms |
336 KB |
Output is correct |
| 3 |
Correct |
2 ms |
332 KB |
Output is correct |
| 4 |
Correct |
1 ms |
328 KB |
Output is correct |
| 5 |
Correct |
2 ms |
340 KB |
Output is correct |
| 6 |
Correct |
1 ms |
340 KB |
Output is correct |
| 7 |
Correct |
2 ms |
340 KB |
Output is correct |
| 8 |
Correct |
2 ms |
332 KB |
Output is correct |
| 9 |
Correct |
2 ms |
328 KB |
Output is correct |
| 10 |
Correct |
2 ms |
340 KB |
Output is correct |
| 11 |
Correct |
2 ms |
340 KB |
Output is correct |
| 12 |
Correct |
2 ms |
340 KB |
Output is correct |
| 13 |
Correct |
2 ms |
340 KB |
Output is correct |
| 14 |
Correct |
2 ms |
336 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
0 ms |
336 KB |
Output is correct |
| 3 |
Correct |
2 ms |
332 KB |
Output is correct |
| 4 |
Correct |
1 ms |
328 KB |
Output is correct |
| 5 |
Correct |
2 ms |
340 KB |
Output is correct |
| 6 |
Correct |
1 ms |
340 KB |
Output is correct |
| 7 |
Correct |
2 ms |
340 KB |
Output is correct |
| 8 |
Correct |
2 ms |
332 KB |
Output is correct |
| 9 |
Correct |
2 ms |
328 KB |
Output is correct |
| 10 |
Correct |
2 ms |
340 KB |
Output is correct |
| 11 |
Correct |
2 ms |
340 KB |
Output is correct |
| 12 |
Correct |
2 ms |
340 KB |
Output is correct |
| 13 |
Correct |
2 ms |
340 KB |
Output is correct |
| 14 |
Correct |
2 ms |
336 KB |
Output is correct |
| 15 |
Correct |
1 ms |
340 KB |
Output is correct |
| 16 |
Correct |
8 ms |
2136 KB |
Output is correct |
| 17 |
Execution timed out |
4050 ms |
2268 KB |
Time limit exceeded |
| 18 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
0 ms |
336 KB |
Output is correct |
| 3 |
Correct |
2 ms |
332 KB |
Output is correct |
| 4 |
Correct |
1 ms |
328 KB |
Output is correct |
| 5 |
Correct |
2 ms |
340 KB |
Output is correct |
| 6 |
Correct |
1 ms |
340 KB |
Output is correct |
| 7 |
Correct |
2 ms |
340 KB |
Output is correct |
| 8 |
Correct |
2 ms |
332 KB |
Output is correct |
| 9 |
Correct |
2 ms |
328 KB |
Output is correct |
| 10 |
Correct |
2 ms |
340 KB |
Output is correct |
| 11 |
Correct |
2 ms |
340 KB |
Output is correct |
| 12 |
Correct |
2 ms |
340 KB |
Output is correct |
| 13 |
Correct |
2 ms |
340 KB |
Output is correct |
| 14 |
Correct |
2 ms |
336 KB |
Output is correct |
| 15 |
Correct |
1 ms |
340 KB |
Output is correct |
| 16 |
Correct |
8 ms |
2136 KB |
Output is correct |
| 17 |
Execution timed out |
4050 ms |
2268 KB |
Time limit exceeded |
| 18 |
Halted |
0 ms |
0 KB |
- |
