oj.uz

답안 #1082592

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1082592 2024-08-31T16:56:39 Z Tymond 3단 점프 (JOI19_jumps) C++17
0 / 100
 25 ms 10484 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

pii bigger(pii x, pii y){
    if(x.fi != y.fi){
        return (x.fi > y.fi ? x : y);
    }
    return x;
}

const int MAXN = 5e5 + 7;
const int BASE = (1 << 19);
int a[MAXN];
pii tree[2 * BASE + 7];
int n, q;

void init(){
    for(int i = 1; i <= n; i++){
        tree[i + BASE] = {a[i], i};
    }

    for(int i = BASE - 1; i >= 1; i--){
        tree[i] = bigger(tree[2 * i], tree[2 * i + 1]);
    }
}

void upd(int ind, pii val){
    ind += BASE;
    tree[ind] = val;
    ind /= 2;
    while(ind > 0){
        tree[ind] = bigger(tree[2 * ind], tree[2 * ind + 1]);
        ind /= 2;
    }
}

int x, y;
pii query(int v, int l, int p){
    if(p < x || y < l){
        return {0, 0};
    }

    if(x <= l && p <= y){
        return tree[v];
    }
    int mid = (l + p) / 2;
    return bigger(query(2 * v, l, mid), query(2 * v + 1, mid + 1, p));
}

ll solve(int l, int p){
    x = l;
    y = p;

    int k = min(20, p - l + 1);
    vi vec;
    for(int i = 0; i < k; i++){
        pii akt = query(1, 0, BASE - 1);
        vec.pb(akt.se);
        upd(akt.se, {0, akt.se});
    }

    sort(all(vec));

    for(int i = 0; i < k; i++){
        upd(vec[i], {a[vec[i]], vec[i]});
    }

    ll res = 0;
    for(int i = 0; i < k; i++){
        for(int j = i + 1; j < k; j++){
            if(vec[j] == vec[i] + 1){
                continue;
            }

            x = vec[i] + 1;
            y = vec[i] + (vec[j] - vec[i]) / 2;
            res = max(res, (ll)a[vec[i]] + a[vec[j]] + query(1, 0, BASE - 1).fi);
        }
    }
    return res;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }

    init();
    cin >> q;
    while(q--){
        int l, p;
        cin >> l >> p;
        cout << solve(l, p) << '\n';
    }

    return 0;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6492 KB Output is correct
2 Correct 6 ms 4444 KB Output is correct
3 Correct 6 ms 4444 KB Output is correct
4 Correct 6 ms 6492 KB Output is correct
5 Correct 6 ms 6492 KB Output is correct
6 Correct 6 ms 6492 KB Output is correct
7 Incorrect 6 ms 6492 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6492 KB Output is correct
2 Correct 6 ms 4444 KB Output is correct
3 Correct 6 ms 4444 KB Output is correct
4 Correct 6 ms 6492 KB Output is correct
5 Correct 6 ms 6492 KB Output is correct
6 Correct 6 ms 6492 KB Output is correct
7 Incorrect 6 ms 6492 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 10324 KB Output is correct
2 Correct 18 ms 10484 KB Output is correct
3 Correct 16 ms 10332 KB Output is correct
4 Correct 19 ms 10324 KB Output is correct
5 Correct 18 ms 10332 KB Output is correct
6 Incorrect 14 ms 9816 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6492 KB Output is correct
2 Correct 6 ms 4444 KB Output is correct
3 Correct 6 ms 4444 KB Output is correct
4 Correct 6 ms 6492 KB Output is correct
5 Correct 6 ms 6492 KB Output is correct
6 Correct 6 ms 6492 KB Output is correct
7 Incorrect 6 ms 6492 KB Output isn't correct
8 Halted 0 ms 0 KB -