Submission #1334072

#	Time	Username	Problem	Language	Result	Execution time	Memory
1334072		GoBananas69	Nile (IOI24_nile)	C++20	13 / 100	20 ms	3376 KiB

nile

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

typedef long long ll;

vector<ll> calculate_costs(vector<int> w, vector<int> A, vector<int> B, vector<int> E) {
    int n = w.size();
    vector<ll> c(n);
    ll cost = 0;
    for (int i = 0; i < n; ++i) {
        cost += B[i];
        c[i] = A[i] - B[i];
    }
    vector<ll> res(E.size());
    for (int k = 0; k < E.size(); ++k) {
        if (E[k] > 1) {
            if (n & 1) res[k] = cost + *min_element(c.begin(), c.end());
            else res[k] = cost;
        } else {
            if (n & 1) {
                ll mn = 1e18 + 3;
                for (int i = 0; i < n; i += 2) {
                    mn = min(mn, c[i]);
                }
                res[k] = cost + mn;
            }
            else res[k] = cost;
        }
    }
    return res;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 6
• Subtask 2: 13 / 13
• Subtask 3: 0 / 17
• Subtask 4: 0 / 11
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15
• Subtask 7: 0 / 18