Submission #1000630

#	Time	Username	Problem	Language	Result	Execution time	Memory
1000630		vjudge1	Safety (NOI18_safety)	C++17	0 / 100	77 ms	13192 KiB

safety

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int  N = 3e5 + 30, MOD = 1e9 + 7;

int n,h,a[N];
multiset<int> l,r;
int addl = 0,addr = 0;
void test(){
    cin >> n >> h;
    for(int i = 1;i <= n;i++){
        cin >> a[i];
    }
    l.insert(a[1]);
    r.insert(a[1]);
    ll H = 0;
    for(int i = 1;i <= n;i++){
        int L = (*l.rbegin()) + addl,R = (*r.begin()) + addr;
        if(a[i] >= L && a[i] <= R){
            l.insert(a[i] - addl);
            r.insert(a[i] - addr);
        }else if(a[i] >R){
            H += (a[i] - R);
            r.erase(r.find(R - addr));
            l.insert(R - addl);
            r.insert(a[i] - addr);r.insert(a[i] - addr);
        }else{
            H  += (L - a[i]);
            l.erase(l.find(L - addl));
            r.insert(L - addr);
            l.insert(a[i] - addl);
            l.insert(a[i] - addl);
        }
        addl -= h;
        addr += h;
    }
    cout << H << '\n';
}
int main() {
    ios_base::sync_with_stdio(false);cin.tie(0);
    int t = 1;
    // cin >> t;
    while(t--){
        test();
    }
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 4
• Subtask 3: 0 / 9
• Subtask 4: 0 / 5
• Subtask 5: 0 / 6
• Subtask 6: 0 / 11
• Subtask 7: 0 / 11
• Subtask 8: 0 / 22
• Subtask 9: 0 / 29