Submission #969910

#	Time	Username	Problem	Language	Result	Execution time	Memory
969910		VMaksimoski008	Safety (NOI18_safety)	C++17	100 / 100	82 ms	5476 KiB

safety

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
 
int32_t main() {
    ll n, h, ans = 0;
    cin >> n >> h;
 
    priority_queue<ll> L;
    priority_queue<ll, vector<ll>, greater<ll> > R;
 
    for(int i=0; i<n; i++) {
        ll x;
        cin >> x;
 
        if(!i) {
            L.push(x);
            R.push(x);
            continue;
        }
 
        ll range = i * h;
        if(x + range < L.top()) {
            L.push(x + range);
            ans += L.top() - (x + range);
            L.push(x + range);
            R.push(L.top() - 2 * range);
            L.pop();
        } else if(x - range > R.top()) {
            R.push(x - range);
            ans += (x - range) - R.top();
            R.push(x - range);
            L.push(R.top() + 2 * range);
            R.pop();
        } else {
            L.push(x + range);
            R.push(x - range);
        }
    }
 
    cout << ans << '\n';
    return 0;
}

• 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