Submission #1054509

#	Time	Username	Problem	Language	Result	Execution time	Memory
1054509		unnick	Safety (NOI18_safety)	C++14	9 / 100	2099 ms	262144 KiB

safety

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

typedef long long int ll;

int main() {
    int n, h;
    cin >> n >> h;
    if (h == 0) {
        vector<int> a;
        ll sum = 0;

        for (int i = 0; i < n; i++) {
            int tmp;
            cin >> tmp;
            a.push_back(tmp);
        }

        sort(a.begin(), a.end());
        int p = a[a.size() / 2];

        for (auto v : a) {
            sum += abs(v-p);
        }

        cout << sum << "\n";
        return 0;
    }

    vector<int> a(n);

    int q = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        q = max(q, a[i]);
    }
    q++;

    vector<ll> aa(q);
    vector<ll> ab(q);

    for (int i = 0; i < q; i++) {
        aa[i] = abs(a[0]-i);
    }

    for (int j = 1; j < n; j++) {
        for (int i = 0; i < q; i++) {
            ll tmp = 0x7FFFFFFFFFFFFFFFLL;
            for (int o = -h; o <= h; o++) {
                if (i+o >= 0 && i+o < q) tmp = min(tmp, aa[i+o]);
            }
            ab[i] = tmp + abs(i - a[j]);
        }
        aa.swap(ab);
    }

    ll sol = 0x7FFFFFFFFFFFFFFFLL;

    for (int i = 0; i < q; i++) sol = min(sol, aa[i]);
    cout << sol << "\n";
}

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