oj.uz

Submission #718532

# Submission time Handle Problem Language Result Execution time Memory
718532 2023-04-04T09:37:17 Z arush_agu The Kingdom of JOIOI (JOI17_joioi) C++17
100 / 100
 1531 ms 195808 KB 
#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

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

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 456 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 456 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 456 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 456 KB Output is correct
15 Correct 2 ms 2900 KB Output is correct
16 Correct 6 ms 5716 KB Output is correct
17 Correct 9 ms 6104 KB Output is correct
18 Correct 10 ms 6148 KB Output is correct
19 Correct 11 ms 6100 KB Output is correct
20 Correct 11 ms 5704 KB Output is correct
21 Correct 16 ms 6236 KB Output is correct
22 Correct 14 ms 6228 KB Output is correct
23 Correct 13 ms 6252 KB Output is correct
24 Correct 10 ms 5844 KB Output is correct
25 Correct 12 ms 6228 KB Output is correct
26 Correct 14 ms 6232 KB Output is correct
27 Correct 12 ms 6248 KB Output is correct
28 Correct 16 ms 6304 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 456 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 456 KB Output is correct
15 Correct 2 ms 2900 KB Output is correct
16 Correct 6 ms 5716 KB Output is correct
17 Correct 9 ms 6104 KB Output is correct
18 Correct 10 ms 6148 KB Output is correct
19 Correct 11 ms 6100 KB Output is correct
20 Correct 11 ms 5704 KB Output is correct
21 Correct 16 ms 6236 KB Output is correct
22 Correct 14 ms 6228 KB Output is correct
23 Correct 13 ms 6252 KB Output is correct
24 Correct 10 ms 5844 KB Output is correct
25 Correct 12 ms 6228 KB Output is correct
26 Correct 14 ms 6232 KB Output is correct
27 Correct 12 ms 6248 KB Output is correct
28 Correct 16 ms 6304 KB Output is correct
29 Correct 919 ms 175972 KB Output is correct
30 Correct 1020 ms 174008 KB Output is correct
31 Correct 1134 ms 180016 KB Output is correct
32 Correct 1052 ms 180172 KB Output is correct
33 Correct 847 ms 168748 KB Output is correct
34 Correct 1069 ms 180164 KB Output is correct
35 Correct 1531 ms 195808 KB Output is correct
36 Correct 1164 ms 182588 KB Output is correct
37 Correct 1435 ms 195724 KB Output is correct