Submission #1000647

#	Time	Username	Problem	Language	Result	Execution time	Memory
1000647		vjudge1	Safety (NOI18_safety)	C++17	100 / 100	168 ms	22988 KiB

safety

#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()
#define int ll

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
signed main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t=1;
  // cin>>t;
  while(t--)solve();
}
// #endif

• Subtask 1: 3 / 3
• Subtask 2: 4 / 4
• Subtask 3: 9 / 9
• Subtask 4: 5 / 5
• Subtask 5: 6 / 6
• Subtask 6: 11 / 11
• Subtask 7: 11 / 11
• Subtask 8: 22 / 22
• Subtask 9: 29 / 29