Submission #1244430

#	Time	Username	Problem	Language	Result	Execution time	Memory
1244430		im2xtreme	Nile (IOI24_nile)	C++20	0 / 100	2093 ms	3912 KiB

nile

#include "nile.h"
#include <bits/stdc++.h>
using namespace std;

struct Artifact {
    int weight;
    int cost_alone;
    int cost_pair;
};

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<Artifact> artifacts(N);
    for (int i = 0; i < N; ++i) {
        artifacts[i] = {W[i], A[i], B[i]};
    }

    sort(artifacts.begin(), artifacts.end(), [](const Artifact &a, const Artifact &b) {
        return a.weight < b.weight;
    });

    vector<long long> R(Q);

    for (int q = 0; q < Q; ++q) {
        int d = E[q];
        vector<bool> used(N, false);
        long long total_cost = 0;

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

            int j = i + 1;
            while (j < N && (used[j] || artifacts[j].weight - artifacts[i].weight > d)) {
                ++j;
            }

            if (j < N && !used[j] && abs(artifacts[j].weight - artifacts[i].weight) <= d) {
                total_cost += artifacts[i].cost_pair + artifacts[j].cost_pair;
                used[i] = used[j] = true;
            } else {
                total_cost += artifacts[i].cost_alone;
                used[i] = true;
            }

            ++i;
        }

        R[q] = 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