oj.uz

Submission #1000644

# Submission time Handle Problem Language Result Execution time Memory
1000644 2024-06-18T05:44:48 Z vjudge1 Safety (NOI18_safety) C++17
4 / 100
 99 ms 14444 KB 
#include <bits/stdc++.h>
 
#define ll long long
#define lb lower_bound
#define pii pair<int,int>
#define pll pair<ll,ll>
#define F first
#define S second
#define ld long double
#define pb push_back
#define all(v) v.begin(),v.end()
#define in insert
#define sz(s) (int)s.size()

using namespace std;
 
const int MAX=2e5+10;
const int inf=2e9;

int n,H;
int a[MAX];

void solve(){
  cin>>n>>H;
  multiset<int> l,r;
  for(int i=1;i<=n;i++){
    cin>>a[i];
  }
  int st=0;
  int slope=0;
  int add=0;
  for(int i=1;i<=n;i++){
    add+=H;
    st+=a[i]+add;
    slope--;
    l.in(a[i]+add);
    l.in(a[i]+add);
    while(!r.empty()&&!l.empty()&&*l.rbegin()-2*add>*r.begin()){
      int L=*r.begin()+2*add;
      int R=*l.rbegin()-2*add;
      l.erase(--l.end());
      r.erase(r.begin());
      l.in(L);
      r.in(R);
    }
    while(sz(l)>abs(slope)){
      r.in(*l.rbegin()-2*add);
      l.erase(--l.end());
    }
  }
  vector<int> vec;
  for(int x:l){
    // cout<<x-add<<" ";
    vec.pb(x-add);
  }
  // cout<<"\n";
  // cout<<st<<" "<<*r.rbeg<<"\n";
  int prev=-add;
  for(int i=0;i<sz(vec);i++){
    st+=(vec[i]-prev)*slope;
    prev=vec[i];
    slope++;
  }
  cout<<st<<"\n";
}

// #ifdef LOCAL
int main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t=1;
  // cin>>t;
  while(t--)solve();
}
// #endif

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 432 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

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

Subtask #5
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 432 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 432 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 432 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #8
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 432 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #9
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 432 KB Output isn't correct
5 Halted 0 ms 0 KB -