#include "nile.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 10;
int n, q, w[N], a[N], b[N];
vector<ll> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) {
n = W.size(), q = E.size();
for (int i = 1; i <= n; i++) w[i] = W[i-1];
for (int i = 1; i <= n; i++) a[i] = A[i-1];
for (int i = 1; i <= n; i++) b[i] = B[i-1];
ll sum = 0;
for (int i = 1; i <= n; i++) sum += b[i];
if (n & 1) {
int mn = 1;
for (int i = 2; i <= n; i++) if (a[mn] - b[mn] > a[i] - b[i]) mn = i;
sum += a[mn] - b[mn];
}
vector<ll> ans;
for (int i = 1; i <= q; i++) {
ans.push_back(sum);
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |