Submission #1245096

#	Time	Username	Problem	Language	Result	Execution time	Memory
1245096		nibert	나일강 (IOI24_nile)	C++20	6 / 100	18 ms	3400 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) {
    long long n = A.size();
    long long q = E.size();
    long long cost = 0;

    vector<long long> costs(q);
    vector<long long> extra(n);
    
    for (int i = 0; i < n; i++) {
        extra[i] = (long long)A[i] - B[i];
        cost += (long long)B[i];
    }

    long long min_cost = extra[0];
    for (int i = 1; i < n; i++) {
        min_cost = min(min_cost, extra[i]);
    }

    for (int i = 0; i < q; i++) {
        if (n % 2 == 0) {
            costs[i] = cost;
        } else {
            costs[i] = cost + min_cost;
        }
    }

    return costs;
}

• 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