Submission #871889

#	Time	Username	Problem	Language	Result	Execution time	Memory
871889		DylanSmith	Safety (NOI18_safety)	C++17	100 / 100	77 ms	9332 KiB

safety

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
 
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x),end(x)
#define lb(x,y) lower_bound(all(x),y)-begin(x)

mt19937 rng;

void solve() {
    int N, H; cin >> N >> H;
    vector<int> arr(N);
    for (int i = 0; i < N; i++) cin >> arr[i];
    priority_queue<ll> left, right;
    left.push(arr[0]);
    right.push(-arr[0]);
    ll lOff = 0, rOff = 0;
    ll a = 1, b = -arr[0];
    for (int i = 1; i < N; i++) {
        lOff -= H;
        rOff += H;
        b -= a * H;
        a++;
        b += -arr[i];
        if (arr[i] <= left.top() + lOff) {
            left.push(arr[i] - lOff);
            left.push(arr[i] - lOff);
            right.push(-(left.top() + lOff - rOff));
            left.pop();
        } else if (arr[i] <= -right.top() + rOff) {
            left.push(arr[i] - lOff);
            right.push(-(arr[i] - rOff));
        } else {
            right.push(-(arr[i] - rOff));
            right.push(-(arr[i] - rOff));
            left.push(-right.top() + rOff - lOff);
            right.pop();
        }
    }
    vector<ll> srt;
    while (!right.empty()) {
        srt.pb(-right.top() + rOff);
        right.pop();
    }
    reverse(all(srt));
    for (ll x : srt) {
        b += x;
    }
    cout << b << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    rng = mt19937(chrono::steady_clock::now().time_since_epoch().count());
    
    solve();

    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