oj.uz

Submission #834926

# Submission time Handle Problem Language Result Execution time Memory
834926 2023-08-23T02:44:26 Z maomao90 Triple Jump (JOI19_jumps) C++17
100 / 100
 1100 ms 121372 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 500005;

int n;
int a[MAXN];
int q;
vii qry[MAXN];
vi ev[MAXN];
ll ans[MAXN];

#define MLR int mid = lo + hi >> 1, lc = u << 1, rc = u << 1 ^ 1
struct Node {
    ll mn, smn, mxa, res, lz;
} st[MAXN * 4];
void init(int u = 1, int lo = 1, int hi = n) {
    st[u].mn = -LINF;
    st[u].smn = LINF;
    st[u].res = 0;
    st[u].lz = -LINF;
    if (lo == hi) {
        st[u].mxa = a[lo];
        return;
    }
    MLR;
    init(lc, lo, mid);
    init(rc, mid + 1, hi);
    st[u].mxa = max(st[lc].mxa, st[rc].mxa);
}
void apply(ll x, int u, int lo, int hi) {
    if (x <= st[u].mn) {
        return;
    }
    assert(x <= st[u].smn);
    st[u].mn = x;
    mxto(st[u].res, st[u].mn + st[u].mxa);
    mxto(st[u].lz, x);
}
void propo(int u, int lo, int hi) {
    if (st[u].lz == -LINF) {
        return;
    }
    MLR;
    apply(st[u].lz, lc, lo, mid);
    apply(st[u].lz, rc, mid + 1, hi);
    st[u].lz = -LINF;
}
void updmx(int s, int e, ll x, int u = 1, int lo = 1, int hi = n) {
    if (s > e || x <= st[u].mn) {
        return;
    }
    if (lo >= s && hi <= e && x <= st[u].smn) {
        apply(x, u, lo, hi);
        return;
    }
    assert(lo != hi);
    propo(u, lo, hi);
    MLR;
    if (s <= mid) {
        updmx(s, e, x, lc, lo, mid);
    }
    if (e > mid) {
        updmx(s, e, x, rc, mid + 1, hi);
    }
    st[u].res = max(st[lc].res, st[rc].res);
    if (st[lc].mn == st[rc].mn) {
        st[u].mn = st[lc].mn;
        st[u].mxa = max(st[lc].mxa, st[rc].mxa);
        st[u].smn = min(st[lc].smn, st[rc].smn);
    } else if (st[lc].mn < st[rc].mn) {
        st[u].mn = st[lc].mn;
        st[u].mxa = st[lc].mxa;
        st[u].smn = min(st[lc].smn, st[rc].mn);
    } else {
        st[u].mn = st[rc].mn;
        st[u].mxa = st[rc].mxa;
        st[u].smn = min(st[rc].smn, st[lc].mn);
    }
}
ll qmx(int s, int e, int u = 1, int lo = 1, int hi = n) {
    if (lo >= s && hi <= e) {
        return st[u].res;
    }
    MLR;
    propo(u, lo, hi);
    ll res = 0;
    if (s <= mid) {
        mxto(res, qmx(s, e, lc, lo, mid));
    }
    if (e > mid) {
        mxto(res, qmx(s, e, rc, mid + 1, hi));
    }
    return res;
}
/*
void updmx(int s, int e, ll x) {
    REP (i, s, e + 1) {
        mxto(mx[i], x);
    }
}
ll qmx(int s, int e) {
    ll res = 0;
    REP (i, s, e + 1) {
        mxto(res, a[i] + mx[i]);
    }
    return res;
}
*/

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n;
    REP (i, 1, n + 1) {
        cin >> a[i];
    }
    vi stk;
    REP (j, 1, n + 1) {
        while (!stk.empty() && a[stk.back()] < a[j]) {
            ev[stk.back()].pb(j);
            stk.pop_back();
        }
        if (!stk.empty()) {
            ev[stk.back()].pb(j);
        }
        stk.pb(j);
    }
    stk.clear();
    RREP (j, n, 1) {
        while (!stk.empty() && a[stk.back()] < a[j]) {
            ev[j].pb(stk.back());
            stk.pop_back();
        }
        if (!stk.empty()) {
            ev[j].pb(stk.back());
        }
        stk.pb(j);
    }
    cin >> q;
    REP (i, 1, q + 1) {
        int l, r; cin >> l >> r;
        qry[l].pb({r, i});
    }
    init();
    RREP (l, n, 1) {
        for (int r : ev[l]) {
            // c - r = r - l
            // c = 2 * r - l
            updmx(2 * r - l, n, a[l] + a[r]);
        }
        for (auto [r, i] : qry[l]) {
            ans[i] = qmx(l, r);
        }
    }
    REP (i, 1, q + 1) {
        cout << ans[i] << '\n';
    }
    return 0;
}

Compilation message

jumps.cpp: In function 'void init(int, int, int)':
jumps.cpp:47:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   47 | #define MLR int mid = lo + hi >> 1, lc = u << 1, rc = u << 1 ^ 1
      |                       ~~~^~~~
jumps.cpp:60:5: note: in expansion of macro 'MLR'
   60 |     MLR;
      |     ^~~
jumps.cpp: In function 'void propo(int, int, int)':
jumps.cpp:47:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   47 | #define MLR int mid = lo + hi >> 1, lc = u << 1, rc = u << 1 ^ 1
      |                       ~~~^~~~
jumps.cpp:78:5: note: in expansion of macro 'MLR'
   78 |     MLR;
      |     ^~~
jumps.cpp: In function 'void updmx(int, int, ll, int, int, int)':
jumps.cpp:47:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   47 | #define MLR int mid = lo + hi >> 1, lc = u << 1, rc = u << 1 ^ 1
      |                       ~~~^~~~
jumps.cpp:93:5: note: in expansion of macro 'MLR'
   93 |     MLR;
      |     ^~~
jumps.cpp: In function 'll qmx(int, int, int, int, int)':
jumps.cpp:47:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   47 | #define MLR int mid = lo + hi >> 1, lc = u << 1, rc = u << 1 ^ 1
      |                       ~~~^~~~
jumps.cpp:119:5: note: in expansion of macro 'MLR'
  119 |     MLR;
      |     ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Correct 10 ms 23764 KB Output is correct
3 Correct 10 ms 23764 KB Output is correct
4 Correct 10 ms 23764 KB Output is correct
5 Correct 10 ms 23764 KB Output is correct
6 Correct 10 ms 23764 KB Output is correct
7 Correct 10 ms 23764 KB Output is correct
8 Correct 11 ms 23856 KB Output is correct
9 Correct 10 ms 23764 KB Output is correct
10 Correct 10 ms 23764 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Correct 10 ms 23764 KB Output is correct
3 Correct 10 ms 23764 KB Output is correct
4 Correct 10 ms 23764 KB Output is correct
5 Correct 10 ms 23764 KB Output is correct
6 Correct 10 ms 23764 KB Output is correct
7 Correct 10 ms 23764 KB Output is correct
8 Correct 11 ms 23856 KB Output is correct
9 Correct 10 ms 23764 KB Output is correct
10 Correct 10 ms 23764 KB Output is correct
11 Correct 210 ms 40468 KB Output is correct
12 Correct 207 ms 40396 KB Output is correct
13 Correct 218 ms 40416 KB Output is correct
14 Correct 220 ms 40488 KB Output is correct
15 Correct 200 ms 40532 KB Output is correct
16 Correct 203 ms 39884 KB Output is correct
17 Correct 212 ms 39772 KB Output is correct
18 Correct 209 ms 39756 KB Output is correct
19 Correct 211 ms 40264 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 53280 KB Output is correct
2 Correct 127 ms 52392 KB Output is correct
3 Correct 127 ms 52160 KB Output is correct
4 Correct 225 ms 53400 KB Output is correct
5 Correct 227 ms 53320 KB Output is correct
6 Correct 225 ms 53448 KB Output is correct
7 Correct 221 ms 53404 KB Output is correct
8 Correct 226 ms 53452 KB Output is correct
9 Correct 225 ms 53324 KB Output is correct

Subtask #4
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Correct 10 ms 23764 KB Output is correct
3 Correct 10 ms 23764 KB Output is correct
4 Correct 10 ms 23764 KB Output is correct
5 Correct 10 ms 23764 KB Output is correct
6 Correct 10 ms 23764 KB Output is correct
7 Correct 10 ms 23764 KB Output is correct
8 Correct 11 ms 23856 KB Output is correct
9 Correct 10 ms 23764 KB Output is correct
10 Correct 10 ms 23764 KB Output is correct
11 Correct 210 ms 40468 KB Output is correct
12 Correct 207 ms 40396 KB Output is correct
13 Correct 218 ms 40416 KB Output is correct
14 Correct 220 ms 40488 KB Output is correct
15 Correct 200 ms 40532 KB Output is correct
16 Correct 203 ms 39884 KB Output is correct
17 Correct 212 ms 39772 KB Output is correct
18 Correct 209 ms 39756 KB Output is correct
19 Correct 211 ms 40264 KB Output is correct
20 Correct 232 ms 53280 KB Output is correct
21 Correct 127 ms 52392 KB Output is correct
22 Correct 127 ms 52160 KB Output is correct
23 Correct 225 ms 53400 KB Output is correct
24 Correct 227 ms 53320 KB Output is correct
25 Correct 225 ms 53448 KB Output is correct
26 Correct 221 ms 53404 KB Output is correct
27 Correct 226 ms 53452 KB Output is correct
28 Correct 225 ms 53324 KB Output is correct
29 Correct 1052 ms 115532 KB Output is correct
30 Correct 750 ms 114192 KB Output is correct
31 Correct 879 ms 114096 KB Output is correct
32 Correct 1088 ms 115680 KB Output is correct
33 Correct 1100 ms 115584 KB Output is correct
34 Correct 1055 ms 113500 KB Output is correct
35 Correct 1071 ms 113084 KB Output is correct
36 Correct 1067 ms 112972 KB Output is correct
37 Correct 1065 ms 114508 KB Output is correct
38 Correct 843 ms 121372 KB Output is correct
39 Correct 819 ms 121200 KB Output is correct
40 Correct 835 ms 117968 KB Output is correct
41 Correct 807 ms 117436 KB Output is correct
42 Correct 815 ms 117580 KB Output is correct
43 Correct 809 ms 119208 KB Output is correct
44 Correct 877 ms 120624 KB Output is correct
45 Correct 909 ms 120652 KB Output is correct
46 Correct 860 ms 117792 KB Output is correct
47 Correct 831 ms 117068 KB Output is correct
48 Correct 861 ms 117040 KB Output is correct
49 Correct 898 ms 119312 KB Output is correct
50 Correct 924 ms 118816 KB Output is correct
51 Correct 951 ms 118796 KB Output is correct
52 Correct 911 ms 116380 KB Output is correct
53 Correct 912 ms 115996 KB Output is correct
54 Correct 903 ms 116000 KB Output is correct
55 Correct 920 ms 117756 KB Output is correct