oj.uz

Submission #393929

# Submission time Handle Problem Language Result Execution time Memory
393929 2021-04-24T23:55:45 Z tostes Global Warming (CEOI18_glo) C++17
0 / 100
 160 ms 17516 KB 
#include<bits/stdc++.h>
//#include<iostream>
//#include<vector>
using namespace std;
#define _ << ' ' <<
#define pb push_back
#define all(x) begin(x), end(x)
#define mp make_pair
#define f first
#define s second
#define sz(x) int((x).size())
using ll = long long;
using db = long double;
using pl = pair<ll,ll>;
using pi = pair<int,int>;

void trad(vector<ll>a, ll x){
  int n=a.size();
  set < pl > lis;
  vector < ll > tr(n,1);
  for(int i=n-1; i>=0; i--){
    auto p = lis.upper_bound({a[i],1e15});
    if(p!=lis.end()){
      tr[i]+=p->s;
    }
    lis.insert({a[i],tr[i]});
    auto pp = lis.find({a[i],tr[i]});

    if(next(pp)!=lis.end() and (next(pp)->s == tr[i])) lis.erase(pp);
    else if(pp!=lis.begin() and (prev(pp)->s == tr[i])) lis.erase(prev(pp));
  }

  
  ll ans = *max_element(all(tr));
  set < pl > Lis;

  for(int i=0; i<n-1; i++){
    auto p = Lis.upper_bound({a[i]-x,1e15});
    if(p!=Lis.end()){
      if(p->f > a[i]-x){
        Lis.insert({a[i]-x, p->s});
        Lis.erase(p);
      }
    }
    else Lis.insert({a[i]-x, Lis.size()+1});

    auto w = Lis.lower_bound({a[i+1],0});
    ll ct=Lis.size();
    if(w!=Lis.end()) ct = (w->s)-1;
    ans = max(ans, ct + tr[i+1]);
  }

  cout << ans << endl;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  //freopen("nocross.in", "r", stdin);
  //freopen("nocross.out", "w", stdout);
  int n; ll x;
  cin >> n >> x;
  vector < ll > a(n);
  for(auto &w: a) cin >> w;
  trad(a,x);
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 5048 KB Output is correct
2 Correct 123 ms 5092 KB Output is correct
3 Correct 128 ms 5104 KB Output is correct
4 Correct 123 ms 5168 KB Output is correct
5 Incorrect 160 ms 17432 KB Output isn't correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 1484 KB Output is correct
2 Correct 28 ms 1536 KB Output is correct
3 Correct 28 ms 1496 KB Output is correct
4 Incorrect 34 ms 4564 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 2704 KB Output is correct
2 Correct 54 ms 2888 KB Output is correct
3 Correct 111 ms 5084 KB Output is correct
4 Incorrect 160 ms 17516 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -