oj.uz

Submission #572500

# Submission time Handle Problem Language Result Execution time Memory
572500 2022-06-04T14:05:24 Z Vanilla Triple Jump (JOI19_jumps) C++17
0 / 100
 49 ms 32356 KB 
#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
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);}};
// string __fname = ""; ifstream in (__fname + ".in"); ofstream out (__fname + ".out"); 
// #define cin in 
// #define cout out
#define int64 long long
#define uint64 unsigned long long
#define x first
#define y second
#define pb push_back
#define pii pair <int, int> 
#define pii64 pair <int64, int64>
#define db(x) cout << "> " << #x << ": " << (x) << "\n"
#define qr queries()
#define yn(x) if (x) {ctn("Yes");}else {ctn("No");}
void solve(int);
void queries(){int n;cin >> n;for (int i = 1; i <= n; i++) solve(i);}
template<class T>T ceildiv(T a, T b) {return a / b + !!(a % b);}
template<class T>T gcd (T a, T b){return (b ? gcd(b, a % b): a);}
template<class T>T lcm (T a, T b){return a * b / gcd(a, b);}
// // // // // // // // // // // // // // // // // // // // // // 
/*                  TEMPLATE - VANILLA                         */
// // // // // // // // // // // // // // // // // // // // // //
const int ddx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int ddy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const double pi = 3.14159265359;
const double eps = 1e-6;
const int64 hash_inv = 940594066;
const int64 hash_p = 101;
const int64 mod = 1e9 + 7;
const int maxn = 5e5 + 2;
int a[maxn];
int n;

struct node {
    pii el1, el2;

    node() {}

    node(int x, int y) {
        el2 = {x,y};
    }

    const node operator + (const node &p) {
        node nw;
        vector <pii> s = {el1, el2, p.el1, p.el2};;
        sort(s.begin(), s.end());
        nw.el1 = s[2], nw.el2 = s[3];
        return nw;
    }

} sg[4 * maxn];

node build (int x, int l, int r) {
    if (l == r) return sg[x] = node(a[l], l);
    int mid = (l + r) / 2;
    return sg[x] = build(x * 2, l, mid) + build(x * 2 + 1, mid + 1, r);
}

node query (int x, int l, int r, int _l, int _r) {
    if (l > r) return node();
    if (_l <= l && r <= _r) return sg[x];
    if (r < _l || l > _r) return node();
    int mid = (l + r) / 2;
    return query (x * 2, l, mid, _l, _r) + query(x * 2 + 1, mid + 1, r, _l, _r);
}

void solve(int id){
    int l,r;
    cin >> l >> r;
    node k = query(1, 1, n, l, r);
    int p1 = k.el1.y, p2 = k.el2.y;
    if (p1 > p2) swap(p1, p2);
    int dist = p2 - p1;
    int rs = 0;
    if (p1 != l) rs = query(1, 1, n, max(l, p1 - dist), p1 - 1).el2.x + a[p1] + a[p2];
    if (dist != 1) rs = max(rs, a[p1] + query(1, 1, n, p1 + 1, min(p1 + dist / 2, r)).el2.x + a[p2]);
    if (p2 != r) rs = max(rs, a[p1] + a[p2] + query(1, 1, n, min(p2 + dist, r + 1), r).el2.x);
    cout << rs << "\n";
    return;
}


int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed; cout << setprecision(10); 
    cin >> n;
    for (int i = 1; i <= n; i++){
        cin >> a[i];
    }
    build(1, 1, n);
    qr;
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31572 KB Output is correct
2 Incorrect 15 ms 31516 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31572 KB Output is correct
2 Incorrect 15 ms 31516 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 32340 KB Output is correct
2 Correct 39 ms 32344 KB Output is correct
3 Correct 40 ms 32340 KB Output is correct
4 Incorrect 49 ms 32356 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31572 KB Output is correct
2 Incorrect 15 ms 31516 KB Output isn't correct
3 Halted 0 ms 0 KB -