Submission #868442

#	Time	Username	Problem	Language	Result	Execution time	Memory
868442		Warinchai	Safety (NOI18_safety)	C++14	4 / 100	54 ms	3348 KiB

safety

#include<bits/stdc++.h>
using namespace std;
priority_queue<int>pql;
priority_queue<int,vector<int>,greater<int> >pqr;
int lzl,lzr;
int ans=0;
int main(){
    int n,h;
    cin>>n>>h;
    for(int i=0;i<n;i++){
        int a;
        cin>>a;
        if(i>0&&a<pql.top()+lzl){
            //cout<<"left\n";
            pql.push(a-lzl);
            pql.push(a-lzl);
            ans+=abs(a-pql.top()-lzl);
            pqr.push(pql.top()+lzl-lzr);
            pql.pop();
        }else if(i>0&&a>pqr.top()+lzr){
            //cout<<"right\n";
            pqr.push(a-lzr);
            pqr.push(a-lzr);
            ans+=abs(a-pqr.top()-lzr);
            pql.push(pqr.top()+lzr-lzl);
            pqr.pop();
        }else{
            //cout<<"middle\n";
            pql.push(a-lzl);
            pqr.push(a-lzr);
        }
        lzl-=h;
        lzr+=h;
        //cout<<ans<<" ";
    }
    cout<<ans;
}

• Subtask 1: 0 / 3
• Subtask 2: 4 / 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