Submission #718532

#	Time	Username	Problem	Language	Result	Execution time	Memory
718532		arush_agu	The Kingdom of JOIOI (JOI17_joioi)	C++17	100 / 100	1531 ms	195808 KiB

joioi

#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
                                    !is_same<T_container, string>::value,
                                    typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
  os << '{';
  string sep;
  for (const T &x : v)
    os << sep << x, sep = ", ";
  return os << '}';
}

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9 + 10;
const ld EPS = 1e-9;

// Saw Solution

ll a[4][2001][2001], b[2001][2001];

void solve() {
  ll n, m;
  cin >> n >> m;
  ll mn = INF;
  for (ll i = 1; i <= n; i++) {
    for (ll j = 1; j <= m; j++) {
      cin >> a[0][i][j];
      mn = min(mn, a[0][i][j]);
    }
  }
  for (ll i = 1; i <= n; i++) {
    for (ll j = 1; j <= m; j++)
      a[0][i][j] -= mn;
  }
  ll x = 1, y = 1;
  for (ll j = m; j >= 1; j--) {
    y = 1;
    for (ll i = 1; i <= n; i++) {
      a[1][x][y] = a[0][i][j];
      y++;
    }
    x++;
  }
  x = 1;
  for (ll i = n; i >= 1; i--) {
    y = 1;
    for (ll j = m; j >= 1; j--)
      a[2][x][y] = a[0][i][j], y++;
    x++;
  }
  x = 1;
  for (ll j = 1; j <= m; j++) {
    y = 1;
    for (ll i = n; i >= 1; i--)
      a[3][x][y] = a[0][i][j], y++;
    x++;
  }

  auto ok = [&](ll x) {
    for (ll t = 0; t < 4; t++) {
      if (t & 1) {
        ll mx = n;
        for (ll i = 1; i <= m; i++) {
          for (ll j = 1; j <= n; j++)
            b[i][j] = 0;
        }
        for (ll i = 1; i <= m; i++) {
          for (ll j = 1; j <= mx; j++) {
            if (a[t][i][j] > x) {
              mx = j - 1;
              break;
            }
            b[i][j] = 1;
          }
        }
        ll mnn = 1e9 + 10;
        ll mxx = 0;
        for (ll i = 1; i <= m; i++) {
          for (ll j = 1; j <= n; j++) {
            if (!b[i][j]) {
              mxx = max(mxx, a[t][i][j]);
              mnn = min(mnn, a[t][i][j]);
            }
          }
        }
        if (mxx - mnn <= x)
          return true;
      } else {
        ll mx = m;
        for (ll i = 1; i <= n; i++) {
          for (ll j = 1; j <= m; j++)
            b[i][j] = 0;
        }
        for (ll i = 1; i <= n; i++) {
          for (ll j = 1; j <= mx; j++) {
            if (a[t][i][j] > x) {
              mx = j - 1;
              break;
            }
            b[i][j] = 1;
          }
        }
        ll mnn = 1e9 + 10;
        ll mxx = 0;
        for (ll i = 1; i <= n; i++) {
          for (ll j = 1; j <= m; j++) {
            if (!b[i][j]) {
              mxx = max(mxx, a[t][i][j]);
              mnn = min(mnn, a[t][i][j]);
            }
          }
        }
        if (mxx - mnn <= x)
          return true;
      }
    }
    return false;
  };

  ll l = 0, r = 1e9 + 1;
  while (l < r) {
    ll mid = (l + r) / 2;
    if (ok(mid))
      r = mid;
    else
      l = mid + 1;
  }
  cout << l << "\n";
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  clock_t start = clock();

  int test_cases = 1;
  /* cin >> test_cases; */

  while (test_cases--)
    solve();

#ifdef DEBUG
  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
#endif
  return 0;
}

Compilation message (stderr)

joioi.cpp: In function 'int main()':
joioi.cpp:209:11: warning: unused variable 'start' [-Wunused-variable]
  209 |   clock_t start = clock();
      |           ^~~~~

• Subtask 1: 15 / 15
• Subtask 2: 45 / 45
• Subtask 3: 40 / 40