답안 #57656 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
57656	2018-07-15T17:44:52 Z	Benq	The Kingdom of JOIOI (JOI17_joioi)	C++14	100 / 100	1330 ms	18764 KB

joioi

#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};
int L[2000], R[2000];

bool leftIncrease(int x) {
    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) {
    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

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	380 KB	Output is correct
2	Correct	3 ms	488 KB	Output is correct
3	Correct	3 ms	568 KB	Output is correct
4	Correct	2 ms	568 KB	Output is correct
5	Correct	3 ms	600 KB	Output is correct
6	Correct	3 ms	600 KB	Output is correct
7	Correct	5 ms	740 KB	Output is correct
8	Correct	2 ms	740 KB	Output is correct
9	Correct	3 ms	740 KB	Output is correct
10	Correct	2 ms	740 KB	Output is correct
11	Correct	2 ms	740 KB	Output is correct
12	Correct	3 ms	740 KB	Output is correct
13	Correct	3 ms	740 KB	Output is correct
14	Correct	3 ms	740 KB	Output is correct

Subtask #2
45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	380 KB	Output is correct
2	Correct	3 ms	488 KB	Output is correct
3	Correct	3 ms	568 KB	Output is correct
4	Correct	2 ms	568 KB	Output is correct
5	Correct	3 ms	600 KB	Output is correct
6	Correct	3 ms	600 KB	Output is correct
7	Correct	5 ms	740 KB	Output is correct
8	Correct	2 ms	740 KB	Output is correct
9	Correct	3 ms	740 KB	Output is correct
10	Correct	2 ms	740 KB	Output is correct
11	Correct	2 ms	740 KB	Output is correct
12	Correct	3 ms	740 KB	Output is correct
13	Correct	3 ms	740 KB	Output is correct
14	Correct	3 ms	740 KB	Output is correct
15	Correct	3 ms	740 KB	Output is correct
16	Correct	10 ms	1708 KB	Output is correct
17	Correct	10 ms	2016 KB	Output is correct
18	Correct	13 ms	2284 KB	Output is correct
19	Correct	17 ms	2452 KB	Output is correct
20	Correct	20 ms	2596 KB	Output is correct
21	Correct	12 ms	3092 KB	Output is correct
22	Correct	14 ms	3480 KB	Output is correct
23	Correct	22 ms	3912 KB	Output is correct
24	Correct	12 ms	3912 KB	Output is correct
25	Correct	18 ms	3948 KB	Output is correct
26	Correct	16 ms	3948 KB	Output is correct
27	Correct	12 ms	3948 KB	Output is correct
28	Correct	13 ms	3948 KB	Output is correct

Subtask #3
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	380 KB	Output is correct
2	Correct	3 ms	488 KB	Output is correct
3	Correct	3 ms	568 KB	Output is correct
4	Correct	2 ms	568 KB	Output is correct
5	Correct	3 ms	600 KB	Output is correct
6	Correct	3 ms	600 KB	Output is correct
7	Correct	5 ms	740 KB	Output is correct
8	Correct	2 ms	740 KB	Output is correct
9	Correct	3 ms	740 KB	Output is correct
10	Correct	2 ms	740 KB	Output is correct
11	Correct	2 ms	740 KB	Output is correct
12	Correct	3 ms	740 KB	Output is correct
13	Correct	3 ms	740 KB	Output is correct
14	Correct	3 ms	740 KB	Output is correct
15	Correct	3 ms	740 KB	Output is correct
16	Correct	10 ms	1708 KB	Output is correct
17	Correct	10 ms	2016 KB	Output is correct
18	Correct	13 ms	2284 KB	Output is correct
19	Correct	17 ms	2452 KB	Output is correct
20	Correct	20 ms	2596 KB	Output is correct
21	Correct	12 ms	3092 KB	Output is correct
22	Correct	14 ms	3480 KB	Output is correct
23	Correct	22 ms	3912 KB	Output is correct
24	Correct	12 ms	3912 KB	Output is correct
25	Correct	18 ms	3948 KB	Output is correct
26	Correct	16 ms	3948 KB	Output is correct
27	Correct	12 ms	3948 KB	Output is correct
28	Correct	13 ms	3948 KB	Output is correct
29	Correct	966 ms	17924 KB	Output is correct
30	Correct	1018 ms	18676 KB	Output is correct
31	Correct	1141 ms	18676 KB	Output is correct
32	Correct	975 ms	18680 KB	Output is correct
33	Correct	744 ms	18680 KB	Output is correct
34	Correct	1145 ms	18764 KB	Output is correct
35	Correct	1157 ms	18764 KB	Output is correct
36	Correct	1028 ms	18764 KB	Output is correct
37	Correct	1330 ms	18764 KB	Output is correct

답안 #57656

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 45.0 / 45.0

Subtask #3 40.0 / 40.0

Subtask #1
15.0 / 15.0

Subtask #2
45.0 / 45.0

Subtask #3
40.0 / 40.0