Submission #995147

#	Time	Username	Problem	Language	Result	Execution time	Memory
995147		_callmelucian	The Kingdom of JOIOI (JOI17_joioi)	C++14	60 / 100	4041 ms	148576 KiB

joioi

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pl;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tt;

#define all(a) a.begin(), a.end()
#define filter(a) a.erase(unique(all(a)), a.end())

const int mn = 4'004'004;
int lo[mn], hi[mn], vec[2][mn], calcLo[mn], calcHi[mn], coor[mn], prod;

int get (int arr, int it) {
    return vec[arr][it];
}

int getID (int i, int j) {
    return i * 2001 + j;
}

bool check (int arr, int delta) {
    int pos = -1, curLo = INT_MAX, curHi = INT_MIN;
    for (int k = 0; k < prod; k++) {
        int cur = get(arr, coor[k]);
        while (pos + 1 < prod && get(arr, coor[pos + 1]) < cur - delta) {
            pos++;
            curLo = min(curLo, lo[coor[pos]]);
            curHi = max(curHi, hi[coor[pos]]);
        }
        if (k + 1 < prod && get(arr, coor[k]) == get(arr, coor[k + 1])) continue;
        int cHi = max(calcHi[k], curHi);
        int cLo = min(calcLo[k], curLo);
        if (cHi == INT_MIN || cHi - cLo <= delta) return 1;
    }
    return 0;
}

int solve (int arr, int n, int m) {
    for (int i = 1; i <= n; i++)
        lo[getID(i, 0)] = INT_MAX, hi[getID(i, 0)] = INT_MIN;
    for (int j = 1; j <= m; j++) {
        int loCol = INT_MAX, hiCol = INT_MIN;
        for (int i = n; i >= 1; i--) {
            lo[getID(i, j)] = min(lo[getID(i, j - 1)], loCol = min(loCol, vec[arr][getID(i, j)]));
            hi[getID(i, j)] = max(hi[getID(i, j - 1)], hiCol = max(hiCol, vec[arr][getID(i, j)]));
        }
    }

    int counter = 0;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            coor[counter++] = getID(i, j);

    function<bool(int,int)> comp = [&] (int a, int b) {
        return get(arr, a) < get(arr, b);
    };
    sort(coor, coor + prod, comp);

    int curLo = INT_MAX, curHi = INT_MIN;
    for (int k = prod - 1; k >= 0; k--) {
        calcLo[k] = curLo, calcHi[k] = curHi;
        curLo = min(curLo, lo[coor[k]]);
        curHi = max(curHi, hi[coor[k]]);
    }

    if (check(arr, 0)) return 0;
    int ans = 0;
    for (int i = 29; i >= 0; i--)
        if (!check(arr, ans | (1 << i))) ans |= (1 << i);
    return ans + 1;
}

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

    int n, m; cin >> n >> m;
    prod = n * m;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> vec[0][getID(i, j)];
            vec[1][getID(j, n - i + 1)] = vec[0][getID(i, j)];
        }
    }


    cout << min(solve(0, n, m), solve(1, m, n));

    return 0;
}

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