Submission #1333995

#TimeUsernameProblemLanguageResultExecution timeMemory
1333995GoBananas69Nile (IOI24_nile)C++20
17 / 100
2094 ms4144 KiB
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

typedef long long ll;

vector<ll> calculate_costs(vector<int> w, vector<int> A, vector<int> B, vector<int> E) {
    int n = w.size();
    sort(w.begin(), w.end());

    int q = E.size();
    vector<ll> res(q);

    for (int k = 0; k < q; ++k) {
        int d = E[k];
        int ans = 0;

        for (int i = 0; i < n; ) {
            if (i + 1 < n && w[i + 1] - w[i] <= d) {
                ans += 2;
                i += 2;
            } else {
                i += 1;
            }
        }

        res[k] = 2LL * n - ans;
    }

    return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...