Submission #1279952

#	Time	Username	Problem	Language	Result	Execution time	Memory
1279952		GoBananas69	Nile (IOI24_nile)	C++20	0 / 100	21 ms	3372 KiB

nile

#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
typedef long long ll;
using namespace std;

// subtask 3: c[i] = 1
vector<ll> calculate_costs(vector<int> W, vector<int> a, vector<int> b, vector<int> e) {
    ll n = a.size();
    ll q = e.size();
    vector<ll> ans(q);
    vector<ll> w(n);
    ll sum = 0;
    for (int i = 0; i < n; ++i) {
        w[i] = (ll)W[i];
        sum += b[i];
    }

    sort(w.begin(), w.end());
    const ll inf = 1e18 + 3;

    for (int x = 0; x < q; ++x) {
        ll d = e[x];
        ans[x] = sum;
        vector<bool> ok(n, false);
        for (int i = 0; i < n - 1; ++i) {
            if (ok[i]) continue;
            if (w[i + 1] - w[i] <= d) {
                ok[i] = true;
                ok[i + 1] = true;
            } else {
                ok[i] = true;
                ++ans[x];
            }
        }
    }
    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 6
• Subtask 2: 0 / 13
• Subtask 3: 0 / 17
• Subtask 4: 0 / 11
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15
• Subtask 7: 0 / 18