Submission #1000658

#	Time	Username	Problem	Language	Result	Execution time	Memory
1000658		vjudge1	Safety (NOI18_safety)	C++17	100 / 100	147 ms	20580 KiB

safety

#include<bits/stdc++.h>
 
using namespace std;
 
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
#define int ll
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pii;
typedef pair<ll, ll> pll;
 
#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mispertion ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define F first
#define S second
#define getlast(s) (*s.rbegin())
#define debg cout << "OK\n"
 
const ld PI = 3.1415926535;
const int N = 2e5+10;
const int M = 7e6 + 1;
int mod = 1e9+7;
const int infi = INT_MAX;
const ll infl = LLONG_MAX;
const int P = 2;
 
int mult(int a, int b) {
    return a * 1LL * b % mod;
}
 
int sum(int a, int b) { 
    if (a + b < 0)
        return a + b + mod;
    if (a + b >= mod)
        return a + b - mod;
    return a + b;
}
 
ll binpow(ll a, ll n) {
    if (n == 0)
        return 1;
    if (n % 2 == 1) {
        return binpow(a, n - 1) * a % mod;
    } else {
        ll b = binpow(a, n / 2);
        return b * b % mod;
    }
}

int n, H, add, s[N], ans;
multiset<int> l, r;
 
void solve(){
    cin >> n >> H;
    for(int i = 1; i <= n; i++)
        cin >> s[i];
    l.insert(s[1]);
    r.insert(s[1]);
    for(int i = 2; i <= n; i++){
        add += H;
        int lf = (*l.rbegin()) - add, rg = (*r.begin()) + add;
        if(s[i] >= lf && s[i] <= rg){
            l.insert(s[i] + add);
            r.insert(s[i] - add);
        }else if(s[i] > rg){
            ans += (s[i] - rg);
            r.erase(r.begin());
            l.insert(rg + add);
            r.insert(s[i] - add);
            r.insert(s[i] - add);
        }else{
            ans += (lf - s[i]);
            l.erase(--l.end());
            r.insert(lf - add);
            l.insert(s[i] + add);
            l.insert(s[i] + add);
        }
    }
    cout << ans << '\n';
}
 
signed main() {
    mispertion;
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}

• 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