Submission #1296609

#	Time	Username	Problem	Language	Result	Execution time	Memory
1296609		rahimov.yr	Safety (NOI18_safety)	C++20	35 / 100	1917 ms	584 KiB

safety

#include <iostream>
#include <utility>
#include <algorithm>
#include <deque>
#define MAX_HEIGHT 5000
using namespace std;
int back_arr[2][MAX_HEIGHT+1];
inline void consider_insert(deque<pair<int,int>>& dq, int index, int value){
    while(!dq.empty()&&dq.back().second>=value)dq.pop_back();
    dq.emplace_back(index,value);
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,h;
    cin>>n>>h;
    int* arrprev=back_arr[0];
    int* arrcurr=back_arr[1];
    {
        int x;
        cin>>x;
        for(int j=0;j<=MAX_HEIGHT;++j){
            arrprev[j]=abs(j-x);
        }
    }
    for(int i=1;i<n;++i){
        int x;
        cin>>x;
        deque<pair<int,int>> dq; // index, value
        for(int j=0;j<min(MAX_HEIGHT,h);++j){
            consider_insert(dq,j,arrprev[j]);
        }
        for(int j=0;j<=MAX_HEIGHT;++j){
            if(j+h<=MAX_HEIGHT)consider_insert(dq,j+h,arrprev[j+h]);
            arrcurr[j]=dq.front().second;
            arrcurr[j]+=abs(j-x);
            if(dq.front().first==j-h)dq.pop_front();
        }
        swap(arrprev,arrcurr);
    }
    cout<<*min_element(arrprev,arrprev+MAX_HEIGHT+1)<<endl;
}

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