This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3e5 + 30, MOD = 1e9 + 7;
int n,h;
ll a[N];
multiset<ll> l,r;
ll addl = 0,addr = 0;
void test(){
cin >> n >> h;
for(int i = 1;i <= n;i++){
cin >> a[i];
}
l.insert(a[1]);
r.insert(a[1]);
ll H = 0;
for(int i = 1;i <= n;i++){
ll L = (*l.rbegin()) + addl,R = (*r.begin()) + addr;
if(a[i] >= L && a[i] <= R){
l.insert(a[i] - addl);
r.insert(a[i] - addr);
}else if(a[i] >R){
H += (a[i] - R);
r.erase(r.find(R - addr));
l.insert(R - addl);
r.insert(a[i] - addr);r.insert(a[i] - addr);
}else{
H += (L - a[i]);
l.erase(l.find(L - addl));
r.insert(L - addr);
l.insert(a[i] - addl);
l.insert(a[i] - addl);
}
addl -= h;
addr += h;
}
assert(*r.begin()+addr >= 0);
cout << H << '\n';
}
int main() {
ios_base::sync_with_stdio(false);cin.tie(0);
int t = 1;
// cin >> t;
while(t--){
test();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |