oj.uz

Submission #1102122

# Submission time Handle Problem Language Result Execution time Memory
1102122 2024-10-17T13:52:11 Z ro9669 Triple Jump (JOI19_jumps) C++17
32 / 100
 108 ms 47948 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define all(v) v.begin() , v.end()
#define sz(v) int(v.size())
#define unq(v) sort(all(v)); v.resize(unique(all(v)) - v.begin());
using namespace std;

typedef long long ll;
typedef pair<int , int> ii;
typedef pair<long long , int> lli;

const int maxN = int(2e5)+7;

int n , q , a[maxN] , res[maxN];
vector<ii> query[maxN];

struct node{
    int lazy , base , val;
    node(){
        lazy = base = val = 0;
    }
} st[4 * maxN];

#define lef(id) id * 2
#define rig(id) id * 2 + 1

void build(int id , int l , int r){
    if (l == r){
        st[id].base = a[l];
        return;
    }
    int mid = (l + r) / 2;
    build(lef(id) , l , mid);
    build(rig(id) , mid + 1 , r);
    st[id].base = max(st[lef(id)].base , st[rig(id)].base);
}

void modify(int id , int x){
    st[id].lazy = max(st[id].lazy , x);
    st[id].val = max(st[id].val , st[id].base + x);
}

void down(int id , int l , int r){
    int &x = st[id].lazy;
    if (l == r) return;
    modify(lef(id) , x);
    modify(rig(id) , x);
}

void update(int id , int l , int r , int u , int v , int x){
    if (v < l || r < u) return;
    if (u <= l && r <= v) return modify(id , x);
    down(id , l , r);
    int mid = (l + r) / 2;
    update(lef(id) , l , mid , u , v , x);
    update(rig(id) , mid + 1 , r , u , v , x);
    st[id].val = max(st[lef(id)].val , st[rig(id)].val);
}

int get(int id , int l , int r , int u , int v){
    if (v < l || r < u) return 0;
    if (u <= l && r <= v) return st[id].val;
    down(id , l , r);
    int mid = (l + r) / 2;
    return max(get(lef(id) , l , mid , u , v) , get(rig(id) , mid + 1 , r , u , v));
}

void update(int x , int y){
    int z = 2 * y - x;
    update(1 , 1 , n , z , n , a[x] + a[y]);
}

void solve(){
    cin >> n;
    for (int i = 1 ; i <= n ; i++) cin >> a[i];
    build(1 , 1 , n);
    cin >> q;
    for (int i = 1 ; i <= q ; i++){
        int l , r;
        cin >> l >> r;
        query[l].push_back({r , i});
    }
    deque<int> dq;
    for (int i = n ; i >= 1 ; i--){
        while (dq.empty() == 0 && a[i] >= a[dq.back()]){
            update(i , dq.back());
            dq.pop_back();
        }
        if (dq.empty() == 0) update(i , dq.back());
        for (auto it : query[i]){
            res[it.se] = get(1 , 1 , n , i , it.fi);
        }
        dq.push_back(i);
    }
    for (int i = 1 ; i <= q ; i++) cout << res[i] << "\n";
}

#define name "A"

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(name".INP" , "r")){
        freopen(name".INP" , "r" , stdin);
        freopen(name".OUT" , "w" , stdout);
    }
    int t = 1; //cin >> t;
    while (t--) solve();
    return 0;
}

Compilation message

jumps.cpp: In function 'int main()':
jumps.cpp:104:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  104 |         freopen(name".INP" , "r" , stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
jumps.cpp:105:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  105 |         freopen(name".OUT" , "w" , stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14420 KB Output is correct
2 Correct 10 ms 14420 KB Output is correct
3 Correct 10 ms 14420 KB Output is correct
4 Correct 10 ms 14420 KB Output is correct
5 Correct 10 ms 14420 KB Output is correct
6 Correct 9 ms 14584 KB Output is correct
7 Correct 9 ms 14420 KB Output is correct
8 Correct 9 ms 14420 KB Output is correct
9 Correct 9 ms 14360 KB Output is correct
10 Correct 9 ms 14420 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14420 KB Output is correct
2 Correct 10 ms 14420 KB Output is correct
3 Correct 10 ms 14420 KB Output is correct
4 Correct 10 ms 14420 KB Output is correct
5 Correct 10 ms 14420 KB Output is correct
6 Correct 9 ms 14584 KB Output is correct
7 Correct 9 ms 14420 KB Output is correct
8 Correct 9 ms 14420 KB Output is correct
9 Correct 9 ms 14360 KB Output is correct
10 Correct 9 ms 14420 KB Output is correct
11 Runtime error 96 ms 47948 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 16980 KB Output is correct
2 Correct 60 ms 17812 KB Output is correct
3 Correct 60 ms 16980 KB Output is correct
4 Correct 97 ms 16980 KB Output is correct
5 Correct 97 ms 16836 KB Output is correct
6 Correct 95 ms 16212 KB Output is correct
7 Correct 108 ms 16212 KB Output is correct
8 Correct 99 ms 16112 KB Output is correct
9 Correct 99 ms 16464 KB Output is correct

Subtask #4
0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14420 KB Output is correct
2 Correct 10 ms 14420 KB Output is correct
3 Correct 10 ms 14420 KB Output is correct
4 Correct 10 ms 14420 KB Output is correct
5 Correct 10 ms 14420 KB Output is correct
6 Correct 9 ms 14584 KB Output is correct
7 Correct 9 ms 14420 KB Output is correct
8 Correct 9 ms 14420 KB Output is correct
9 Correct 9 ms 14360 KB Output is correct
10 Correct 9 ms 14420 KB Output is correct
11 Runtime error 96 ms 47948 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -