#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> calculate_costs(
vector<int> W,
vector<int> A,
vector<int> B,
vector<int> E){
ll n = W.size();
ll w = 0LL;
for (auto b : B){
w += b;
}
if (n % 2 == 1){
ll minind = 0LL;
ll dif = LLONG_MAX;
for (ll i = 0LL; i < n; i++){
if (A[i] - B[i] < dif){
dif = A[i] - B[i];
minind = i;
}
}
w -= B[minind];
w += A[minind];
}
vector<ll> ans(E.size(), w);
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... |