Submission #1278200

#	Time	Username	Problem	Language	Result	Execution time	Memory
1278200		GoBananas69	Nile (IOI24_nile)	C++20	0 / 100	58 ms	4144 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();
    vector<ll> ans(q);
    for (ll _ = 0; _ < q; ++_) {
        ll n = w.size();
        // {a[i], b[i]}
        vector<pair<ll, ll>> v(n);
        for (ll i = 0; i < n; ++i) v[i] = {a[i], b[i]};
        sort(v.begin(), v.end());
        ll res = 0;
        for (ll i = 1; i < n; i += 2) res += (v[i].second + v[i + 1].second);
        if (n & 1) res += v[0].first;
        ans[_] = res;
    }
    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