Submission #1236257

#	Time	Username	Problem	Language	Result	Execution time	Memory
1236257		mathias_abadie	Nile (IOI24_nile)	C++20	0 / 100	53 ms	3140 KiB

nile

#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;

vector<long long> calculate_costs(
    vector<int> W, vector<int> A, vector<int> B, vector<int> E
) {
    int N = W.size();
    int Q = E.size();
    vector<long long> R;

    for (int d : E) {
        vector<int> indices(N);
        for (int i = 0; i < N; ++i) indices[i] = i;

        sort(indices.begin(), indices.end(), [&](int i, int j) {
            return W[i] < W[j];
        });

        vector<bool> used(N, false);
        long long total_cost = 0;

        for (int i = 0; i < N; ++i) {
            if (used[indices[i]]) continue;

            if (i + 1 < N && !used[indices[i + 1]]) {
                int art1 = indices[i];
                int art2 = indices[i + 1];
                if (abs(W[art1] - W[art2]) <= d) {
                    long long pair_cost = B[art1] + B[art2];
                }
            }

            total_cost += A[indices[i]];
            used[indices[i]] = true;
        }

        R.push_back(total_cost);
    }

    return R;
}

• 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