oj.uz

Submission #1085342

# Submission time Handle Problem Language Result Execution time Memory
1085342 2024-09-08T05:24:37 Z steveonalex Triple Jump (JOI19_jumps) C++17
0 / 100
 54 ms 36200 KB 
// #include "rect.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const ll INF = 1e18 + 69;

struct SegmentTree{
    ll n;
    vector<pair<ll, ll>> a;

    SegmentTree(ll _n){
        n = _n;
        a.resize(n * 2 + 2, {-INF, 0});
    }

    void update(ll i, pair<ll, ll> v){
        i += n; a[i] = v;
        while(i > 1){
            i >>= 1;
            a[i] = max(a[i * 2], a[i * 2 + 1]);
        }
    }

    pair<ll, ll> get(ll l, ll r){
        l += n; r += n + 1;
        pair<ll, ll> ans = {-INF, 0};
        while(l < r){
            if (l & 1) maximize(ans, a[l++]);
            if (r & 1) maximize(ans, a[--r]);
            l >>= 1; r >>= 1;
        }
        return ans;
    }
};

const ll NECESSARY = 20;
const ll N = 2e5 + 69, LOG_N = 18;
ll rmq[LOG_N][N];

ll get(ll l, ll r){
    if (l > r) return -INF;
    ll j = logOf(r - l + 1);
    return max(rmq[j][l], rmq[j][r - MASK(j) + 1]);
}

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    ll n; cin >> n;
    vector<ll> a(n+1);
    for(ll i = 1; i<=n; ++i) cin >> a[i];

    for(ll i = 1; i<=n; ++i) rmq[0][i] = a[i];
    for(ll j = 1; MASK(j) <= n; ++j)
    for(ll i = 1; i<=n-MASK(j)+1; ++i)
        rmq[j][i] = max(rmq[j-1][i], rmq[j-1][i + MASK(j-1)]);

    SegmentTree st(n);
    for(ll i = 1; i<=n; ++i){
        st.update(i, {a[i], i});
    }

    ll q; cin >> q;

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

        vector<ll> pos;
        for(ll i = 0; i < min(NECESSARY, r - l + 1); ++i){
            pair<ll, ll> cur = st.get(l, r);
            pos.push_back(cur.second);
            st.update(cur.second, {-INF, cur.second});
        }

        ll ans = 0;
        for(ll i: pos) for(ll j: pos) if (j > i){
            ll dis = j - i;
            maximize(ans, a[i] + a[j] + get(max(i - dis, l), i-1));
            maximize(ans, a[i] + a[j] + get(j + dis, r));
            if (dis > 1){
                maximize(ans, a[i] + a[j] + get(i+1, i + dis / 2));
            }
        }

        cout << ans << "\n";

        for(ll i: pos){
            st.update(i, {a[i], i});
        }
    }



    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Incorrect 1 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Incorrect 1 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 36184 KB Output is correct
2 Correct 54 ms 36156 KB Output is correct
3 Correct 31 ms 36180 KB Output is correct
4 Correct 35 ms 36188 KB Output is correct
5 Correct 37 ms 36200 KB Output is correct
6 Incorrect 32 ms 35412 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Incorrect 1 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -