oj.uz

Submission #200972

# Submission time Handle Problem Language Result Execution time Memory
200972 2020-02-08T21:52:35 Z tri Triple Jump (JOI19_jumps) C++14
100 / 100
 1297 ms 65880 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;

#define pb push_back
#define f first
#define s second

namespace debug {
    const int DEBUG = true;

    template<class T1, class T2>
    void pr(const pair<T1, T2> &x);

    template<class T, size_t SZ>
    void pr(const array<T, SZ> &x);

    template<class T>
    void pr(const vector<T> &x);

    template<class T>
    void pr(const set<T> &x);

    template<class T1, class T2>
    void pr(const map<T1, T2> &x);

    template<class T>
    void pr(const T &x) { if (DEBUG) cout << x; }

    template<class T, class... Ts>
    void pr(const T &first, const Ts &... rest) { pr(first), pr(rest...); }

    template<class T1, class T2>
    void pr(const pair<T1, T2> &x) { pr("{", x.f, ", ", x.s, "}"); }

    template<class T>
    void prIn(const T &x) {
        pr("{");
        bool fst = 1;
        for (auto &a : x) {
            pr(fst ? "" : ", ", a), fst = 0;
        }
        pr("}");
    }

    template<class T, size_t SZ>
    void pr(const array<T, SZ> &x) { prIn(x); }

    template<class T>
    void pr(const vector<T> &x) { prIn(x); }

    template<class T>
    void pr(const set<T> &x) { prIn(x); }

    template<class T1, class T2>
    void pr(const map<T1, T2> &x) { prIn(x); }

    void ps() { pr("\n"), cout << flush; }

    template<class Arg, class... Args>
    void ps(const Arg &first, const Args &... rest) {
        pr(first, " ");
        ps(rest...);
    }
}
using namespace debug;


const int MAXN = 5e5 + 10;

int N, Q;

int val[MAXN];

int qL[MAXN], qR[MAXN];

int ans[MAXN];

struct LSegTr {
    int tr[4 * MAXN + 5], lz[4 * MAXN + 5];

    void push(int i, int l, int r) {
        tr[i] += lz[i];
        if (l != r) {
            lz[i * 2] += lz[i];
            lz[i * 2 + 1] += lz[i];
        }
        lz[i] = 0;
    }

    int q(int i, int l, int r, int s, int e) {
        if (e < l || r < s) {
            return 0;
        }
        push(i, l, r);
        if (s <= l && r <= e) {
            return tr[i];
        }
        int mid = (l + r) / 2;
        return max(q(i * 2, l, mid, s, e), q(i * 2 + 1, mid + 1, r, s, e));
    }

    void u(int i, int l, int r, int s, int e, int d) {
        push(i, l, r); // pushed early to use in recalculation of parent
        if (e < l || r < s) {
            return;
        }
        if (s <= l && r <= e) {
            lz[i] += d;
            push(i, l, r);
            return;
        }
        int mid = (l + r) / 2;
        u(i * 2, l, mid, s, e, d);
        u(i * 2 + 1, mid + 1, r, s, e, d);
        tr[i] = max(tr[i * 2], tr[i * 2 + 1]);
    }

    void b(int i, int l, int r) {
        if (l == r) {
            if (l >= N) {
                return;
            }
            tr[i] = val[l];
            return;
        }

        int mid = (l + r) / 2;
        b(i * 2, l, mid);
        b(i * 2 + 1, mid + 1, r);
        tr[i] = max(tr[i * 2], tr[i * 2 + 1]);
    }

} lSegTr;

set<pi> ints;

bool evaluate(pi nInt, pi oInt) {
    if (nInt.s <= oInt.s) {
        return false;
    }
    int delta = nInt.s - oInt.s;
    int oIntR = ints.upper_bound(oInt)->f - 1;
    int updL = max(nInt.f, oInt.f);

//    ps("oInt:", oInt);
//    ps("segTr adding");
//    ps(updL, oIntR, delta);

    lSegTr.u(1, 0, MAXN, updL, oIntR, delta);

    if (nInt.f <= oInt.f) {
        ints.erase(oInt);
    }
    return true;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> N;
    for (int i = 0; i < N; i++) {
        cin >> val[i];
    }

    cin >> Q;
    vector<pair<pi, int>> queries;
    for (int i = 0; i < Q; i++) {
        cin >> qL[i] >> qR[i];
        qL[i]--, qR[i]--;
        queries.pb({{qL[i], qR[i]}, i});
    }

    sort(queries.begin(), queries.end());
    reverse(queries.begin(), queries.end());

    vi stack;
    vector<pi> lmInts;

    for (int i = 0; i < N; i++) {
        for (int j = stack.size() - 1; j >= 0; j--) {
            lmInts.pb({stack[j], i});

            if (val[stack[j]] >= val[i]) {
                break;
            }
        }

        while (stack.size() && val[stack[stack.size() - 1]] <= val[i]) {
            stack.erase(--stack.end());
        }
        stack.pb(i);
    }
    // lmInts should contain all pairs of (l, m) s.t. all values with indices in-between are strictly less

    sort(lmInts.begin(), lmInts.end());
    reverse(lmInts.begin(), lmInts.end());

//    ps(lmInts);
//    ps(queries);

    ints.insert({N, (int) 1e9});
    ints.insert({N + 1, (int) 1e9});
    ints.insert({0, 0});

    memset(lSegTr.tr, 0, sizeof(lSegTr.tr));
    memset(lSegTr.lz, 0, sizeof(lSegTr.lz));
    lSegTr.b(1, 0, MAXN);

//    ps(ints);

    int nLM = 0, nQ = 0;
    for (int i = N - 1; i >= 0; i--) {
        while (nLM < lmInts.size() && i <= lmInts[nLM].f) {
            pi cLM = lmInts[nLM];
            int cLMVal = val[cLM.f] + val[cLM.s];

            int r = cLM.s + cLM.s - cLM.f;
//            ps("adding");
//            ps(cLM.f, cLM.s, r, cLMVal);

            pi nInt = {r, cLMVal};
            pi cInt = *(--ints.upper_bound({r, (int) 1e9}));

            bool lRes = true;

            int sCnt = 0;

            while (lRes) {
                lRes = evaluate(nInt, cInt);
                cInt = *ints.upper_bound(cInt);
                sCnt++;
            }

            if (sCnt > 1) {
                ints.insert(nInt);
            }


            nLM++;

//            ps("post add");
//            ps(ints);
        }

        while (nQ < Q && queries[nQ].f.f == i) {
            int l = queries[nQ].f.f;
            int r = queries[nQ].f.s;
            int qI = queries[nQ].s;

//            ps("querying", l, r, qI);

//            if (true) {
//                ps("spec", lSegTr.q(1, 0, MAXN, 3, 3));
//            }

            ans[qI] = lSegTr.q(1, 0, MAXN, l, r);
//            ps(ans[qI]);
            nQ++;
        }
    }

    for (int i = 0; i < Q; i++) {
        cout << ans[i] << '\n';
    }
    cout << flush;
}

Compilation message

jumps.cpp: In function 'int main()':
jumps.cpp:224:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while (nLM < lmInts.size() && i <= lmInts[nLM].f) {
                ~~~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 15992 KB Output is correct
2 Correct 16 ms 15992 KB Output is correct
3 Correct 16 ms 15996 KB Output is correct
4 Correct 15 ms 15992 KB Output is correct
5 Correct 16 ms 15992 KB Output is correct
6 Correct 9 ms 16120 KB Output is correct
7 Correct 18 ms 16120 KB Output is correct
8 Correct 16 ms 15992 KB Output is correct
9 Correct 15 ms 15992 KB Output is correct
10 Correct 15 ms 15996 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 15992 KB Output is correct
2 Correct 16 ms 15992 KB Output is correct
3 Correct 16 ms 15996 KB Output is correct
4 Correct 15 ms 15992 KB Output is correct
5 Correct 16 ms 15992 KB Output is correct
6 Correct 9 ms 16120 KB Output is correct
7 Correct 18 ms 16120 KB Output is correct
8 Correct 16 ms 15992 KB Output is correct
9 Correct 15 ms 15992 KB Output is correct
10 Correct 15 ms 15996 KB Output is correct
11 Correct 370 ms 37056 KB Output is correct
12 Correct 354 ms 36824 KB Output is correct
13 Correct 349 ms 36844 KB Output is correct
14 Correct 361 ms 37080 KB Output is correct
15 Correct 361 ms 36824 KB Output is correct
16 Correct 350 ms 36184 KB Output is correct
17 Correct 368 ms 36312 KB Output is correct
18 Correct 373 ms 36184 KB Output is correct
19 Correct 365 ms 36824 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 317 ms 21984 KB Output is correct
2 Correct 243 ms 29544 KB Output is correct
3 Correct 205 ms 21860 KB Output is correct
4 Correct 320 ms 21984 KB Output is correct
5 Correct 310 ms 21856 KB Output is correct
6 Correct 312 ms 21216 KB Output is correct
7 Correct 305 ms 21088 KB Output is correct
8 Correct 315 ms 21216 KB Output is correct
9 Correct 322 ms 21436 KB Output is correct

Subtask #4
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 15992 KB Output is correct
2 Correct 16 ms 15992 KB Output is correct
3 Correct 16 ms 15996 KB Output is correct
4 Correct 15 ms 15992 KB Output is correct
5 Correct 16 ms 15992 KB Output is correct
6 Correct 9 ms 16120 KB Output is correct
7 Correct 18 ms 16120 KB Output is correct
8 Correct 16 ms 15992 KB Output is correct
9 Correct 15 ms 15992 KB Output is correct
10 Correct 15 ms 15996 KB Output is correct
11 Correct 370 ms 37056 KB Output is correct
12 Correct 354 ms 36824 KB Output is correct
13 Correct 349 ms 36844 KB Output is correct
14 Correct 361 ms 37080 KB Output is correct
15 Correct 361 ms 36824 KB Output is correct
16 Correct 350 ms 36184 KB Output is correct
17 Correct 368 ms 36312 KB Output is correct
18 Correct 373 ms 36184 KB Output is correct
19 Correct 365 ms 36824 KB Output is correct
20 Correct 317 ms 21984 KB Output is correct
21 Correct 243 ms 29544 KB Output is correct
22 Correct 205 ms 21860 KB Output is correct
23 Correct 320 ms 21984 KB Output is correct
24 Correct 310 ms 21856 KB Output is correct
25 Correct 312 ms 21216 KB Output is correct
26 Correct 305 ms 21088 KB Output is correct
27 Correct 315 ms 21216 KB Output is correct
28 Correct 322 ms 21436 KB Output is correct
29 Correct 1287 ms 50496 KB Output is correct
30 Correct 1153 ms 65880 KB Output is correct
31 Correct 1016 ms 46548 KB Output is correct
32 Correct 1276 ms 50504 KB Output is correct
33 Correct 1277 ms 50512 KB Output is correct
34 Correct 1277 ms 49736 KB Output is correct
35 Correct 1269 ms 49664 KB Output is correct
36 Correct 1283 ms 49864 KB Output is correct
37 Correct 1297 ms 49996 KB Output is correct
38 Correct 1122 ms 50536 KB Output is correct
39 Correct 1146 ms 50120 KB Output is correct
40 Correct 1144 ms 48360 KB Output is correct
41 Correct 1097 ms 47944 KB Output is correct
42 Correct 1105 ms 47944 KB Output is correct
43 Correct 1134 ms 48712 KB Output is correct
44 Correct 1124 ms 49740 KB Output is correct
45 Correct 1150 ms 49608 KB Output is correct
46 Correct 1168 ms 48084 KB Output is correct
47 Correct 1140 ms 47816 KB Output is correct
48 Correct 1151 ms 47724 KB Output is correct
49 Correct 1112 ms 48968 KB Output is correct
50 Correct 1184 ms 49208 KB Output is correct
51 Correct 1190 ms 49224 KB Output is correct
52 Correct 1139 ms 48308 KB Output is correct
53 Correct 1187 ms 48304 KB Output is correct
54 Correct 1177 ms 47964 KB Output is correct
55 Correct 1188 ms 48648 KB Output is correct