Submission #977868

#	Time	Username	Problem	Language	Result	Execution time	Memory
977868		phoenix	Safety (NOI18_safety)	C++17	49 / 100	39 ms	5300 KiB

safety

#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int N = 200'200;

int n;

ll h;
ll s[N];


void solve() {
    ll base = 0;
    cin >> n >> h;
    for (int i = 1; i <= n; i++)
        cin >> s[i];
    
    priority_queue<int> L;
    priority_queue<int, vector<int>, greater<int>> R;
    ll dl = 0, dr = 0;
    L.push(s[1]);
    R.push(s[1]);

    for (int i = 2; i <= n; i++) {
        dl -= h;
        dr += h;
        ll lb = L.top() + dl, rb = R.top() + dr;
        if (lb <= s[i] && s[i] <= rb) {
            L.push(s[i] - dl);
            R.push(s[i] - dr);
        } else if (s[i] < lb) {
            L.push(s[i] - dl);
            L.push(s[i] - dl);
            L.pop();
            R.push(lb - dr);
            base += lb - s[i];
        } else {
            R.push(s[i] - dr);
            R.push(s[i] - dr);
            R.pop();
            L.push(rb - dl);
            base += s[i] - rb;
        }
    }
    cout << base;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    solve();
}

• 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: 0 / 22
• Subtask 9: 0 / 29