oj.uz

Submission #57654

# Submission time Handle Problem Language Result Execution time Memory
57654 2018-07-15T17:43:45 Z Benq The Kingdom of JOIOI (JOI17_joioi) C++14
60 / 100
 1198 ms 263168 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int H,W,g[2000][2000];
int l[2][2000], r[2][2000];
pi lo = {0,0}, hi = {0,0};

bool leftIncrease(int x) {
    vi R(H), L(H);
    F0R(i,H) {
        R[i] = r[x][i];
        if (i) R[i] = max(R[i],R[i-1]);
    }
    F0Rd(i,H) {
        L[i] = l[x^1][i];
        if (i < H-1) L[i] = min(L[i],L[i+1]);
    }
    F0R(i,H) if (R[i] >= L[i]) return 0;
    return 1;
}

bool leftDecrease(int x) {
    vi R(H), L(H);
    F0Rd(i,H) {
        R[i] = r[x][i];
        if (i < H-1) R[i] = max(R[i],R[i+1]);
    }
    F0R(i,H) {
        L[i] = l[x^1][i];
        if (i) L[i] = min(L[i],L[i-1]);
    }
    F0R(i,H) if (R[i] >= L[i]) return 0;
    return 1;
}

bool ok(int mid) {
    F0R(i,H) l[0][i] = l[1][i] = MOD, r[0][i] = r[1][i] = -MOD;
    F0R(i,H) F0R(j,W) {
        if (g[hi.f][hi.s]-g[i][j] > mid) r[0][i] = max(r[0][i],j), l[0][i] = min(l[0][i],j);
        if (g[i][j]-g[lo.f][lo.s] > mid) r[1][i] = max(r[1][i],j), l[1][i] = min(l[1][i],j);
    }
    return leftIncrease(0) || leftDecrease(0) || leftIncrease(1) || leftDecrease(1);
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> H >> W;
    F0R(i,H) F0R(j,W) {
        cin >> g[i][j];
        if (g[i][j] < g[lo.f][lo.s]) lo = {i,j};
        if (g[i][j] > g[hi.f][hi.s]) hi = {i,j};
    }
    int lo = 0, hi = 1000000000;
    while (lo < hi) {
        int mid = (lo+hi)/2;
        if (ok(mid)) hi = mid;
        else lo = mid+1;
    }
    cout << lo;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 616 KB Output is correct
3 Correct 3 ms 616 KB Output is correct
4 Correct 2 ms 652 KB Output is correct
5 Correct 2 ms 844 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 3 ms 844 KB Output is correct
8 Correct 3 ms 964 KB Output is correct
9 Correct 3 ms 964 KB Output is correct
10 Correct 3 ms 964 KB Output is correct
11 Correct 2 ms 964 KB Output is correct
12 Correct 3 ms 964 KB Output is correct
13 Correct 3 ms 964 KB Output is correct
14 Correct 3 ms 964 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 616 KB Output is correct
3 Correct 3 ms 616 KB Output is correct
4 Correct 2 ms 652 KB Output is correct
5 Correct 2 ms 844 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 3 ms 844 KB Output is correct
8 Correct 3 ms 964 KB Output is correct
9 Correct 3 ms 964 KB Output is correct
10 Correct 3 ms 964 KB Output is correct
11 Correct 2 ms 964 KB Output is correct
12 Correct 3 ms 964 KB Output is correct
13 Correct 3 ms 964 KB Output is correct
14 Correct 3 ms 964 KB Output is correct
15 Correct 2 ms 964 KB Output is correct
16 Correct 8 ms 1952 KB Output is correct
17 Correct 12 ms 2240 KB Output is correct
18 Correct 13 ms 2456 KB Output is correct
19 Correct 14 ms 2740 KB Output is correct
20 Correct 14 ms 2884 KB Output is correct
21 Correct 15 ms 3416 KB Output is correct
22 Correct 14 ms 3784 KB Output is correct
23 Correct 30 ms 4168 KB Output is correct
24 Correct 14 ms 4556 KB Output is correct
25 Correct 19 ms 4904 KB Output is correct
26 Correct 12 ms 5332 KB Output is correct
27 Correct 15 ms 5680 KB Output is correct
28 Correct 12 ms 6068 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 616 KB Output is correct
3 Correct 3 ms 616 KB Output is correct
4 Correct 2 ms 652 KB Output is correct
5 Correct 2 ms 844 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 3 ms 844 KB Output is correct
8 Correct 3 ms 964 KB Output is correct
9 Correct 3 ms 964 KB Output is correct
10 Correct 3 ms 964 KB Output is correct
11 Correct 2 ms 964 KB Output is correct
12 Correct 3 ms 964 KB Output is correct
13 Correct 3 ms 964 KB Output is correct
14 Correct 3 ms 964 KB Output is correct
15 Correct 2 ms 964 KB Output is correct
16 Correct 8 ms 1952 KB Output is correct
17 Correct 12 ms 2240 KB Output is correct
18 Correct 13 ms 2456 KB Output is correct
19 Correct 14 ms 2740 KB Output is correct
20 Correct 14 ms 2884 KB Output is correct
21 Correct 15 ms 3416 KB Output is correct
22 Correct 14 ms 3784 KB Output is correct
23 Correct 30 ms 4168 KB Output is correct
24 Correct 14 ms 4556 KB Output is correct
25 Correct 19 ms 4904 KB Output is correct
26 Correct 12 ms 5332 KB Output is correct
27 Correct 15 ms 5680 KB Output is correct
28 Correct 12 ms 6068 KB Output is correct
29 Correct 864 ms 42344 KB Output is correct
30 Correct 996 ms 64616 KB Output is correct
31 Correct 1153 ms 87836 KB Output is correct
32 Correct 800 ms 110816 KB Output is correct
33 Correct 697 ms 129008 KB Output is correct
34 Correct 1062 ms 154196 KB Output is correct
35 Correct 1016 ms 193072 KB Output is correct
36 Correct 904 ms 226612 KB Output is correct
37 Runtime error 1198 ms 263168 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.