Submission #1278223

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

nile

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

// subtask 1
vector<ll> calculate_costs(vector<int> w, vector<int> a, vector<int> b, vector<int> e) {
    ll q = e.size();
    ll n = w.size();

    vector<ll> ans(q);
    vector<ll> c(n);
    int sum = 0;
    for (int i = 0; i < n; ++i) {
        c[i] = a[i] - b[i];
        sum += b[i];
    }
    sort(c.begin(), c.end());

    for (ll _ = 0; _ < q; ++_) {
        ans[_] = sum;
        if (n & 1) ans[_] += c[0];
    }
    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