Submission #800165

#	Time	Username	Problem	Language	Result	Execution time	Memory
800165		anton	Safety (NOI18_safety)	C++17	100 / 100	95 ms	5452 KiB

safety

#include<bits/stdc++.h>

using namespace std;
#define int long long
#define pii pair<int, int>

struct F{
    priority_queue<int> s;
    int shift_val =0;

    void shift(int v){
        shift_val += v;
    }

    int insert(int id){
        int v =id-shift_val;
        
        ////cout<<"inserting "<<id<<endl;
        s.push(v);
        s.push(v);
        
        int res = s.top() +shift_val;
        s.pop();
        return res;
    }
} L, R;
int n, h;
signed main(){
    cin>>n>>h;

    int res =0;
    int v;
    cin>>v;
    R.s.push(-v);
    L.s.push(v);
    R.shift(-h);
    L.shift(-h);

    int prev= v;
    for(int i = 1; i<n; i++){
        cin>>v;
        int ls, rs;
        if(prev<v){
            rs = R.insert(-v);
            res += abs(rs-(-v));
            L.s.push(-rs-L.shift_val);
        }
        else{
            ls = L.insert(v);
            res += abs(ls -v);
            R.s.push(-ls-R.shift_val);
        }
        R.shift(-h);
        L.shift(-h);
        prev= L.s.top() + R.shift_val;
        //cout<<res<<endl;
    }
    cout<<res<<endl;
}

• 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