Submission #231393

#	Time	Username	Problem	Language	Result	Execution time	Memory
231393		brcode	Safety (NOI18_safety)	C++14	100 / 100	160 ms	5528 KiB

safety

#include <iostream>
#include <bits/stdc++.h>

using namespace std;
long long ans;
priority_queue<long long> l;

priority_queue<long long,vector<long long>,greater<long long>> r;
int main(){
    long long n,k;
    cin>>n>>k;
    long long x;
    cin>>x;
    l.push(x);
    r.push(x);
    for(long long i=1;i<n;i++){
        long long x;
        cin>>x;
        long long offset = 1LL*i*(k);
        long long lborder = l.top()-offset;
        long long rborder = r.top()+offset;
        if(x<lborder){
            l.push(x+offset);
            l.push(x+offset);
            l.pop();
            r.push(lborder-offset);
            ans+=abs(lborder-x);
        }else if(x>rborder){
            r.push(x-offset);
            r.push(x-offset);
            r.pop();
            l.push(rborder+offset);
            ans+=abs(rborder-x);
        }else{
            l.push(x+offset);
            r.push(x-offset);
        }
    }
    cout<<ans<<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