제출 #1079782

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1079782		12345678	Safety (NOI18_safety)	C++17	100 / 100	64 ms	7100 KiB

safety

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=2e5+5;

ll n, d, h[nx], lzl, lzr, res;
priority_queue<ll> pql, pqtl;
priority_queue<ll, vector<ll>, greater<ll>> pqr, pqtr;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>d;
    for (int i=1; i<=n; i++) cin>>h[i];
    pql.push(h[1]);
    pqr.push(h[1]);
    for (int i=2; i<=n; i++)
    {
        lzl-=d;
        lzr+=d;
        if (h[i]<pql.top()+lzl) res+=pql.top()+lzl-h[i];
        if (h[i]>pqr.top()+lzr) res+=h[i]-pqr.top()-lzr;
        pql.push(h[i]-lzl);
        pql.push(h[i]-lzl);
        while (pql.top()+lzl>pqr.top()+lzr) pqr.push(pql.top()+lzl-lzr), pql.pop();
        while (pql.size()>pqr.size()) pqr.push(pql.top()+lzl-lzr), pql.pop();
        while (pqr.size()>pql.size()) pql.push(pqr.top()+lzr-lzl), pqr.pop();
    }
    cout<<res;
}

• 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