oj.uz

Submission #940041

# Submission time Handle Problem Language Result Execution time Memory
940041 2024-03-07T04:43:13 Z ReLice Global Warming (CEOI18_glo) C++17
27 / 100
 904 ms 108372 KB 
#include <bits/stdc++.h>
#define ll long long
#define str string
#define ins insert
#define ld long double
#define pb push_back
#define pf push_front
#define pof pop_front()
#define pob pop_back()
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz size()
#define vll vector<ll>
#define bc back()
#define arr array
#define pll vector<pair<ll,ll>>
using namespace std;/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>*/
template<class S,class T>
bool chmin(S &a,const T &b) {
	return a>b?(a=b)==b:false;
}
template<class S,class T>
bool chmax(S &a,const T &b) {
	return a<b?(a=b)==b:false;
}
//void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
void start(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
const ll inf=1e18;
const ll mod=998244353;
const ll N=1e6+5;
const ld eps=1e-9;
vll t0(N*4),t1(N*4);
void upd(ll id,ll pos,ll val,ll v=1,ll tl=1,ll tr=N){
    if(tl>pos || tr<pos) return;
    if(tl==tr){
        if(!id) chmax(t0[v],val);
        chmax(t1[v],val);
        return;
    }
    ll tm=(tl+tr)/2;
    upd(id,pos,val,v*2,tl,tm);
    upd(id,pos,val,v*2+1,tm+1,tr);
    t0[v]=max(t0[v*2],t0[v*2+1]);
    t1[v]=max(t1[v*2],t1[v*2+1]);
}
ll get(ll id,ll l,ll r,ll v=1,ll tl=1,ll tr=N){
    if(tl>r || tr<l) return 0;
    if(l<=tl && tr<=r)return (id ? t1[v] : max(t1[v],t0[v]));
    ll tm=(tl+tr)/2;
    return max(get(id,l,r,v*2,tl,tm),get(id,l,r,v*2+1,tm+1,tr));
}
void solve(){
    ll i,j;
    ll n,x;
    cin>>n>>x;
    ll a[n+5];
    set<ll> st;
    for(i=1;i<=n;i++){
        cin>>a[i];
        st.ins(a[i]);
        st.ins(a[i]+x);
    }
    map<ll,ll> pos;
    ll c=1;
    for(auto i : st){
        pos[i]=c++;
    }
    for(i=1;i<=n;i++){
        ll y2=get(1,1,pos[a[i]+x]-1);
        upd(1,pos[a[i]+x],y2+1);
        ll y=get(0,1,pos[a[i]]-1);
        upd(0,pos[a[i]],y+1);
    }
    cout<<get(1,1,st.sz+1)<<endl;
}

signed main(){
	start();
    ll t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}
/*
6
3 8 7 1 6 6
0 -1 9 1 2 0




*/

Compilation message

glo.cpp: In function 'void solve()':
glo.cpp:66:10: warning: unused variable 'j' [-Wunused-variable]
   66 |     ll i,j;
      |          ^

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 63064 KB Output is correct
2 Correct 12 ms 63064 KB Output is correct
3 Correct 9 ms 63068 KB Output is correct
4 Correct 9 ms 62864 KB Output is correct
5 Correct 8 ms 63068 KB Output is correct
6 Correct 10 ms 63068 KB Output is correct
7 Correct 9 ms 63056 KB Output is correct
8 Correct 9 ms 63068 KB Output is correct
9 Correct 10 ms 62980 KB Output is correct
10 Incorrect 9 ms 63068 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 63064 KB Output is correct
2 Correct 12 ms 63064 KB Output is correct
3 Correct 9 ms 63068 KB Output is correct
4 Correct 9 ms 62864 KB Output is correct
5 Correct 8 ms 63068 KB Output is correct
6 Correct 10 ms 63068 KB Output is correct
7 Correct 9 ms 63056 KB Output is correct
8 Correct 9 ms 63068 KB Output is correct
9 Correct 10 ms 62980 KB Output is correct
10 Incorrect 9 ms 63068 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 63064 KB Output is correct
2 Correct 12 ms 63064 KB Output is correct
3 Correct 9 ms 63068 KB Output is correct
4 Correct 9 ms 62864 KB Output is correct
5 Correct 8 ms 63068 KB Output is correct
6 Correct 10 ms 63068 KB Output is correct
7 Correct 9 ms 63056 KB Output is correct
8 Correct 9 ms 63068 KB Output is correct
9 Correct 10 ms 62980 KB Output is correct
10 Incorrect 9 ms 63068 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 463 ms 86356 KB Output is correct
2 Correct 479 ms 86544 KB Output is correct
3 Correct 533 ms 86540 KB Output is correct
4 Correct 487 ms 86356 KB Output is correct
5 Correct 244 ms 75344 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 74412 KB Output is correct
2 Correct 117 ms 74368 KB Output is correct
3 Correct 140 ms 74780 KB Output is correct
4 Incorrect 74 ms 68688 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 400 ms 85760 KB Output is correct
2 Correct 347 ms 85584 KB Output is correct
3 Correct 904 ms 108372 KB Output is correct
4 Correct 313 ms 86552 KB Output is correct
5 Correct 186 ms 85588 KB Output is correct
6 Correct 358 ms 106068 KB Output is correct
7 Correct 371 ms 106300 KB Output is correct
8 Correct 232 ms 85768 KB Output is correct

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 63064 KB Output is correct
2 Correct 12 ms 63064 KB Output is correct
3 Correct 9 ms 63068 KB Output is correct
4 Correct 9 ms 62864 KB Output is correct
5 Correct 8 ms 63068 KB Output is correct
6 Correct 10 ms 63068 KB Output is correct
7 Correct 9 ms 63056 KB Output is correct
8 Correct 9 ms 63068 KB Output is correct
9 Correct 10 ms 62980 KB Output is correct
10 Incorrect 9 ms 63068 KB Output isn't correct
11 Halted 0 ms 0 KB -