oj.uz

답안 #1013069

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1013069 2024-07-03T06:50:53 Z Alihan_8 3단 점프 (JOI19_jumps) C++17
32 / 100
 4000 ms 12292 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define ar array
#define pb push_back
#define ln '\n'
#define int long long

using i64 = long long;

template <class F, class _S>
bool chmin(F &u, const _S &v){
    bool flag = false;
    if ( u > v ){
        u = v; flag |= true;
    }
    return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
    bool flag = false;
    if ( u < v ){
        u = v; flag |= true;
    }
    return flag;
}

const int N = 5e5 + 1;

int n;

struct SegTree{
    vector <int> T, add;

    SegTree(){
        T.resize(N * 8);

        add.resize(N * 8);
    }

    void push(int v, int l, int r){
        if ( l != r ){
            chmax(add[v * 2], add[v]);

            chmax(add[v * 2 + 1], add[v]);
        }

        chmax(T[v], add[v]);

        add[v] = 0;
    }

    void upd(int v, int l, int r, int tl, int tr, int x){
        push(v, l, r);

        if ( l > tr or r < tl ){
            return;
        }

        if ( tl <= l && tr >= r ){
            add[v] = x;

            push(v, l, r);

            return;
        }

        int md = (l + r) >> 1;

        upd(v * 2, l, md, tl, tr, x);

        upd(v * 2 + 1, md + 1, r, tl, tr, x);

        T[v] = max(T[v * 2], T[v * 2 + 1]);
    }

    void upd(int l, int r, int x){
        upd(1, 0, 2 * n, l, r, x);
    }

    int get(int v, int l, int r, int x){
        push(v, l, r);

        if ( l > x ){
            return 0;
        }

        if ( r <= x ){
            return T[v];
        }

        int md = (l + r) >> 1;

        return max(get(v * 2, l, md, x), get(v * 2 + 1, md + 1, r, x));
    }

    int get(int x){
        return get(1, 0, n * 2, x);
    }
};

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n;

    vector <int> a(n + 1);

    for ( int i = 1; i <= n; i++ ){
        cin >> a[i];
    }

    auto f = [&](int x, int l, int r){
        int opt = 0;

        if ( x > l ){ // x -> b
            int mx = a[x - 1], j = x - 2;

            for ( int i = x + 1; i <= r; i++ ){
                while ( j >= l && x - j <= i - x ){
                    chmax(mx, a[j]);

                    j--;
                }

                chmax(opt, mx + a[i] + a[x]);
            }
        }

        if ( x + 2 <= r ){ // x -> a
            int mx = a[x + 1], j = x + 2;

            for ( int i = x + 2; i <= r; i++ ){
                while ( j < i && i - j >= j - x ){
                    chmax(mx, a[j]);

                    j++;
                }

                chmax(opt, mx + a[i] + a[x]);
            }
        }

        if ( x - 2 >= l ){ // x -> c
            multiset <int> st{a[x - 1]};

            int j = x - 2;

            for ( int i = x - 1; i > l; i-- ){
                while ( j >= l && i - j <= x - i ){
                    st.insert(a[j]);

                    j--;
                }

                st.erase(st.find(a[i]));

                chmax(opt, *st.rbegin() + a[i] + a[x]);
            }
        }

        return opt;
    };

    int q; cin >> q;

    while ( q-- ){
        int l, r; cin >> l >> r;

        vector <ar<int,2>> b;

        for ( int i = l; i <= r; i++ ){
            b.pb({-a[i], i});
        }

        sort(all(b));

        vector <int> tmp;

        for ( int i = 0; i < min(30LL, (int)b.size()); i++ ){
            tmp.pb(b[i][1]);
        }

        int opt = 0;

        for ( auto &i: tmp ){
            chmax(opt, f(i, l, r));
        }

        cout << opt << ln;
    }


    cout << '\n';
}

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 4 ms 464 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Execution timed out 4065 ms 968 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 794 ms 11620 KB Output is correct
2 Correct 638 ms 11460 KB Output is correct
3 Correct 35 ms 9296 KB Output is correct
4 Correct 1501 ms 12292 KB Output is correct
5 Correct 1535 ms 11576 KB Output is correct
6 Correct 1931 ms 10732 KB Output is correct
7 Correct 1632 ms 9920 KB Output is correct
8 Correct 1757 ms 9920 KB Output is correct
9 Correct 521 ms 9408 KB Output is correct

Subtask #4
0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 4 ms 464 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Execution timed out 4065 ms 968 KB Time limit exceeded
12 Halted 0 ms 0 KB -