Submission #1245315

#	Time	Username	Problem	Language	Result	Execution time	Memory
1245315		nibert	Nile (IOI24_nile)	C++20	6 / 100	17 ms	2632 KiB

nile

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

vector<long long> calculate_costs(
    vector<int> W, vector<int> A, 
    vector<int> B, vector<int> E) 
{
    int N = W.size();
    long long base_cost = 0;
    for (int b : B) base_cost += b;

    vector<long long> result(E.size());

    if (N % 2 == 0) {
        // Even number of artifacts — pair all
        fill(result.begin(), result.end(), base_cost);
    } else {
        // Odd — one artifact must go alone
        int min_extra = 1e9;
        for (int i = 0; i < N; ++i) {
            min_extra = min(min_extra, A[i] - B[i]);
        }
        long long total = base_cost + min_extra;
        fill(result.begin(), result.end(), total);
    }

    return result;
}

• Subtask 0: 0 / 0
• Subtask 1: 6 / 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