Submission #320888

#	Time	Username	Problem	Language	Result	Execution time	Memory
320888		MarcoMeijer	Safety (NOI18_safety)	C++14	100 / 100	59 ms	7108 KiB

safety

#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
//===================//
//  Added libraries  //
//===================//
 
//===================//
//end added libraries//
//===================//
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 5e5;

ll n, h;
ll s[MX];
priority_queue<ll, vll, less<ll>> L; ll lOff = 0;
priority_queue<ll, vll, greater<ll>> R; ll rOff = 0;
ll curMin = 0;

void program() {
    IN(n, h);
    RE(i,n) IN(s[i]);

    L.push(s[0]);
    R.push(s[0]);

    REP(i,1,n) {
        lOff -= h;
        rOff += h;
        ll lVal = L.top() + lOff;
        ll rVal = R.top() + rOff;
        ll x = s[i];
        if(x < lVal) {
            L.push(x - lOff);
            L.push(x - lOff);
            L.pop();
            R.push(lVal - rOff);
            curMin += abs(x - lVal);
        } else if(x > rVal) {
            R.push(x - rOff);
            R.push(x - rOff);
            R.pop();
            L.push(rVal - lOff);
            curMin += abs(x - rVal);
        } else {
            L.push(x - lOff);
            R.push(x - rOff);
        }
    }

    OUTL(curMin);
}

• 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