Submission #586337

#	Time	Username	Problem	Language	Result	Execution time	Memory
586337		Jomnoi	Safety (NOI18_safety)	C++17	100 / 100	47 ms	6280 KiB

safety

#include <bits/stdc++.h>
using namespace std;

const int MAX_N = 2e5 + 5;

int S[MAX_N];
priority_queue <long long> L;
priority_queue <long long, vector <long long>, greater <long long>> R;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int N, H;
    cin >> N >> H;
    
    for(int i = 1; i <= N; i++) {
        cin >> S[i];
    }

    L.push(S[1]);
    R.push(S[1]);
    long long yMin = 0, shift = 0; 
    for(int i = 2; i <= N; i++) {
        shift += H;

        if(S[i] < L.top() - shift) {
            yMin += (L.top() - shift) - S[i];
            R.push(L.top() - 2 * shift);
            L.pop();
            L.push(S[i] + shift);
            L.push(S[i] + shift);
        }
        else if(S[i] > R.top() + shift) {
            yMin += S[i] - (R.top() + shift);
            L.push(R.top() + 2 * shift);
            R.pop();
            R.push(S[i] - shift);
            R.push(S[i] - shift);
        }
        else {
            L.push(S[i] + shift);
            R.push(S[i] - shift);
        }
    }
    cout << yMin;
    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