Submission #1294666

#	Time	Username	Problem	Language	Result	Execution time	Memory
1294666		trandangquang	Triple Jump (JOI19_jumps)	C++20	100 / 100	724 ms	97260 KiB

jumps

#include<bits/stdc++.h>
using namespace std;

#define foru(i,a,b) for(int i=(a); i<=(b); ++i)
#define ford(i,a,b) for(int i=(a); i>=(b); --i)
#define rep(i,a) for(int i=0; i<(a); ++i)
#define sz(a) (int)(a).size()
#define all(a) (a).begin(),(a).end()
#define bit(s,i) (((s)>>(i))&1)
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define fi first
#define se second
#define ll long long
#define eb emplace_back
#define pb push_back
#define __builtin_popcount __builtin_popcountll
#define _ << " " <<

template <class X, class Y> bool maxi(X &x, Y y){return x<y?x=y,true:false;}
template <class X, class Y> bool mini(X &x, Y y){return x>y?x=y,true:false;}

const int N=5e5+5;
const int INF=1e9;

int n,q,a[N],lq[N],rq[N],ansq[N],l[N],r[N];
vii que[N],add[N];

#define lc id<<1
#define rc id<<1|1

int mx[N<<2],ans[N<<2],lz[N<<2];

void apply(int id, int val){
    maxi(lz[id],val);
    maxi(ans[id],mx[id]+val);
}
void down(int id){
    if(lz[id]==-INF) return;
    apply(lc,lz[id]);
    apply(rc,lz[id]);
    lz[id]=-INF;
}
void setp(int x, int val){
    int id=1, l=1, r=n;
    while(l<r){
        int mid=(l+r)>>1;
        down(id);
        if(x<=mid) r=mid, id=lc;
        else l=mid+1, id=rc;
    }
    maxi(mx[id],val);
    while(id>1){
        id/=2;
        mx[id]=max(mx[lc],mx[rc]);
        ans[id]=max(ans[lc],ans[rc]);
    }
}
void updc(int u, int v, int val, int id=1, int l=1, int r=n){
    if(u>r||v<l) return;
    if(u<=l&&r<=v){
        apply(id,val);
        return;
    }
    int mid=(l+r)>>1;
    down(id);
    updc(u,v,val,lc,l,mid);
    updc(u,v,val,rc,mid+1,r);
    mx[id]=max(mx[lc],mx[rc]);
    ans[id]=max(ans[lc],ans[rc]);
}
int get(int u, int v, int id=1, int l=1, int r=n){
    if(u>r||v<l) return -INF;
    if(u<=l&&r<=v) return ans[id];
    int mid=(l+r)>>1;
    down(id);
    return max(get(u,v,lc,l,mid),get(u,v,rc,mid+1,r));
}

void solve(){
    cin>>n;
    foru(i,1,n){
        cin>>a[i];
    }
    cin>>q;
    foru(i,1,q){
        cin>>lq[i]>>rq[i];
        que[rq[i]].eb(lq[i],i);
    }

    foru(i,1,n){
        l[i]=i-1;
        while(l[i]>0 && a[l[i]]<a[i]) l[i]=l[l[i]];
    }
    ford(i,n,1){
        r[i]=i+1;
        while(r[i]<=n && a[r[i]]<a[i]) r[i]=r[r[i]];
    }

    foru(i,1,n){
        if(l[i]>0){
            if(2*i-l[i]<=n){
                add[2*i-l[i]].eb(l[i], a[i]+a[l[i]]);
            }
        }
        if(r[i]<=n){
            if(2*r[i]-i<=n){
                add[2*r[i]-i].eb(i, a[i]+a[r[i]]);
            }
        }
    }

    foru(i,1,n<<2){
        mx[i]=ans[i]=lz[i]=-INF;
    }
    foru(i,1,n){
        for(auto [j,val]:add[i]){
            setp(j,val);
        }
        updc(1,i,a[i]);
        for(auto [l,id]:que[i]){
            ansq[id]=get(l,i);
        }
    }

    foru(i,1,q) cout<<ansq[i]<<'\n';
}

int32_t main(){
    #define task "test"
    if(fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    cin.tie(0)->sync_with_stdio(0);

    int tc=1; //cin>>tc;
    foru(i,1,tc){
        solve();
    }
}

Compilation message (stderr)

jumps.cpp: In function 'int32_t main()':
jumps.cpp:133:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  133 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
jumps.cpp:134:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  134 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 14 / 14
• Subtask 3: 27 / 27
• Subtask 4: 54 / 54