oj.uz

답안 #807439

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
807439 2023-08-04T17:37:03 Z thimote75 3단 점프 (JOI19_jumps) C++14
100 / 100
 761 ms 107932 KB 
#include <bits/stdc++.h>
#define int long long

using namespace std;

template <typename T>
string to_string (T x) {
    string S = "[";
    bool first = true;
    for (const auto v : x) {
        if (!first) S += ", ";
        first = false;
        S += to_string(v);
    }
    S += "]";
    return S;
}
string to_string (string S) { return S; }
template <typename A, typename B>
string to_string (pair<A, B> p) {
    return "(" + to_string(p.first )+ ", " + to_string(p.second) + ")";
}

void dbg_out () { cout << endl; }
template <typename Head, typename... Tail>
void dbg_out (Head H, Tail... T) {
    cout << to_string(H) << " ";
    dbg_out(T...);
}

#ifdef DEBUG
#  define dbg(...) { cout << "(" << #__VA_ARGS__ << "): "; dbg_out(__VA_ARGS__); }
#else
#  define dbg(...)
#endif

using idata = vector<int>;
using igrid = vector<idata>;
template<typename T>
using grid = vector<vector<T>>;

using di = pair<int, int>; using vd = vector<di>;
using ti = pair<di, int> ; using vt = vector<ti>;

igrid opt;

struct Monoid {
    int p = 0, q = 0, ppq = 0;
    Monoid () = default;
    Monoid (int p, int q, int ppq) : p(p), q(q), ppq(ppq) {}

    static Monoid merge (Monoid &left, Monoid &right) {
        return Monoid( max(left.p, right.p), max(left.q, right.q), max(left.p + right.q, max(left.ppq, right.ppq)) );
    }
};

struct SegTree {
    vector<Monoid> tree;

    int start, height, size;
    SegTree (int _size) {
        size   = _size;
        height = ceil(log2(size));
        start  = 1 << height;

        tree.resize(start << 1);
    }
    void update (int i) {
        i += start;
        i >>= 1;
        while (i != 0) {
            tree[i] = Monoid::merge(tree[2 * i], tree[2 * i + 1]);
            i >>= 1;
        }
    }
    void modify_p (int i, int p) {
        tree[i + start].p   = max(tree[i + start].p, p);
        tree[i + start].ppq = max(tree[i + start].ppq, tree[i + start].p + tree[i + start].q);
        update(i);
    }
    void modify_q (int i, int q) {
        tree[i + start].q   = max(tree[i + start].q, q);
        tree[i + start].ppq = max(tree[i + start].ppq, tree[i + start].p + tree[i + start].q);
        update(i);
    }
    int query (int l, int r) {
        l += start; r += start;

        Monoid resL;
        Monoid resR;

        idata qL, qR;
        while (l < r) {
            if ((l & 1) == 1) resL = Monoid::merge(resL, tree[l]);
            if ((r & 1) == 0) resR = Monoid::merge(tree[r], resR);

            l = (l + 1) >> 1;
            r = (r - 1) >> 1;
        }

        if (l == r) resL = Monoid::merge(resL, tree[l]);

        return Monoid::merge(resL, resR).ppq;
    }
};

signed main () {
    int N;
    cin >> N;

    idata A(N);
    for (int i = 0; i < N; i ++)
        cin >> A[i];
    
    opt.resize(N);
    deque<int> local;
    for (int i = 0; i < N; i ++) {
        while (local.size() != 0 && A[local.front()] < A[i]) {
            int curr = local.front(); local.pop_front();
            opt[i].push_back(curr);
        }

        if (local.size() != 0) opt[i].push_back(local.front());
        local.push_front(i);
    }

    vd opt_q;

    for (int i = 0; i < N; i ++) {
        for (int a : opt[i]) {
            opt_q.push_back({ a, i });
        }
    }

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

    int Q;
    cin >> Q;
    idata answer(Q);

    vt queries;

    for (int q = 0; q < Q; q ++) {
        int l, r;
        cin >> l >> r;
        l --; r --;

        queries.push_back({ { l, r }, q });
    }

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

    int opt_q_id = 0;
    int query_id = 0;
    SegTree tree(N);
    for (int i = 0; i < N; i ++)
        tree.modify_q(i, A[i]);

    for (int i = N - 1; i >= 0; i --) {
        while (opt_q_id != opt_q.size() && opt_q[opt_q_id].first == i) {
            int optA = opt_q[opt_q_id].first;
            int optB = opt_q[opt_q_id].second;
            opt_q_id ++;

            int optC = 2 * optB - optA;
            if (optC > N) continue ;

            tree.modify_p(optC, A[optA] + A[optB]);
        }

        while (query_id != queries.size() && queries[query_id].first.first == i) {
            int l = queries[query_id].first.first;
            int r = queries[query_id].first.second;
            int i = queries[query_id].second;
            query_id ++;

            answer[i] = tree.query(l, r);
        }
    }

    for (int u : answer) cout << u << "\n";
}

Compilation message

jumps.cpp: In function 'int main()':
jumps.cpp:163:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  163 |         while (opt_q_id != opt_q.size() && opt_q[opt_q_id].first == i) {
      |                ~~~~~~~~~^~~~~~~~~~~~~~~
jumps.cpp:174:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<std::pair<long long int, long long int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  174 |         while (query_id != queries.size() && queries[query_id].first.first == i) {
      |                ~~~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 294 ms 21852 KB Output is correct
12 Correct 305 ms 21740 KB Output is correct
13 Correct 288 ms 21660 KB Output is correct
14 Correct 292 ms 21836 KB Output is correct
15 Correct 296 ms 21776 KB Output is correct
16 Correct 297 ms 21192 KB Output is correct
17 Correct 296 ms 21132 KB Output is correct
18 Correct 293 ms 21156 KB Output is correct
19 Correct 293 ms 21740 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 142 ms 32684 KB Output is correct
2 Correct 106 ms 28332 KB Output is correct
3 Correct 105 ms 30044 KB Output is correct
4 Correct 149 ms 32736 KB Output is correct
5 Correct 142 ms 32744 KB Output is correct
6 Correct 126 ms 32736 KB Output is correct
7 Correct 123 ms 32720 KB Output is correct
8 Correct 123 ms 32760 KB Output is correct
9 Correct 130 ms 32692 KB Output is correct

Subtask #4
54.0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 294 ms 21852 KB Output is correct
12 Correct 305 ms 21740 KB Output is correct
13 Correct 288 ms 21660 KB Output is correct
14 Correct 292 ms 21836 KB Output is correct
15 Correct 296 ms 21776 KB Output is correct
16 Correct 297 ms 21192 KB Output is correct
17 Correct 296 ms 21132 KB Output is correct
18 Correct 293 ms 21156 KB Output is correct
19 Correct 293 ms 21740 KB Output is correct
20 Correct 142 ms 32684 KB Output is correct
21 Correct 106 ms 28332 KB Output is correct
22 Correct 105 ms 30044 KB Output is correct
23 Correct 149 ms 32736 KB Output is correct
24 Correct 142 ms 32744 KB Output is correct
25 Correct 126 ms 32736 KB Output is correct
26 Correct 123 ms 32720 KB Output is correct
27 Correct 123 ms 32760 KB Output is correct
28 Correct 130 ms 32692 KB Output is correct
29 Correct 761 ms 107912 KB Output is correct
30 Correct 699 ms 90852 KB Output is correct
31 Correct 644 ms 94848 KB Output is correct
32 Correct 733 ms 107848 KB Output is correct
33 Correct 748 ms 107892 KB Output is correct
34 Correct 724 ms 107208 KB Output is correct
35 Correct 714 ms 107164 KB Output is correct
36 Correct 720 ms 107140 KB Output is correct
37 Correct 737 ms 107868 KB Output is correct
38 Correct 698 ms 107908 KB Output is correct
39 Correct 680 ms 107932 KB Output is correct
40 Correct 655 ms 106196 KB Output is correct
41 Correct 630 ms 106012 KB Output is correct
42 Correct 625 ms 106000 KB Output is correct
43 Correct 684 ms 106888 KB Output is correct
44 Correct 664 ms 107900 KB Output is correct
45 Correct 717 ms 107920 KB Output is correct
46 Correct 642 ms 106388 KB Output is correct
47 Correct 642 ms 106388 KB Output is correct
48 Correct 643 ms 106248 KB Output is correct
49 Correct 638 ms 107388 KB Output is correct
50 Correct 688 ms 107904 KB Output is correct
51 Correct 687 ms 107920 KB Output is correct
52 Correct 643 ms 107100 KB Output is correct
53 Correct 642 ms 106972 KB Output is correct
54 Correct 658 ms 106964 KB Output is correct
55 Correct 679 ms 107804 KB Output is correct