Submission #520673

#	Time	Username	Problem	Language	Result	Execution time	Memory
520673		two_sides	Safety (NOI18_safety)	C++17	100 / 100	52 ms	5544 KiB

safety

#include <bits/stdc++.h>

using namespace std;

using ll = long long;

priority_queue<ll,vector<ll>,less<ll>> lef;
priority_queue<ll,vector<ll>,greater<ll>> rig;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n; ll h, x, res = 0;
    cin >> n >> h >> x;
    lef.push(x); rig.push(x);
    for (int i = 1; i < n; i++) {
        ll d = h * i; cin >> x;
        ll l = lef.top() - d;
        ll r = rig.top() + d;
        if (x < l) {
            lef.push(x + d); lef.push(x + d);
            lef.pop(); rig.push(l - d);
            res += l - x;  
        } else if (x > r) {
            rig.push(x - d); rig.push(x - d);
            rig.pop(); lef.push(r + d);
            res += x - r;
        } else {
            lef.push(x + d); rig.push(x - d);
        }
    } 
    cout << res;
}

• 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