제출 #728088

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
728088		Ozy	Safety (NOI18_safety)	C++17	100 / 100	228 ms	21012 KiB

safety

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define repa(i,a,b) for(int i = (a); i >= (b); i--)
#define debug(a) cout << #a << " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "
#define lli long long int
#define pll pair<lli,lli>

//para sol
#define pend first
#define ord second

lli n,d,a,b,offset;
pll sol;
multiset<lli> menores,mayores;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> d;
    offset = 0;
    rep(i,1,n) {

        cin >> a;
        if (!menores.empty()) b = (*menores.rbegin());
        else b = 0;
        b -= offset;
        if (a > b) {
            b = a - offset;
            mayores.insert(b);
            mayores.insert(b);

            auto it = mayores.begin();
            b = (*it);
            mayores.erase(it);
            b += offset*2;
            menores.insert(b);
        }
        else {
            b = a + offset;
            menores.insert(b);
            menores.insert(b);

            auto it = menores.end();
            it--;
            b = (*it);
            menores.erase(it);
            b -= offset*2;
            mayores.insert(b);
        }

        sol.pend++;
        sol.ord -= a;
        //ahora recorro
        sol.ord -= sol.pend*d;

        offset += d;
    }

    auto it = mayores.end();
    do {
        it--;

        sol.pend--;
        sol.ord += offset+(*it);
    } while (it != mayores.begin());

    cout << sol.ord;

    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