oj.uz

Submission #834924

# Submission time Handle Problem Language Result Execution time Memory
834924 2023-08-23T02:13:22 Z maomao90 Triple Jump (JOI19_jumps) C++17
19 / 100
 4000 ms 44636 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];

ll mx[MAXN];
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];
    }
    REP (j, 1, n + 1) {
        mx[j] = -INF;
    }
    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});
    }
    RREP (l, n, 1) {
        for (int r : ev[l]) {
            // c - r = r - l
            // c = 2 * r - l
            if (2 * r - l <= n) {
                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;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 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 12 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 23764 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 10 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 12 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 23764 KB Output is correct
9 Correct 10 ms 23764 KB Output is correct
10 Correct 10 ms 23764 KB Output is correct
11 Correct 913 ms 43364 KB Output is correct
12 Correct 903 ms 44468 KB Output is correct
13 Correct 898 ms 44532 KB Output is correct
14 Correct 911 ms 44620 KB Output is correct
15 Correct 949 ms 44636 KB Output is correct
16 Correct 911 ms 44020 KB Output is correct
17 Correct 945 ms 43868 KB Output is correct
18 Correct 931 ms 43808 KB Output is correct
19 Correct 910 ms 44444 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4057 ms 34324 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 10 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 12 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 23764 KB Output is correct
9 Correct 10 ms 23764 KB Output is correct
10 Correct 10 ms 23764 KB Output is correct
11 Correct 913 ms 43364 KB Output is correct
12 Correct 903 ms 44468 KB Output is correct
13 Correct 898 ms 44532 KB Output is correct
14 Correct 911 ms 44620 KB Output is correct
15 Correct 949 ms 44636 KB Output is correct
16 Correct 911 ms 44020 KB Output is correct
17 Correct 945 ms 43868 KB Output is correct
18 Correct 931 ms 43808 KB Output is correct
19 Correct 910 ms 44444 KB Output is correct
20 Execution timed out 4057 ms 34324 KB Time limit exceeded
21 Halted 0 ms 0 KB -